Theorem nd5 3736

Description: Lemma for proving conditionless ZFC axioms.

Assertion

Ref	Expression
nd5	⊢ (¬ ∀y y = x → (z = y → ∀x z = y))

Distinct variable group(s):   x,z

Proof of Theorem nd5

Step	Hyp	Ref	Expression
1		ddeeq2 1002	. 2 ⊢ (¬ ∀x x = y → (z = y → ∀x z = y))
2	1	eq4ds 823	1 ⊢ (¬ ∀y y = x → (z = y → ∀x z = y))

Syntax hints:  ¬ wn 1   → wi 2  ∀wal 672   = weq 797

This theorem is referenced by:  axrepndlem1 3738  axrepndlem2 3739  axunnd 3742  axpowndlem2 3744  axpowndlem4 3746  axregndlem2 3749  axinfndlem1 3751  axinfnd 3752  axacndlem4 3756  axacndlem5 3757  axacnd 3758

This theorem was proved from axioms:  ax-1 3  ax-2 4  ax-3 5  ax-mp 6  ax-4 673  ax-5 674  ax-6 675  ax-7 676  ax-gen 677  ax-8 798  ax-9 799  ax-10 800  ax-11 801  ax-12 802  ax-17 925

This theorem depends on definitions:  df-bi 128  df-an 198  df-ex 679  df-sb 853

metamath.org