Theorem bj-axc14nf 35039

Description: Proof of a version of axc14 2463 using the "nonfree" 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		bj-nfeel2 35038	. 2 ⊢ (¬ ∀𝑧 𝑧 = 𝑥 → Ⅎ𝑧 𝑥 ∈ 𝑡)
2		elequ2 2121	. 2 ⊢ (𝑡 = 𝑦 → (𝑥 ∈ 𝑡 ↔ 𝑥 ∈ 𝑦))
3	1, 2	bj-dvelimdv1 35036	1 ⊢ (¬ ∀𝑧 𝑧 = 𝑥 → (¬ ∀𝑧 𝑧 = 𝑦 → Ⅎ𝑧 𝑥 ∈ 𝑦))

Syntax hints:  ¬ wn 3   → wi 4  ∀wal 1537  Ⅎwnf 1786

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-13 2372

This theorem depends on definitions:  df-bi 206  df-an 397  df-or 845  df-tru 1542  df-ex 1783  df-nf 1787

This theorem is referenced by:  bj-axc14  35040