Theorem nd1 10510

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

Assertion

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

Proof of Theorem nd1

Step	Hyp	Ref	Expression
1		elirrv 9514	. . 3 ⊢ ¬ 𝑧 ∈ 𝑧
2		stdpc4 2074	. . . 4 ⊢ (∀𝑦 𝑦 ∈ 𝑧 → [𝑧 / 𝑦]𝑦 ∈ 𝑧)
3	1	nfnth 1804	. . . . 5 ⊢ Ⅎ𝑦 𝑧 ∈ 𝑧
4		elequ1 2121	. . . . 5 ⊢ (𝑦 = 𝑧 → (𝑦 ∈ 𝑧 ↔ 𝑧 ∈ 𝑧))
5	3, 4	sbie 2507	. . . 4 ⊢ ([𝑧 / 𝑦]𝑦 ∈ 𝑧 ↔ 𝑧 ∈ 𝑧)
6	2, 5	sylib 218	. . 3 ⊢ (∀𝑦 𝑦 ∈ 𝑧 → 𝑧 ∈ 𝑧)
7	1, 6	mto 197	. 2 ⊢ ¬ ∀𝑦 𝑦 ∈ 𝑧
8		axc11 2435	. 2 ⊢ (∀𝑥 𝑥 = 𝑦 → (∀𝑥 𝑦 ∈ 𝑧 → ∀𝑦 𝑦 ∈ 𝑧))
9	7, 8	mtoi 199	1 ⊢ (∀𝑥 𝑥 = 𝑦 → ¬ ∀𝑥 𝑦 ∈ 𝑧)

Syntax hints:  ¬ wn 3   → wi 4  ∀wal 1540  [wsb 2068

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-12 2185  ax-13 2377  ax-sep 5243  ax-pr 5379  ax-reg 9509

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-ex 1782  df-nf 1786  df-sb 2069

This theorem is referenced by:  axrepnd  10517  axinfndlem1  10528  axinfnd  10529  axacndlem1  10530  axacndlem2  10531