X-Git-Url: http://matita.cs.unibo.it/gitweb/?a=blobdiff_plain;f=matita%2Fmatita%2Fcontribs%2Flambdadelta%2Fstatic_2%2Fstatic%2Ffsle_fsle.ma;h=7dafa423bfc2e97ccc46766c90ca3cffc06d9458;hb=98e786e1a6bd7b621e37ba7cd4098d4a0a6f8278;hp=588182317cdf7db2a2614bd0b2d76aac30b45061;hpb=5b5dca0c118dfbe3ba8f0514ef07549544eb7810;p=helm.git diff --git a/matita/matita/contribs/lambdadelta/static_2/static/fsle_fsle.ma b/matita/matita/contribs/lambdadelta/static_2/static/fsle_fsle.ma index 588182317..7dafa423b 100644 --- a/matita/matita/contribs/lambdadelta/static_2/static/fsle_fsle.ma +++ b/matita/matita/contribs/lambdadelta/static_2/static/fsle_fsle.ma @@ -19,21 +19,21 @@ include "static_2/static/fsle_fqup.ma". (* Advanced inversion lemmas ************************************************) -lemma fsle_frees_trans: - ∀L1,L2,T1,T2. ⦃L1,T1⦄ ⊆ ⦃L2,T2⦄ → - ∀f2. L2 ⊢ 𝐅+⦃T2⦄ ≘ f2 → - ∃∃n1,n2,f1. L1 ⊢ 𝐅+⦃T1⦄ ≘ f1 & L1 ≋ⓧ*[n1,n2] L2 & ⫱*[n1]f1 ⊆ ⫱*[n2]f2. +lemma fsle_frees_trans: + ∀L1,L2,T1,T2. ❪L1,T1❫ ⊆ ❪L2,T2❫ → + ∀f2. L2 ⊢ 𝐅+❪T2❫ ≘ f2 → + ∃∃n1,n2,f1. L1 ⊢ 𝐅+❪T1❫ ≘ f1 & L1 ≋ⓧ*[n1,n2] L2 & ⫰*[n1]f1 ⊆ ⫰*[n2]f2. #L1 #L2 #T1 #T2 * #n1 #n2 #f1 #g2 #Hf1 #Hg2 #HL #Hn #f2 #Hf2 lapply (frees_mono … Hg2 … Hf2) -Hg2 -Hf2 #Hgf2 -lapply (tls_eq_repl n2 … Hgf2) -Hgf2 #Hgf2 -lapply (sle_eq_repl_back2 … Hn … Hgf2) -g2 +lapply (pr_tls_eq_repl n2 … Hgf2) -Hgf2 #Hgf2 +lapply (pr_sle_eq_repl_back_dx … Hn … Hgf2) -g2 /2 width=6 by ex3_3_intro/ qed-. lemma fsle_frees_trans_eq: ∀L1,L2. |L1| = |L2| → - ∀T1,T2. ⦃L1,T1⦄ ⊆ ⦃L2,T2⦄ → ∀f2. L2 ⊢ 𝐅+⦃T2⦄ ≘ f2 → - ∃∃f1. L1 ⊢ 𝐅+⦃T1⦄ ≘ f1 & f1 ⊆ f2. + ∀T1,T2. ❪L1,T1❫ ⊆ ❪L2,T2❫ → ∀f2. L2 ⊢ 𝐅+❪T2❫ ≘ f2 → + ∃∃f1. L1 ⊢ 𝐅+❪T1❫ ≘ f1 & f1 ⊆ f2. #L1 #L2 #H1L #T1 #T2 #H2L #f2 #Hf2 elim (fsle_frees_trans … H2L … Hf2) -T2 #n1 #n2 #f1 #Hf1 #H2L #Hf12 elim (lveq_inj_length … H2L) // -L2 #H1 #H2 destruct @@ -42,45 +42,66 @@ qed-. lemma fsle_inv_frees_eq: ∀L1,L2. |L1| = |L2| → - ∀T1,T2. ⦃L1,T1⦄ ⊆ ⦃L2,T2⦄ → - ∀f1. L1 ⊢ 𝐅+⦃T1⦄ ≘ f1 → ∀f2. L2 ⊢ 𝐅+⦃T2⦄ ≘ f2 → + ∀T1,T2. ❪L1,T1❫ ⊆ ❪L2,T2❫ → + ∀f1. L1 ⊢ 𝐅+❪T1❫ ≘ f1 → ∀f2. L2 ⊢ 𝐅+❪T2❫ ≘ f2 → f1 ⊆ f2. #L1 #L2 #H1L #T1 #T2 #H2L #f1 #Hf1 #f2 #Hf2 elim (fsle_frees_trans_eq … H2L … Hf2) // -L2 -T2 -/3 width=6 by frees_mono, sle_eq_repl_back1/ +/3 width=6 by frees_mono, pr_sle_eq_repl_back_sn/ +qed-. + +lemma fsle_frees_conf: + ∀L1,L2,T1,T2. ❪L1,T1❫ ⊆ ❪L2,T2❫ → + ∀f1. L1 ⊢ 𝐅+❪T1❫ ≘ f1 → + ∃∃n1,n2,f2. L2 ⊢ 𝐅+❪T2❫ ≘ f2 & L1 ≋ⓧ*[n1,n2] L2 & ⫰*[n1]f1 ⊆ ⫰*[n2]f2. +#L1 #L2 #T1 #T2 * #n1 #n2 #g1 #g2 #Hg1 #Hg2 #HL #Hn #f1 #Hf1 +lapply (frees_mono … Hg1 … Hf1) -Hg1 -Hf1 #Hgf1 +lapply (pr_tls_eq_repl n1 … Hgf1) -Hgf1 #Hgf1 +lapply (pr_sle_eq_repl_back_sn … Hn … Hgf1) -g1 +/2 width=6 by ex3_3_intro/ +qed-. + +lemma fsle_frees_conf_eq: + ∀L1,L2. |L1| = |L2| → + ∀T1,T2. ❪L1,T1❫ ⊆ ❪L2,T2❫ → ∀f1. L1 ⊢ 𝐅+❪T1❫ ≘ f1 → + ∃∃f2. L2 ⊢ 𝐅+❪T2❫ ≘ f2 & f1 ⊆ f2. +#L1 #L2 #H1L #T1 #T2 #H2L #f1 #Hf1 +elim (fsle_frees_conf … H2L … Hf1) -T1 #n1 #n2 #f2 #Hf2 #H2L #Hf12 +elim (lveq_inj_length … H2L) // -L1 #H1 #H2 destruct +/2 width=3 by ex2_intro/ qed-. (* Main properties **********************************************************) theorem fsle_trans_sn: - ∀L1,L2,T1,T. ⦃L1,T1⦄ ⊆ ⦃L2,T⦄ → - ∀T2. ⦃L2,T⦄ ⊆ ⦃L2,T2⦄ → ⦃L1,T1⦄ ⊆ ⦃L2,T2⦄. + ∀L1,L2,T1,T. ❪L1,T1❫ ⊆ ❪L2,T❫ → + ∀T2. ❪L2,T❫ ⊆ ❪L2,T2❫ → ❪L1,T1❫ ⊆ ❪L2,T2❫. #L1 #L2 #T1 #T * #m1 #m0 #g1 #g0 #Hg1 #Hg0 #Hm #Hg #T2 * #n0 #n2 #f0 #f2 #Hf0 #Hf2 #Hn #Hf lapply (frees_mono … Hf0 … Hg0) -Hf0 -Hg0 #Hfg0 elim (lveq_inj_length … Hn) // -Hn #H1 #H2 destruct -lapply (sle_eq_repl_back1 … Hf … Hfg0) -f0 -/4 width=10 by sle_tls, sle_trans, ex4_4_intro/ +lapply (pr_sle_eq_repl_back_sn … Hf … Hfg0) -f0 +/4 width=10 by pr_sle_tls, pr_sle_trans, ex4_4_intro/ qed-. theorem fsle_trans_dx: - ∀L1,T1,T. ⦃L1,T1⦄ ⊆ ⦃L1,T⦄ → - ∀L2,T2. ⦃L1,T⦄ ⊆ ⦃L2,T2⦄ → ⦃L1,T1⦄ ⊆ ⦃L2,T2⦄. + ∀L1,T1,T. ❪L1,T1❫ ⊆ ❪L1,T❫ → + ∀L2,T2. ❪L1,T❫ ⊆ ❪L2,T2❫ → ❪L1,T1❫ ⊆ ❪L2,T2❫. #L1 #T1 #T * #m1 #m0 #g1 #g0 #Hg1 #Hg0 #Hm #Hg #L2 #T2 * #n0 #n2 #f0 #f2 #Hf0 #Hf2 #Hn #Hf lapply (frees_mono … Hg0 … Hf0) -Hg0 -Hf0 #Hgf0 elim (lveq_inj_length … Hm) // -Hm #H1 #H2 destruct -lapply (sle_eq_repl_back2 … Hg … Hgf0) -g0 -/4 width=10 by sle_tls, sle_trans, ex4_4_intro/ +lapply (pr_sle_eq_repl_back_dx … Hg … Hgf0) -g0 +/4 width=10 by pr_sle_tls, pr_sle_trans, ex4_4_intro/ qed-. theorem fsle_trans_rc: - ∀L1,L,T1,T. |L1| = |L| → ⦃L1,T1⦄ ⊆ ⦃L,T⦄ → - ∀L2,T2. |L| = |L2| → ⦃L,T⦄ ⊆ ⦃L2,T2⦄ → ⦃L1,T1⦄ ⊆ ⦃L2,T2⦄. + ∀L1,L,T1,T. |L1| = |L| → ❪L1,T1❫ ⊆ ❪L,T❫ → + ∀L2,T2. |L| = |L2| → ❪L,T❫ ⊆ ❪L2,T2❫ → ❪L1,T1❫ ⊆ ❪L2,T2❫. #L1 #L #T1 #T #HL1 * #m1 #m0 #g1 #g0 #Hg1 #Hg0 #Hm #Hg #L2 #T2 #HL2 @@ -88,62 +109,62 @@ theorem fsle_trans_rc: lapply (frees_mono … Hg0 … Hf0) -Hg0 -Hf0 #Hgf0 elim (lveq_inj_length … Hm) // -Hm #H1 #H2 destruct elim (lveq_inj_length … Hn) // -Hn #H1 #H2 destruct -lapply (sle_eq_repl_back2 … Hg … Hgf0) -g0 -/3 width=10 by lveq_length_eq, sle_trans, ex4_4_intro/ +lapply (pr_sle_eq_repl_back_dx … Hg … Hgf0) -g0 +/3 width=10 by lveq_length_eq, pr_sle_trans, ex4_4_intro/ qed-. theorem fsle_bind_sn_ge: ∀L1,L2. |L2| ≤ |L1| → - ∀V1,T1,T. ⦃L1,V1⦄ ⊆ ⦃L2,T⦄ → ⦃L1.ⓧ,T1⦄ ⊆ ⦃L2,T⦄ → - ∀p,I. ⦃L1,ⓑ{p,I}V1.T1⦄ ⊆ ⦃L2,T⦄. + ∀V1,T1,T. ❪L1,V1❫ ⊆ ❪L2,T❫ → ❪L1.ⓧ,T1❫ ⊆ ❪L2,T❫ → + ∀p,I. ❪L1,ⓑ[p,I]V1.T1❫ ⊆ ❪L2,T❫. #L1 #L2 #HL #V1 #T1 #T * #n1 #x #f1 #g #Hf1 #Hg #H1n1 #H2n1 #H #p #I elim (fsle_frees_trans … H … Hg) -H #n2 #n #f2 #Hf2 #H1n2 #H2n2 elim (lveq_inj_void_sn_ge … H1n1 … H1n2) -H1n2 // #H1 #H2 #H3 destruct -elim (sor_isfin_ex f1 (⫱f2)) /3 width=3 by frees_fwd_isfin, isfin_tl/ #f #Hf #_ -