Theorem nd5 1864

Description: A lemma for proving conditionless ZFC axioms. (Contributed by NM, 8-Jan-2002.)

Assertion

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

Distinct variable group:   𝑥,𝑧

Proof of Theorem nd5

Step	Hyp	Ref	Expression
1		dveeq2 1861	. 2 ⊢ (¬ ∀𝑥 𝑥 = 𝑦 → (𝑧 = 𝑦 → ∀𝑥 𝑧 = 𝑦))
2	1	nalequcoms 1563	1 ⊢ (¬ ∀𝑦 𝑦 = 𝑥 → (𝑧 = 𝑦 → ∀𝑥 𝑧 = 𝑦))

Syntax hints:  ¬ wn 3   → wi 4  ∀wal 1393   = wceq 1395

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 617  ax-in2 618  ax-io 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580

This theorem depends on definitions:  df-bi 117  df-nf 1507  df-sb 1809

This theorem is referenced by: (None)