1 (**************************************************************************)
4 (* ||A|| A project by Andrea Asperti *)
6 (* ||I|| Developers: *)
7 (* ||T|| The HELM team. *)
8 (* ||A|| http://helm.cs.unibo.it *)
10 (* \ / This file is distributed under the terms of the *)
11 (* v GNU General Public License Version 2 *)
13 (**************************************************************************)
15 include "ground_2/notation/relations/istotal_1.ma".
16 include "ground_2/relocation/rtmap_at.ma".
18 (* RELOCATION MAP ***********************************************************)
20 definition istot: predicate rtmap ≝ λf. ∀i. ∃j. @⦃i, f⦄ ≘ j.
22 interpretation "test for totality (rtmap)"
23 'IsTotal f = (istot f).
25 (* Basic inversion lemmas ***************************************************)
27 lemma istot_inv_push: ∀g. 𝐓⦃g⦄ → ∀f. ↑f = g → 𝐓⦃f⦄.
28 #g #Hg #f #H #i elim (Hg (⫯i)) -Hg
29 #j #Hg elim (at_inv_npx … Hg … H) -Hg -H /2 width=3 by ex_intro/
32 lemma istot_inv_next: ∀g. 𝐓⦃g⦄ → ∀f. ⫯f = g → 𝐓⦃f⦄.
33 #g #Hg #f #H #i elim (Hg i) -Hg
34 #j #Hg elim (at_inv_xnx … Hg … H) -Hg -H /2 width=2 by ex_intro/
37 (* Properties on tl *********************************************************)
39 lemma istot_tl: ∀f. 𝐓⦃f⦄ → 𝐓⦃⫱f⦄.
40 #f cases (pn_split f) *
41 #g * -f /2 width=3 by istot_inv_next, istot_inv_push/
44 (* Properties on tls ********************************************************)
46 lemma istot_tls: ∀n,f. 𝐓⦃f⦄ → 𝐓⦃⫱*[n]f⦄.
47 #n elim n -n /3 width=1 by istot_tl/
50 (* Main forward lemmas on at ************************************************)
52 corec theorem at_ext: ∀f1,f2. 𝐓⦃f1⦄ → 𝐓⦃f2⦄ →
53 (∀i,i1,i2. @⦃i, f1⦄ ≘ i1 → @⦃i, f2⦄ ≘ i2 → i1 = i2) →
55 #f1 cases (pn_split f1) * #g1 #H1
56 #f2 cases (pn_split f2) * #g2 #H2
58 [ @(eq_push … H1 H2) @at_ext -at_ext /2 width=3 by istot_inv_push/ -Hf1 -Hf2
59 #i #i1 #i2 #Hg1 #Hg2 lapply (Hi (⫯i) (⫯i1) (⫯i2) ??) /2 width=7 by at_push/
60 | cases (Hf2 0) -Hf1 -Hf2 -at_ext
61 #j2 #Hf2 cases (at_increasing_strict … Hf2 … H2) -H2
62 lapply (Hi 0 0 j2 … Hf2) /2 width=2 by at_refl/ -Hi -Hf2 -H1
63 #H2 #H cases (lt_le_false … H) -H //
64 | cases (Hf1 0) -Hf1 -Hf2 -at_ext
65 #j1 #Hf1 cases (at_increasing_strict … Hf1 … H1) -H1
66 lapply (Hi 0 j1 0 Hf1 ?) /2 width=2 by at_refl/ -Hi -Hf1 -H2
67 #H1 #H cases (lt_le_false … H) -H //
68 | @(eq_next … H1 H2) @at_ext -at_ext /2 width=3 by istot_inv_next/ -Hf1 -Hf2
69 #i #i1 #i2 #Hg1 #Hg2 lapply (Hi i (⫯i1) (⫯i2) ??) /2 width=5 by at_next/
73 (* Advanced properties on at ************************************************)
75 lemma at_dec: ∀f,i1,i2. 𝐓⦃f⦄ → Decidable (@⦃i1, f⦄ ≘ i2).
76 #f #i1 #i2 #Hf lapply (Hf i1) -Hf *
77 #j2 #Hf elim (eq_nat_dec i2 j2)
78 [ #H destruct /2 width=1 by or_introl/
79 | /4 width=6 by at_mono, or_intror/
83 lemma is_at_dec_le: ∀f,i2,i. 𝐓⦃f⦄ → (∀i1. i1 + i ≤ i2 → @⦃i1, f⦄ ≘ i2 → ⊥) →
84 Decidable (∃i1. @⦃i1, f⦄ ≘ i2).
85 #f #i2 #i #Hf elim i -i
86 [ #Ht @or_intror * /3 width=3 by at_increasing/
87 | #i #IH #Ht elim (at_dec f (i2-i) i2) /3 width=2 by ex_intro, or_introl/
88 #Hi2 @IH -IH #i1 #H #Hi elim (le_to_or_lt_eq … H) -H /2 width=3 by/
89 #H destruct -Ht /2 width=1 by/
93 lemma is_at_dec: ∀f,i2. 𝐓⦃f⦄ → Decidable (∃i1. @⦃i1, f⦄ ≘ i2).
94 #f #i2 #Hf @(is_at_dec_le ?? (⫯i2)) /2 width=4 by lt_le_false/
97 (* Advanced properties on isid **********************************************)
99 lemma isid_at_total: ∀f. 𝐓⦃f⦄ → (∀i1,i2. @⦃i1, f⦄ ≘ i2 → i1 = i2) → 𝐈⦃f⦄.
100 #f #H1f #H2f @isid_at
101 #i lapply (H1f i) -H1f *
102 #j #Hf >(H2f … Hf) in ⊢ (???%); -H2f //