Step
*
3
of Lemma
setmem-natset
1. n : ℤ
2. [%1] : 0 < n
3. ∀x:Set{i:l}. ((x ∈ natset(n - 1))
⇐⇒ ∃i:ℕn - 1. seteq(x;natset(i)))
4. x : Set{i:l}
5. i : ℕn
6. seteq(x;natset(i))
⊢ (x ∈ natset(n))
BY
{ (Unfold `natset` 0
THEN (RWO "primrec-unroll" 0 THENA Auto)
THEN AutoSplit
THEN Reduce 0
THEN (RWO "setmem-plus-set" 0 THENA Auto)
THEN ExRepD
THEN Fold `natset` 0) }
1
1. n : ℤ
2. ¬n < 1
3. [%1] : 0 < n
4. ∀x:Set{i:l}. ((x ∈ natset(n - 1))
⇐⇒ ∃i:ℕn - 1. seteq(x;natset(i)))
5. x : Set{i:l}
6. i : ℕn
7. seteq(x;natset(i))
⊢ (x ∈ natset(n - 1)) ∨ seteq(x;natset(n - 1))
Latex:
Latex:
1. n : \mBbbZ{}
2. [\%1] : 0 < n
3. \mforall{}x:Set\{i:l\}. ((x \mmember{} natset(n - 1)) \mLeftarrow{}{}\mRightarrow{} \mexists{}i:\mBbbN{}n - 1. seteq(x;natset(i)))
4. x : Set\{i:l\}
5. i : \mBbbN{}n
6. seteq(x;natset(i))
\mvdash{} (x \mmember{} natset(n))
By
Latex:
(Unfold `natset` 0
THEN (RWO "primrec-unroll" 0 THENA Auto)
THEN AutoSplit
THEN Reduce 0
THEN (RWO "setmem-plus-set" 0 THENA Auto)
THEN ExRepD
THEN Fold `natset` 0)
Home
Index