Theorem axc9 2377

Description: Derive set.mm's original ax-c9 38357 from the shorter ax-13 2367. Usage is discouraged to avoid uninformed ax-13 2367 propagation. (Contributed by NM, 29-Nov-2015.) (Revised by NM, 24-Dec-2015.) (Proof shortened by Wolf Lammen, 29-Apr-2018.) (New usage is discouraged.)

Assertion

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

Proof of Theorem axc9

Step	Hyp	Ref	Expression
1		nfeqf 2376	. . 3 ⊢ ((¬ ∀𝑧 𝑧 = 𝑥 ∧ ¬ ∀𝑧 𝑧 = 𝑦) → Ⅎ𝑧 𝑥 = 𝑦)
2	1	nf5rd 2185	. 2 ⊢ ((¬ ∀𝑧 𝑧 = 𝑥 ∧ ¬ ∀𝑧 𝑧 = 𝑦) → (𝑥 = 𝑦 → ∀𝑧 𝑥 = 𝑦))
3	2	ex 412	1 ⊢ (¬ ∀𝑧 𝑧 = 𝑥 → (¬ ∀𝑧 𝑧 = 𝑦 → (𝑥 = 𝑦 → ∀𝑧 𝑥 = 𝑦)))

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 395  ∀wal 1532

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1790  ax-4 1804  ax-5 1906  ax-6 1964  ax-7 2004  ax-10 2130  ax-12 2167  ax-13 2367

This theorem depends on definitions:  df-bi 206  df-an 396  df-or 847  df-tru 1537  df-ex 1775  df-nf 1779

This theorem is referenced by:  ax13ALT  2420  hbae  2426  axi12  2697  axextbdist  35391  bj-ax6elem1  36137  axc11n11r  36155  bj-hbaeb2  36290  wl-aleq  36997  ax12eq  38408  ax12indalem  38412