Theorem bj-axc14nf 37547

Description: Proof of a version of axc14 2497 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 37546	. 2 ⊢ (¬ ∀𝑧 𝑧 = 𝑥 → Ⅎ𝑧 𝑥 ∈ 𝑡)
2		elequ2 2161	. 2 ⊢ (𝑡 = 𝑦 → (𝑥 ∈ 𝑡 ↔ 𝑥 ∈ 𝑦))
3	1, 2	bj-dvelimdv1 37544	1 ⊢ (¬ ∀𝑧 𝑧 = 𝑥 → (¬ ∀𝑧 𝑧 = 𝑦 → Ⅎ𝑧 𝑥 ∈ 𝑦))

This proof depends on syntax axioms:  ¬ wn 3   → wi 4  ∀wal 1568  Ⅎwnf 1816

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-13 2406

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-tru 1573  df-ex 1813  df-nf 1817

This theorem is used by:  bj-axc14  37548