include "ground_2/relocation/rtmap_sle.ma".
coinductive sand: relation3 rtmap rtmap rtmap ≝
-| sand_pp: â\88\80f1,f2,f,g1,g2,g. sand f1 f2 f â\86\92 â\86\91f1 = g1 â\86\92 â\86\91f2 = g2 â\86\92 â\86\91f = g → sand g1 g2 g
-| sand_np: â\88\80f1,f2,f,g1,g2,g. sand f1 f2 f â\86\92 ⫯f1 = g1 â\86\92 â\86\91f2 = g2 â\86\92 â\86\91f = g → sand g1 g2 g
-| sand_pn: â\88\80f1,f2,f,g1,g2,g. sand f1 f2 f â\86\92 â\86\91f1 = g1 â\86\92 ⫯f2 = g2 â\86\92 â\86\91f = g → sand g1 g2 g
-| sand_nn: â\88\80f1,f2,f,g1,g2,g. sand f1 f2 f â\86\92 ⫯f1 = g1 â\86\92 ⫯f2 = g2 â\86\92 ⫯f = g → sand g1 g2 g
+| sand_pp: â\88\80f1,f2,f,g1,g2,g. sand f1 f2 f â\86\92 ⫯f1 = g1 â\86\92 ⫯f2 = g2 â\86\92 ⫯f = g → sand g1 g2 g
+| sand_np: â\88\80f1,f2,f,g1,g2,g. sand f1 f2 f â\86\92 â\86\91f1 = g1 â\86\92 ⫯f2 = g2 â\86\92 ⫯f = g → sand g1 g2 g
+| sand_pn: â\88\80f1,f2,f,g1,g2,g. sand f1 f2 f â\86\92 ⫯f1 = g1 â\86\92 â\86\91f2 = g2 â\86\92 ⫯f = g → sand g1 g2 g
+| sand_nn: â\88\80f1,f2,f,g1,g2,g. sand f1 f2 f â\86\92 â\86\91f1 = g1 â\86\92 â\86\91f2 = g2 â\86\92 â\86\91f = g → sand g1 g2 g
.
interpretation "intersection (rtmap)"
(* Basic inversion lemmas ***************************************************)
-lemma sand_inv_ppx: â\88\80g1,g2,g. g1 â\8b\92 g2 â\89¡ g â\86\92 â\88\80f1,f2. â\86\91f1 = g1 â\86\92 â\86\91f2 = g2 →
- â\88\83â\88\83f. f1 â\8b\92 f2 â\89¡ f & â\86\91f = g.
+lemma sand_inv_ppx: â\88\80g1,g2,g. g1 â\8b\92 g2 â\89\98 g â\86\92 â\88\80f1,f2. ⫯f1 = g1 â\86\92 ⫯f2 = g2 →
+ â\88\83â\88\83f. f1 â\8b\92 f2 â\89\98 f & ⫯f = g.
#g1 #g2 #g * -g1 -g2 -g
#f1 #f2 #f #g1 #g2 #g #Hf #H1 #H2 #H0 #x1 #x2 #Hx1 #Hx2 destruct
try (>(injective_push … Hx1) -x1) try (>(injective_next … Hx1) -x1)
/2 width=3 by ex2_intro/
qed-.
-lemma sand_inv_npx: â\88\80g1,g2,g. g1 â\8b\92 g2 â\89¡ g â\86\92 â\88\80f1,f2. ⫯f1 = g1 â\86\92 â\86\91f2 = g2 →
- â\88\83â\88\83f. f1 â\8b\92 f2 â\89¡ f & â\86\91f = g.
+lemma sand_inv_npx: â\88\80g1,g2,g. g1 â\8b\92 g2 â\89\98 g â\86\92 â\88\80f1,f2. â\86\91f1 = g1 â\86\92 ⫯f2 = g2 →
+ â\88\83â\88\83f. f1 â\8b\92 f2 â\89\98 f & ⫯f = g.
#g1 #g2 #g * -g1 -g2 -g
#f1 #f2 #f #g1 #g2 #g #Hf #H1 #H2 #H0 #x1 #x2 #Hx1 #Hx2 destruct
try (>(injective_push … Hx1) -x1) try (>(injective_next … Hx1) -x1)
/2 width=3 by ex2_intro/
qed-.
-lemma sand_inv_pnx: â\88\80g1,g2,g. g1 â\8b\92 g2 â\89¡ g â\86\92 â\88\80f1,f2. â\86\91f1 = g1 â\86\92 ⫯f2 = g2 →
- â\88\83â\88\83f. f1 â\8b\92 f2 â\89¡ f & â\86\91f = g.
+lemma sand_inv_pnx: â\88\80g1,g2,g. g1 â\8b\92 g2 â\89\98 g â\86\92 â\88\80f1,f2. ⫯f1 = g1 â\86\92 â\86\91f2 = g2 →
+ â\88\83â\88\83f. f1 â\8b\92 f2 â\89\98 f & ⫯f = g.
#g1 #g2 #g * -g1 -g2 -g
#f1 #f2 #f #g1 #g2 #g #Hf #H1 #H2 #H0 #x1 #x2 #Hx1 #Hx2 destruct
try (>(injective_push … Hx1) -x1) try (>(injective_next … Hx1) -x1)
/2 width=3 by ex2_intro/
qed-.
-lemma sand_inv_nnx: â\88\80g1,g2,g. g1 â\8b\92 g2 â\89¡ g â\86\92 â\88\80f1,f2. ⫯f1 = g1 â\86\92 ⫯f2 = g2 →
- â\88\83â\88\83f. f1 â\8b\92 f2 â\89¡ f & ⫯f = g.
+lemma sand_inv_nnx: â\88\80g1,g2,g. g1 â\8b\92 g2 â\89\98 g â\86\92 â\88\80f1,f2. â\86\91f1 = g1 â\86\92 â\86\91f2 = g2 →
+ â\88\83â\88\83f. f1 â\8b\92 f2 â\89\98 f & â\86\91f = g.
#g1 #g2 #g * -g1 -g2 -g
#f1 #f2 #f #g1 #g2 #g #Hf #H1 #H2 #H0 #x1 #x2 #Hx1 #Hx2 destruct
try (>(injective_push … Hx1) -x1) try (>(injective_next … Hx1) -x1)
(* Basic properties *********************************************************)
-corec lemma sand_eq_repl_back1: â\88\80f2,f. eq_repl_back â\80¦ (λf1. f1 â\8b\92 f2 â\89¡ f).
+corec lemma sand_eq_repl_back1: â\88\80f2,f. eq_repl_back â\80¦ (λf1. f1 â\8b\92 f2 â\89\98 f).
#f2 #f #f1 * -f1 -f2 -f
#f1 #f2 #f #g1 #g2 #g #Hf #H1 #H2 #H0 #x #Hx
try cases (eq_inv_px … Hx … H1) try cases (eq_inv_nx … Hx … H1) -g1
/3 width=7 by sand_pp, sand_np, sand_pn, sand_nn/
qed-.
-lemma sand_eq_repl_fwd1: â\88\80f2,f. eq_repl_fwd â\80¦ (λf1. f1 â\8b\92 f2 â\89¡ f).
+lemma sand_eq_repl_fwd1: â\88\80f2,f. eq_repl_fwd â\80¦ (λf1. f1 â\8b\92 f2 â\89\98 f).
#f2 #f @eq_repl_sym /2 width=3 by sand_eq_repl_back1/
qed-.
-corec lemma sand_eq_repl_back2: â\88\80f1,f. eq_repl_back â\80¦ (λf2. f1 â\8b\92 f2 â\89¡ f).
+corec lemma sand_eq_repl_back2: â\88\80f1,f. eq_repl_back â\80¦ (λf2. f1 â\8b\92 f2 â\89\98 f).
#f1 #f #f2 * -f1 -f2 -f
#f1 #f2 #f #g1 #g2 #g #Hf #H #H2 #H0 #x #Hx
try cases (eq_inv_px … Hx … H2) try cases (eq_inv_nx … Hx … H2) -g2
/3 width=7 by sand_pp, sand_np, sand_pn, sand_nn/
qed-.
-lemma sand_eq_repl_fwd2: â\88\80f1,f. eq_repl_fwd â\80¦ (λf2. f1 â\8b\92 f2 â\89¡ f).
+lemma sand_eq_repl_fwd2: â\88\80f1,f. eq_repl_fwd â\80¦ (λf2. f1 â\8b\92 f2 â\89\98 f).
#f1 #f @eq_repl_sym /2 width=3 by sand_eq_repl_back2/
qed-.
-corec lemma sand_eq_repl_back3: â\88\80f1,f2. eq_repl_back â\80¦ (λf. f1 â\8b\92 f2 â\89¡ f).
+corec lemma sand_eq_repl_back3: â\88\80f1,f2. eq_repl_back â\80¦ (λf. f1 â\8b\92 f2 â\89\98 f).
#f1 #f2 #f * -f1 -f2 -f
#f1 #f2 #f #g1 #g2 #g #Hf #H #H2 #H0 #x #Hx
try cases (eq_inv_px … Hx … H0) try cases (eq_inv_nx … Hx … H0) -g
/3 width=7 by sand_pp, sand_np, sand_pn, sand_nn/
qed-.
-lemma sand_eq_repl_fwd3: â\88\80f1,f2. eq_repl_fwd â\80¦ (λf. f1 â\8b\92 f2 â\89¡ f).
+lemma sand_eq_repl_fwd3: â\88\80f1,f2. eq_repl_fwd â\80¦ (λf. f1 â\8b\92 f2 â\89\98 f).
#f1 #f2 @eq_repl_sym /2 width=3 by sand_eq_repl_back3/
qed-.
-corec lemma sand_refl: â\88\80f. f â\8b\92 f â\89¡ f.
+corec lemma sand_refl: â\88\80f. f â\8b\92 f â\89\98 f.
#f cases (pn_split f) * #g #H
[ @(sand_pp … H H H) | @(sand_nn … H H H) ] -H //
qed.
-corec lemma sand_sym: â\88\80f1,f2,f. f1 â\8b\92 f2 â\89¡ f â\86\92 f2 â\8b\92 f1 â\89¡ f.
+corec lemma sand_sym: â\88\80f1,f2,f. f1 â\8b\92 f2 â\89\98 f â\86\92 f2 â\8b\92 f1 â\89\98 f.
#f1 #f2 #f * -f1 -f2 -f
#f1 #f2 #f #g1 #g2 #g #Hf * * * -g1 -g2 -g
[ @sand_pp | @sand_pn | @sand_np | @sand_nn ] /2 width=7 by/