Step
*
1
of Lemma
r-comp-nc-0
1. I : fset(ℕ)
2. i : ℕ
3. ¬i ∈ I
4. x : names(I+i)
5. x = i ∈ ℤ
⊢ (dM-lift(I;I+i;λx.if (x =z i) then 0 else <x> fi ) <1-i>) = 1 ∈ Point(dM(I))
BY
{ (Assert ⌜λx.if (x =z i) then 0 else <x> fi ∈ I ⟶ I+i⌝⋅ THENM ((RWO "dM-lift-opp" 0 THENA Auto) THEN Reduce 0)) }
1
.....assertion.....
1. I : fset(ℕ)
2. i : ℕ
3. ¬i ∈ I
4. x : names(I+i)
5. x = i ∈ ℤ
⊢ λx.if (x =z i) then 0 else <x> fi ∈ I ⟶ I+i
2
1. I : fset(ℕ)
2. i : ℕ
3. ¬i ∈ I
4. x : names(I+i)
5. x = i ∈ ℤ
6. λx.if (x =z i) then 0 else <x> fi ∈ I ⟶ I+i
⊢ ¬(if (i =z i) then 0 else <i> fi ) = 1 ∈ Point(dM(I))
Latex:
Latex:
1. I : fset(\mBbbN{})
2. i : \mBbbN{}
3. \mneg{}i \mmember{} I
4. x : names(I+i)
5. x = i
\mvdash{} (dM-lift(I;I+i;\mlambda{}x.if (x =\msubz{} i) then 0 else <x> fi ) ə-i>) = 1
By
Latex:
(Assert \mkleeneopen{}\mlambda{}x.if (x =\msubz{} i) then 0 else <x> fi \mmember{} I {}\mrightarrow{} I+i\mkleeneclose{}\mcdot{}
THENM ((RWO "dM-lift-opp" 0 THENA Auto) THEN Reduce 0)
)
Home
Index