Step
*
1
1
of Lemma
weak-Markov-principle-alt
1. a : ℕ ⟶ ℕ
2. b : ℕ ⟶ ℕ
3. ∀c:ℕ ⟶ ℕ. ((¬(a = c ∈ (ℕ ⟶ ℕ))) ∨ (¬(b = c ∈ (ℕ ⟶ ℕ))))
4. c : ℕ ⟶ ℕ
5. ¬(a = c ∈ (ℕ ⟶ ℕ))
⊢ ∃i:ℕ. (((i = 0 ∈ ℤ)
⇒ (¬(a = c ∈ (ℕ ⟶ ℕ)))) ∧ ((¬(i = 0 ∈ ℤ))
⇒ (¬(b = c ∈ (ℕ ⟶ ℕ)))))
BY
{ (D 0 With ⌜0⌝ THEN Auto) }
Latex:
Latex:
1. a : \mBbbN{} {}\mrightarrow{} \mBbbN{}
2. b : \mBbbN{} {}\mrightarrow{} \mBbbN{}
3. \mforall{}c:\mBbbN{} {}\mrightarrow{} \mBbbN{}. ((\mneg{}(a = c)) \mvee{} (\mneg{}(b = c)))
4. c : \mBbbN{} {}\mrightarrow{} \mBbbN{}
5. \mneg{}(a = c)
\mvdash{} \mexists{}i:\mBbbN{}. (((i = 0) {}\mRightarrow{} (\mneg{}(a = c))) \mwedge{} ((\mneg{}(i = 0)) {}\mRightarrow{} (\mneg{}(b = c))))
By
Latex:
(D 0 With \mkleeneopen{}0\mkleeneclose{} THEN Auto)
Home
Index