Theorem nd1 10676

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

Assertion

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

Proof of Theorem nd1

Step	Hyp	Ref	Expression
1		elirrv 9595	. . 3 ⊢ ¬ 𝑧 ∈ 𝑧
2		stdpc4 2104	. . . 4 ⊢ (∀𝑦 𝑦 ∈ 𝑧 → [𝑧 / 𝑦]𝑦 ∈ 𝑧)
3	1	nfnth 1834	. . . . 5 ⊢ Ⅎ𝑦 𝑧 ∈ 𝑧
4		elequ1 2151	. . . . 5 ⊢ (𝑦 = 𝑧 → (𝑦 ∈ 𝑧 ↔ 𝑧 ∈ 𝑧))
5	3, 4	sbie 2531	. . . 4 ⊢ ([𝑧 / 𝑦]𝑦 ∈ 𝑧 ↔ 𝑧 ∈ 𝑧)
6	2, 5	sylib 221	. . 3 ⊢ (∀𝑦 𝑦 ∈ 𝑧 → 𝑧 ∈ 𝑧)
7	1, 6	mto 200	. 2 ⊢ ¬ ∀𝑦 𝑦 ∈ 𝑧
8		axc11 2459	. 2 ⊢ (∀𝑥 𝑥 = 𝑦 → (∀𝑥 𝑦 ∈ 𝑧 → ∀𝑦 𝑦 ∈ 𝑧))
9	7, 8	mtoi 202	1 ⊢ (∀𝑥 𝑥 = 𝑦 → ¬ ∀𝑥 𝑦 ∈ 𝑧)

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

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-12 2212  ax-13 2401  ax-sep 5248  ax-reg 9590

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-ex 1812  df-nf 1816  df-sb 2099

This theorem is used by:  axrepnd  10683  axinfndlem1  10694  axinfnd  10695  axacndlem1  10696  axacndlem2  10697