Theorem nd2 10703

Description: A lemma for proving conditionless ZFC axioms. Usage of this theorem is discouraged because it depends on ax-13 2404. (Contributed by NM, 1-Jan-2002.) (New usage is discouraged.)

Assertion

Ref	Expression
nd2	⊢ (∀𝑥 𝑥 = 𝑦 → ¬ ∀𝑥 𝑧 ∈ 𝑦)

Proof of Theorem nd2

Step	Hyp	Ref	Expression
1		elirrv 9621	. . 3 ⊢ ¬ 𝑧 ∈ 𝑧
2		stdpc4 2107	. . . 4 ⊢ (∀𝑦 𝑧 ∈ 𝑦 → [𝑧 / 𝑦]𝑧 ∈ 𝑦)
3	1	nfnth 1835	. . . . 5 ⊢ Ⅎ𝑦 𝑧 ∈ 𝑧
4		elequ2 2162	. . . . 5 ⊢ (𝑦 = 𝑧 → (𝑧 ∈ 𝑦 ↔ 𝑧 ∈ 𝑧))
5	3, 4	sbie 2534	. . . 4 ⊢ ([𝑧 / 𝑦]𝑧 ∈ 𝑦 ↔ 𝑧 ∈ 𝑧)
6	2, 5	sylib 221	. . 3 ⊢ (∀𝑦 𝑧 ∈ 𝑦 → 𝑧 ∈ 𝑧)
7	1, 6	mto 200	. 2 ⊢ ¬ ∀𝑦 𝑧 ∈ 𝑦
8		axc11 2462	. 2 ⊢ (∀𝑥 𝑥 = 𝑦 → (∀𝑥 𝑧 ∈ 𝑦 → ∀𝑦 𝑧 ∈ 𝑦))
9	7, 8	mtoi 202	1 ⊢ (∀𝑥 𝑥 = 𝑦 → ¬ ∀𝑥 𝑧 ∈ 𝑦)

This proof depends on syntax axioms:  ¬ wn 3   → wi 4  ∀wal 1568  [wsb 2101

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-12 2216  ax-13 2404  ax-sep 5253  ax-reg 9616

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-ex 1813  df-nf 1817  df-sb 2102

This theorem is used by:  axrepnd  10709  axpownd  10716  axinfndlem1  10720  axacndlem4  10725