Theorem axextnd 10657

Description: A version of the Axiom of Extensionality with no distinct variable conditions. Usage of this theorem is discouraged because it depends on ax-13 2402. (Contributed by NM, 14-Aug-2003.) (New usage is discouraged.)

Assertion

Ref	Expression
axextnd	⊢ ∃𝑥((𝑥 ∈ 𝑦 ↔ 𝑥 ∈ 𝑧) → 𝑦 = 𝑧)

Proof of Theorem axextnd

Dummy variable 𝑤 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		nfnae 2464	. . . . . . . 8 ⊢ Ⅎ𝑥 ¬ ∀𝑥 𝑥 = 𝑦
2		nfnae 2464	. . . . . . . 8 ⊢ Ⅎ𝑥 ¬ ∀𝑥 𝑥 = 𝑧
3	1, 2	nfan 1932	. . . . . . 7 ⊢ Ⅎ𝑥(¬ ∀𝑥 𝑥 = 𝑦 ∧ ¬ ∀𝑥 𝑥 = 𝑧)
4		nfcvf 2949	. . . . . . . . . 10 ⊢ (¬ ∀𝑥 𝑥 = 𝑦 → Ⅎ𝑥𝑦)
5	4	adantr 486	. . . . . . . . 9 ⊢ ((¬ ∀𝑥 𝑥 = 𝑦 ∧ ¬ ∀𝑥 𝑥 = 𝑧) → Ⅎ𝑥𝑦)
6	5	nfcrd 2917	. . . . . . . 8 ⊢ ((¬ ∀𝑥 𝑥 = 𝑦 ∧ ¬ ∀𝑥 𝑥 = 𝑧) → Ⅎ𝑥 𝑤 ∈ 𝑦)
7		nfcvf 2949	. . . . . . . . . 10 ⊢ (¬ ∀𝑥 𝑥 = 𝑧 → Ⅎ𝑥𝑧)
8	7	adantl 487	. . . . . . . . 9 ⊢ ((¬ ∀𝑥 𝑥 = 𝑦 ∧ ¬ ∀𝑥 𝑥 = 𝑧) → Ⅎ𝑥𝑧)
9	8	nfcrd 2917	. . . . . . . 8 ⊢ ((¬ ∀𝑥 𝑥 = 𝑦 ∧ ¬ ∀𝑥 𝑥 = 𝑧) → Ⅎ𝑥 𝑤 ∈ 𝑧)
10	6, 9	nfbid 1935	. . . . . . 7 ⊢ ((¬ ∀𝑥 𝑥 = 𝑦 ∧ ¬ ∀𝑥 𝑥 = 𝑧) → Ⅎ𝑥(𝑤 ∈ 𝑦 ↔ 𝑤 ∈ 𝑧))
11		elequ1 2152	. . . . . . . . 9 ⊢ (𝑤 = 𝑥 → (𝑤 ∈ 𝑦 ↔ 𝑥 ∈ 𝑦))
12		elequ1 2152	. . . . . . . . 9 ⊢ (𝑤 = 𝑥 → (𝑤 ∈ 𝑧 ↔ 𝑥 ∈ 𝑧))
13	11, 12	bibi12d 348	. . . . . . . 8 ⊢ (𝑤 = 𝑥 → ((𝑤 ∈ 𝑦 ↔ 𝑤 ∈ 𝑧) ↔ (𝑥 ∈ 𝑦 ↔ 𝑥 ∈ 𝑧)))
14	13	a1i 11	. . . . . . 7 ⊢ ((¬ ∀𝑥 𝑥 = 𝑦 ∧ ¬ ∀𝑥 𝑥 = 𝑧) → (𝑤 = 𝑥 → ((𝑤 ∈ 𝑦 ↔ 𝑤 ∈ 𝑧) ↔ (𝑥 ∈ 𝑦 ↔ 𝑥 ∈ 𝑧))))
15	3, 10, 14	cbvald 2437	. . . . . 6 ⊢ ((¬ ∀𝑥 𝑥 = 𝑦 ∧ ¬ ∀𝑥 𝑥 = 𝑧) → (∀𝑤(𝑤 ∈ 𝑦 ↔ 𝑤 ∈ 𝑧) ↔ ∀𝑥(𝑥 ∈ 𝑦 ↔ 𝑥 ∈ 𝑧)))
16		axextg 2735	. . . . . 6 ⊢ (∀𝑤(𝑤 ∈ 𝑦 ↔ 𝑤 ∈ 𝑧) → 𝑦 = 𝑧)
17	15, 16	biimtrrdi 257	. . . . 5 ⊢ ((¬ ∀𝑥 𝑥 = 𝑦 ∧ ¬ ∀𝑥 𝑥 = 𝑧) → (∀𝑥(𝑥 ∈ 𝑦 ↔ 𝑥 ∈ 𝑧) → 𝑦 = 𝑧))
18		19.8a 2218	. . . . 5 ⊢ (𝑦 = 𝑧 → ∃𝑥 𝑦 = 𝑧)
19	17, 18	syl6 36	. . . 4 ⊢ ((¬ ∀𝑥 𝑥 = 𝑦 ∧ ¬ ∀𝑥 𝑥 = 𝑧) → (∀𝑥(𝑥 ∈ 𝑦 ↔ 𝑥 ∈ 𝑧) → ∃𝑥 𝑦 = 𝑧))
20	19	ex 418	. . 3 ⊢ (¬ ∀𝑥 𝑥 = 𝑦 → (¬ ∀𝑥 𝑥 = 𝑧 → (∀𝑥(𝑥 ∈ 𝑦 ↔ 𝑥 ∈ 𝑧) → ∃𝑥 𝑦 = 𝑧)))
21		ax6e 2413	. . . . 5 ⊢ ∃𝑥 𝑥 = 𝑧
22		ax7 2049	. . . . . 6 ⊢ (𝑥 = 𝑦 → (𝑥 = 𝑧 → 𝑦 = 𝑧))
23	22	aleximi 1865	. . . . 5 ⊢ (∀𝑥 𝑥 = 𝑦 → (∃𝑥 𝑥 = 𝑧 → ∃𝑥 𝑦 = 𝑧))
24	21, 23	mpi 21	. . . 4 ⊢ (∀𝑥 𝑥 = 𝑦 → ∃𝑥 𝑦 = 𝑧)
25	24	a1d 26	. . 3 ⊢ (∀𝑥 𝑥 = 𝑦 → (∀𝑥(𝑥 ∈ 𝑦 ↔ 𝑥 ∈ 𝑧) → ∃𝑥 𝑦 = 𝑧))
26		ax6e 2413	. . . . 5 ⊢ ∃𝑥 𝑥 = 𝑦
27		ax7 2049	. . . . . . 7 ⊢ (𝑥 = 𝑧 → (𝑥 = 𝑦 → 𝑧 = 𝑦))
28		equcomi 2050	. . . . . . 7 ⊢ (𝑧 = 𝑦 → 𝑦 = 𝑧)
29	27, 28	syl6 36	. . . . . 6 ⊢ (𝑥 = 𝑧 → (𝑥 = 𝑦 → 𝑦 = 𝑧))
30	29	aleximi 1865	. . . . 5 ⊢ (∀𝑥 𝑥 = 𝑧 → (∃𝑥 𝑥 = 𝑦 → ∃𝑥 𝑦 = 𝑧))
31	26, 30	mpi 21	. . . 4 ⊢ (∀𝑥 𝑥 = 𝑧 → ∃𝑥 𝑦 = 𝑧)
32	31	a1d 26	. . 3 ⊢ (∀𝑥 𝑥 = 𝑧 → (∀𝑥(𝑥 ∈ 𝑦 ↔ 𝑥 ∈ 𝑧) → ∃𝑥 𝑦 = 𝑧))
33	20, 25, 32	pm2.61ii 185	. 2 ⊢ (∀𝑥(𝑥 ∈ 𝑦 ↔ 𝑥 ∈ 𝑧) → ∃𝑥 𝑦 = 𝑧)
34	33	19.35ri 1912	1 ⊢ ∃𝑥((𝑥 ∈ 𝑦 ↔ 𝑥 ∈ 𝑧) → 𝑦 = 𝑧)

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 401  ∀wal 1568  ∃wex 1812  Ⅎwnfc 2908

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 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-13 2402  ax-ext 2733

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

This theorem is used by:  zfcndext  10679  axextprim  36435  axextdfeq  36529  axextndbi  36536