Theorem bj-axc14nf 32031

Description: Proof of a version of axc14 2360 using the "non-free" idiom. (Contributed by BJ, 20-Oct-2021.) (Proof modification is discouraged.)

Assertion

Ref	Expression
bj-axc14nf	⊢ (¬ ∀𝑧 𝑧 = 𝑥 → (¬ ∀𝑧 𝑧 = 𝑦 → Ⅎ𝑧 𝑥 ∈ 𝑦))

Proof of Theorem bj-axc14nf

Dummy variable 𝑡 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		nfnae 2306	. . 3 ⊢ Ⅎ𝑧 ¬ ∀𝑧 𝑧 = 𝑥
2		bj-nfeel2 32030	. . 3 ⊢ (¬ ∀𝑧 𝑧 = 𝑥 → Ⅎ𝑧 𝑥 ∈ 𝑡)
3		eleq2 2677	. . 3 ⊢ (𝑡 = 𝑦 → (𝑥 ∈ 𝑡 ↔ 𝑥 ∈ 𝑦))
4	1, 2, 3	bj-dvelimdv 32027	. 2 ⊢ ((¬ ∀𝑧 𝑧 = 𝑥 ∧ ¬ ∀𝑧 𝑧 = 𝑦) → Ⅎ𝑧 𝑥 ∈ 𝑦)
5	4	ex 449	1 ⊢ (¬ ∀𝑧 𝑧 = 𝑥 → (¬ ∀𝑧 𝑧 = 𝑦 → Ⅎ𝑧 𝑥 ∈ 𝑦))

Syntax hints:  ¬ wn 3   → wi 4  ∀wal 1473  Ⅎwnf 1699

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1713  ax-4 1728  ax-5 1827  ax-6 1875  ax-7 1922  ax-10 2006  ax-11 2021  ax-12 2034  ax-13 2234  ax-ext 2590

This theorem depends on definitions:  df-bi 196  df-or 384  df-an 385  df-tru 1478  df-ex 1696  df-nf 1701  df-cleq 2603  df-clel 2606

This theorem is referenced by:  bj-axc14  32032