X-Git-Url: http://matita.cs.unibo.it/gitweb/?p=helm.git;a=blobdiff_plain;f=matita%2Fmatita%2Fcontribs%2Flambdadelta%2Fstatic_2%2Fstatic%2Ffsle_fsle.ma;h=73de6fcd6a8a913baf1fb9b67a895e787c703314;hp=e97d5e4c1c0c83279caf2d064b302e19e2474ab5;hb=bd53c4e895203eb049e75434f638f26b5a161a2b;hpb=3b7b8afcb429a60d716d5226a5b6ab0d003228b1 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 e97d5e4c1..73de6fcd6 100644 --- a/matita/matita/contribs/lambdadelta/static_2/static/fsle_fsle.ma +++ b/matita/matita/contribs/lambdadelta/static_2/static/fsle_fsle.ma @@ -20,9 +20,9 @@ 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. + ∀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 @@ -32,8 +32,8 @@ 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,8 +42,8 @@ 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 @@ -53,8 +53,8 @@ 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 @@ -66,8 +66,8 @@ lapply (sle_eq_repl_back1 … Hf … Hfg0) -f0 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 @@ -79,8 +79,8 @@ lapply (sle_eq_repl_back2 … Hg … Hgf0) -g0 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 @@ -94,8 +94,8 @@ 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 @@ -105,8 +105,8 @@ elim (sor_isfin_ex f1 (⫱f2)) /3 width=3 by frees_fwd_isfin, isfin_tl/ #f #Hf # qed. theorem fsle_flat_sn: - ∀L1,L2,V1,T1,T. ⦃L1,V1⦄ ⊆ ⦃L2,T⦄ → ⦃L1,T1⦄ ⊆ ⦃L2,T⦄ → - ∀I. ⦃L1,ⓕ{I}V1.T1⦄ ⊆ ⦃L2,T⦄. + ∀L1,L2,V1,T1,T. ❪L1,V1❫ ⊆ ❪L2,T❫ → ❪L1,T1❫ ⊆ ❪L2,T❫ → + ∀I. ❪L1,ⓕ[I]V1.T1❫ ⊆ ❪L2,T❫. #L1 #L2 #V1 #T1 #T * #n1 #x #f1 #g #Hf1 #Hg #H1n1 #H2n1 #H #I elim (fsle_frees_trans … H … Hg) -H #n2 #n #f2 #Hf2 #H1n2 #H2n2 elim (lveq_inj … H1n1 … H1n2) -H1n2 #H1 #H2 destruct @@ -115,9 +115,9 @@ elim (sor_isfin_ex f1 f2) /2 width=3 by frees_fwd_isfin/ #f #Hf #_ qed. theorem fsle_bind_eq: - ∀L1,L2. |L1| = |L2| → ∀V1,V2. ⦃L1,V1⦄ ⊆ ⦃L2,V2⦄ → - ∀I2,T1,T2. ⦃L1.ⓧ,T1⦄ ⊆ ⦃L2.ⓑ{I2}V2,T2⦄ → - ∀p,I1. ⦃L1,ⓑ{p,I1}V1.T1⦄ ⊆ ⦃L2,ⓑ{p,I2}V2.T2⦄. + ∀L1,L2. |L1| = |L2| → ∀V1,V2. ❪L1,V1❫ ⊆ ❪L2,V2❫ → + ∀I2,T1,T2. ❪L1.ⓧ,T1❫ ⊆ ❪L2.ⓑ[I2]V2,T2❫ → + ∀p,I1. ❪L1,ⓑ[p,I1]V1.T1❫ ⊆ ❪L2,ⓑ[p,I2]V2.T2❫. #L1 #L2 #HL #V1 #V2 * #n1 #m1 #f1 #g1 #Hf1 #Hg1 #H1L #Hfg1 #I2 #T1 #T2 * #n2 #m2 #f2 #g2 #Hf2 #Hg2 #H2L #Hfg2 #p #I1 @@ -129,9 +129,9 @@ elim (sor_isfin_ex g1 (⫱g2)) /3 width=3 by frees_fwd_isfin, isfin_tl/ #g #Hg # qed. theorem fsle_bind: - ∀L1,L2,V1,V2. ⦃L1,V1⦄ ⊆ ⦃L2,V2⦄ → - ∀I1,I2,T1,T2. ⦃L1.ⓑ{I1}V1,T1⦄ ⊆ ⦃L2.ⓑ{I2}V2,T2⦄ → - ∀p. ⦃L1,ⓑ{p,I1}V1.T1⦄ ⊆ ⦃L2,ⓑ{p,I2}V2.T2⦄. + ∀L1,L2,V1,V2. ❪L1,V1❫ ⊆ ❪L2,V2❫ → + ∀I1,I2,T1,T2. ❪L1.ⓑ[I1]V1,T1❫ ⊆ ❪L2.ⓑ[I2]V2,T2❫ → + ∀p. ❪L1,ⓑ[p,I1]V1.T1❫ ⊆ ❪L2,ⓑ[p,I2]V2.T2❫. #L1 #L2 #V1 #V2 * #n1 #m1 #f1 #g1 #Hf1 #Hg1 #H1L #Hfg1 #I1 #I2 #T1 #T2 * #n2 #m2 #f2 #g2 #Hf2 #Hg2 #H2L #Hfg2 #p @@ -143,7 +143,7 @@ elim (sor_isfin_ex g1 (⫱g2)) /3 width=3 by frees_fwd_isfin, isfin_tl/ #g #Hg # qed. theorem fsle_flat: - ∀L1,L2,V1,V2. ⦃L1,V1⦄ ⊆ ⦃L2,V2⦄ → - ∀T1,T2. ⦃L1,T1⦄ ⊆ ⦃L2,T2⦄ → - ∀I1,I2. ⦃L1,ⓕ{I1}V1.T1⦄ ⊆ ⦃L2,ⓕ{I2}V2.T2⦄. + ∀L1,L2,V1,V2. ❪L1,V1❫ ⊆ ❪L2,V2❫ → + ∀T1,T2. ❪L1,T1❫ ⊆ ❪L2,T2❫ → + ∀I1,I2. ❪L1,ⓕ[I1]V1.T1❫ ⊆ ❪L2,ⓕ[I2]V2.T2❫. /3 width=1 by fsle_flat_sn, fsle_flat_dx_dx, fsle_flat_dx_sn/ qed-.