Theorem axunnd 10621

Description: A version of the Axiom of Union with no distinct variable conditions. Usage of this theorem is discouraged because it depends on ax-13 2365. (Contributed by NM, 2-Jan-2002.) (New usage is discouraged.)

Assertion

Ref	Expression
axunnd	⊢ ∃𝑥∀𝑦(∃𝑥(𝑦 ∈ 𝑥 ∧ 𝑥 ∈ 𝑧) → 𝑦 ∈ 𝑥)

Proof of Theorem axunnd

Dummy variable 𝑤 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		axunndlem1 10620	. . . 4 ⊢ ∃𝑤∀𝑦(∃𝑤(𝑦 ∈ 𝑤 ∧ 𝑤 ∈ 𝑧) → 𝑦 ∈ 𝑤)
2		nfnae 2427	. . . . . 6 ⊢ Ⅎ𝑥 ¬ ∀𝑥 𝑥 = 𝑦
3		nfnae 2427	. . . . . 6 ⊢ Ⅎ𝑥 ¬ ∀𝑥 𝑥 = 𝑧
4	2, 3	nfan 1894	. . . . 5 ⊢ Ⅎ𝑥(¬ ∀𝑥 𝑥 = 𝑦 ∧ ¬ ∀𝑥 𝑥 = 𝑧)
5		nfnae 2427	. . . . . . 7 ⊢ Ⅎ𝑦 ¬ ∀𝑥 𝑥 = 𝑦
6		nfnae 2427	. . . . . . 7 ⊢ Ⅎ𝑦 ¬ ∀𝑥 𝑥 = 𝑧
7	5, 6	nfan 1894	. . . . . 6 ⊢ Ⅎ𝑦(¬ ∀𝑥 𝑥 = 𝑦 ∧ ¬ ∀𝑥 𝑥 = 𝑧)
8		nfv 1909	. . . . . . . 8 ⊢ Ⅎ𝑤(¬ ∀𝑥 𝑥 = 𝑦 ∧ ¬ ∀𝑥 𝑥 = 𝑧)
9		nfcvf 2921	. . . . . . . . . . 11 ⊢ (¬ ∀𝑥 𝑥 = 𝑦 → Ⅎ𝑥𝑦)
10	9	adantr 479	. . . . . . . . . 10 ⊢ ((¬ ∀𝑥 𝑥 = 𝑦 ∧ ¬ ∀𝑥 𝑥 = 𝑧) → Ⅎ𝑥𝑦)
11		nfcvd 2892	. . . . . . . . . 10 ⊢ ((¬ ∀𝑥 𝑥 = 𝑦 ∧ ¬ ∀𝑥 𝑥 = 𝑧) → Ⅎ𝑥𝑤)
12	10, 11	nfeld 2903	. . . . . . . . 9 ⊢ ((¬ ∀𝑥 𝑥 = 𝑦 ∧ ¬ ∀𝑥 𝑥 = 𝑧) → Ⅎ𝑥 𝑦 ∈ 𝑤)
13		nfcvf 2921	. . . . . . . . . . 11 ⊢ (¬ ∀𝑥 𝑥 = 𝑧 → Ⅎ𝑥𝑧)
14	13	adantl 480	. . . . . . . . . 10 ⊢ ((¬ ∀𝑥 𝑥 = 𝑦 ∧ ¬ ∀𝑥 𝑥 = 𝑧) → Ⅎ𝑥𝑧)
15	11, 14	nfeld 2903	. . . . . . . . 9 ⊢ ((¬ ∀𝑥 𝑥 = 𝑦 ∧ ¬ ∀𝑥 𝑥 = 𝑧) → Ⅎ𝑥 𝑤 ∈ 𝑧)
16	12, 15	nfand 1892	. . . . . . . 8 ⊢ ((¬ ∀𝑥 𝑥 = 𝑦 ∧ ¬ ∀𝑥 𝑥 = 𝑧) → Ⅎ𝑥(𝑦 ∈ 𝑤 ∧ 𝑤 ∈ 𝑧))
17	8, 16	nfexd 2317	. . . . . . 7 ⊢ ((¬ ∀𝑥 𝑥 = 𝑦 ∧ ¬ ∀𝑥 𝑥 = 𝑧) → Ⅎ𝑥∃𝑤(𝑦 ∈ 𝑤 ∧ 𝑤 ∈ 𝑧))
18	17, 12	nfimd 1889	. . . . . 6 ⊢ ((¬ ∀𝑥 𝑥 = 𝑦 ∧ ¬ ∀𝑥 𝑥 = 𝑧) → Ⅎ𝑥(∃𝑤(𝑦 ∈ 𝑤 ∧ 𝑤 ∈ 𝑧) → 𝑦 ∈ 𝑤))
19	7, 18	nfald 2316	. . . . 5 ⊢ ((¬ ∀𝑥 𝑥 = 𝑦 ∧ ¬ ∀𝑥 𝑥 = 𝑧) → Ⅎ𝑥∀𝑦(∃𝑤(𝑦 ∈ 𝑤 ∧ 𝑤 ∈ 𝑧) → 𝑦 ∈ 𝑤))
20		nfcvd 2892	. . . . . . . . 9 ⊢ ((¬ ∀𝑥 𝑥 = 𝑦 ∧ ¬ ∀𝑥 𝑥 = 𝑧) → Ⅎ𝑦𝑤)
21		nfcvf2 2922	. . . . . . . . . 10 ⊢ (¬ ∀𝑥 𝑥 = 𝑦 → Ⅎ𝑦𝑥)
22	21	adantr 479	. . . . . . . . 9 ⊢ ((¬ ∀𝑥 𝑥 = 𝑦 ∧ ¬ ∀𝑥 𝑥 = 𝑧) → Ⅎ𝑦𝑥)
23	20, 22	nfeqd 2902	. . . . . . . 8 ⊢ ((¬ ∀𝑥 𝑥 = 𝑦 ∧ ¬ ∀𝑥 𝑥 = 𝑧) → Ⅎ𝑦 𝑤 = 𝑥)
24	7, 23	nfan1 2188	. . . . . . 7 ⊢ Ⅎ𝑦((¬ ∀𝑥 𝑥 = 𝑦 ∧ ¬ ∀𝑥 𝑥 = 𝑧) ∧ 𝑤 = 𝑥)
25		elequ2 2113	. . . . . . . . . . . 12 ⊢ (𝑤 = 𝑥 → (𝑦 ∈ 𝑤 ↔ 𝑦 ∈ 𝑥))
26		elequ1 2105	. . . . . . . . . . . 12 ⊢ (𝑤 = 𝑥 → (𝑤 ∈ 𝑧 ↔ 𝑥 ∈ 𝑧))
27	25, 26	anbi12d 630	. . . . . . . . . . 11 ⊢ (𝑤 = 𝑥 → ((𝑦 ∈ 𝑤 ∧ 𝑤 ∈ 𝑧) ↔ (𝑦 ∈ 𝑥 ∧ 𝑥 ∈ 𝑧)))
28	27	a1i 11	. . . . . . . . . 10 ⊢ ((¬ ∀𝑥 𝑥 = 𝑦 ∧ ¬ ∀𝑥 𝑥 = 𝑧) → (𝑤 = 𝑥 → ((𝑦 ∈ 𝑤 ∧ 𝑤 ∈ 𝑧) ↔ (𝑦 ∈ 𝑥 ∧ 𝑥 ∈ 𝑧))))
29	4, 16, 28	cbvexd 2401	. . . . . . . . 9 ⊢ ((¬ ∀𝑥 𝑥 = 𝑦 ∧ ¬ ∀𝑥 𝑥 = 𝑧) → (∃𝑤(𝑦 ∈ 𝑤 ∧ 𝑤 ∈ 𝑧) ↔ ∃𝑥(𝑦 ∈ 𝑥 ∧ 𝑥 ∈ 𝑧)))
30	29	adantr 479	. . . . . . . 8 ⊢ (((¬ ∀𝑥 𝑥 = 𝑦 ∧ ¬ ∀𝑥 𝑥 = 𝑧) ∧ 𝑤 = 𝑥) → (∃𝑤(𝑦 ∈ 𝑤 ∧ 𝑤 ∈ 𝑧) ↔ ∃𝑥(𝑦 ∈ 𝑥 ∧ 𝑥 ∈ 𝑧)))
31	25	adantl 480	. . . . . . . 8 ⊢ (((¬ ∀𝑥 𝑥 = 𝑦 ∧ ¬ ∀𝑥 𝑥 = 𝑧) ∧ 𝑤 = 𝑥) → (𝑦 ∈ 𝑤 ↔ 𝑦 ∈ 𝑥))
32	30, 31	imbi12d 343	. . . . . . 7 ⊢ (((¬ ∀𝑥 𝑥 = 𝑦 ∧ ¬ ∀𝑥 𝑥 = 𝑧) ∧ 𝑤 = 𝑥) → ((∃𝑤(𝑦 ∈ 𝑤 ∧ 𝑤 ∈ 𝑧) → 𝑦 ∈ 𝑤) ↔ (∃𝑥(𝑦 ∈ 𝑥 ∧ 𝑥 ∈ 𝑧) → 𝑦 ∈ 𝑥)))
33	24, 32	albid 2210	. . . . . 6 ⊢ (((¬ ∀𝑥 𝑥 = 𝑦 ∧ ¬ ∀𝑥 𝑥 = 𝑧) ∧ 𝑤 = 𝑥) → (∀𝑦(∃𝑤(𝑦 ∈ 𝑤 ∧ 𝑤 ∈ 𝑧) → 𝑦 ∈ 𝑤) ↔ ∀𝑦(∃𝑥(𝑦 ∈ 𝑥 ∧ 𝑥 ∈ 𝑧) → 𝑦 ∈ 𝑥)))
34	33	ex 411	. . . . 5 ⊢ ((¬ ∀𝑥 𝑥 = 𝑦 ∧ ¬ ∀𝑥 𝑥 = 𝑧) → (𝑤 = 𝑥 → (∀𝑦(∃𝑤(𝑦 ∈ 𝑤 ∧ 𝑤 ∈ 𝑧) → 𝑦 ∈ 𝑤) ↔ ∀𝑦(∃𝑥(𝑦 ∈ 𝑥 ∧ 𝑥 ∈ 𝑧) → 𝑦 ∈ 𝑥))))
35	4, 19, 34	cbvexd 2401	. . . 4 ⊢ ((¬ ∀𝑥 𝑥 = 𝑦 ∧ ¬ ∀𝑥 𝑥 = 𝑧) → (∃𝑤∀𝑦(∃𝑤(𝑦 ∈ 𝑤 ∧ 𝑤 ∈ 𝑧) → 𝑦 ∈ 𝑤) ↔ ∃𝑥∀𝑦(∃𝑥(𝑦 ∈ 𝑥 ∧ 𝑥 ∈ 𝑧) → 𝑦 ∈ 𝑥)))
36	1, 35	mpbii 232	. . 3 ⊢ ((¬ ∀𝑥 𝑥 = 𝑦 ∧ ¬ ∀𝑥 𝑥 = 𝑧) → ∃𝑥∀𝑦(∃𝑥(𝑦 ∈ 𝑥 ∧ 𝑥 ∈ 𝑧) → 𝑦 ∈ 𝑥))
37	36	ex 411	. 2 ⊢ (¬ ∀𝑥 𝑥 = 𝑦 → (¬ ∀𝑥 𝑥 = 𝑧 → ∃𝑥∀𝑦(∃𝑥(𝑦 ∈ 𝑥 ∧ 𝑥 ∈ 𝑧) → 𝑦 ∈ 𝑥)))
38		nfae 2426	. . . 4 ⊢ Ⅎ𝑦∀𝑥 𝑥 = 𝑦
39		nfae 2426	. . . . . 6 ⊢ Ⅎ𝑥∀𝑥 𝑥 = 𝑦
40		elirrv 9621	. . . . . . . . 9 ⊢ ¬ 𝑦 ∈ 𝑦
41		elequ2 2113	. . . . . . . . 9 ⊢ (𝑥 = 𝑦 → (𝑦 ∈ 𝑥 ↔ 𝑦 ∈ 𝑦))
42	40, 41	mtbiri 326	. . . . . . . 8 ⊢ (𝑥 = 𝑦 → ¬ 𝑦 ∈ 𝑥)
43	42	intnanrd 488	. . . . . . 7 ⊢ (𝑥 = 𝑦 → ¬ (𝑦 ∈ 𝑥 ∧ 𝑥 ∈ 𝑧))
44	43	sps 2173	. . . . . 6 ⊢ (∀𝑥 𝑥 = 𝑦 → ¬ (𝑦 ∈ 𝑥 ∧ 𝑥 ∈ 𝑧))
45	39, 44	nexd 2209	. . . . 5 ⊢ (∀𝑥 𝑥 = 𝑦 → ¬ ∃𝑥(𝑦 ∈ 𝑥 ∧ 𝑥 ∈ 𝑧))
46	45	pm2.21d 121	. . . 4 ⊢ (∀𝑥 𝑥 = 𝑦 → (∃𝑥(𝑦 ∈ 𝑥 ∧ 𝑥 ∈ 𝑧) → 𝑦 ∈ 𝑥))
47	38, 46	alrimi 2201	. . 3 ⊢ (∀𝑥 𝑥 = 𝑦 → ∀𝑦(∃𝑥(𝑦 ∈ 𝑥 ∧ 𝑥 ∈ 𝑧) → 𝑦 ∈ 𝑥))
48	47	19.8ad 2170	. 2 ⊢ (∀𝑥 𝑥 = 𝑦 → ∃𝑥∀𝑦(∃𝑥(𝑦 ∈ 𝑥 ∧ 𝑥 ∈ 𝑧) → 𝑦 ∈ 𝑥))
49		nfae 2426	. . . 4 ⊢ Ⅎ𝑦∀𝑥 𝑥 = 𝑧
50		nfae 2426	. . . . . 6 ⊢ Ⅎ𝑥∀𝑥 𝑥 = 𝑧
51		elirrv 9621	. . . . . . . . 9 ⊢ ¬ 𝑧 ∈ 𝑧
52		elequ1 2105	. . . . . . . . 9 ⊢ (𝑥 = 𝑧 → (𝑥 ∈ 𝑧 ↔ 𝑧 ∈ 𝑧))
53	51, 52	mtbiri 326	. . . . . . . 8 ⊢ (𝑥 = 𝑧 → ¬ 𝑥 ∈ 𝑧)
54	53	intnand 487	. . . . . . 7 ⊢ (𝑥 = 𝑧 → ¬ (𝑦 ∈ 𝑥 ∧ 𝑥 ∈ 𝑧))
55	54	sps 2173	. . . . . 6 ⊢ (∀𝑥 𝑥 = 𝑧 → ¬ (𝑦 ∈ 𝑥 ∧ 𝑥 ∈ 𝑧))
56	50, 55	nexd 2209	. . . . 5 ⊢ (∀𝑥 𝑥 = 𝑧 → ¬ ∃𝑥(𝑦 ∈ 𝑥 ∧ 𝑥 ∈ 𝑧))
57	56	pm2.21d 121	. . . 4 ⊢ (∀𝑥 𝑥 = 𝑧 → (∃𝑥(𝑦 ∈ 𝑥 ∧ 𝑥 ∈ 𝑧) → 𝑦 ∈ 𝑥))
58	49, 57	alrimi 2201	. . 3 ⊢ (∀𝑥 𝑥 = 𝑧 → ∀𝑦(∃𝑥(𝑦 ∈ 𝑥 ∧ 𝑥 ∈ 𝑧) → 𝑦 ∈ 𝑥))
59	58	19.8ad 2170	. 2 ⊢ (∀𝑥 𝑥 = 𝑧 → ∃𝑥∀𝑦(∃𝑥(𝑦 ∈ 𝑥 ∧ 𝑥 ∈ 𝑧) → 𝑦 ∈ 𝑥))
60	37, 48, 59	pm2.61ii 183	1 ⊢ ∃𝑥∀𝑦(∃𝑥(𝑦 ∈ 𝑥 ∧ 𝑥 ∈ 𝑧) → 𝑦 ∈ 𝑥)

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 205   ∧ wa 394  ∀wal 1531  ∃wex 1773  Ⅎwnfc 2875

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1789  ax-4 1803  ax-5 1905  ax-6 1963  ax-7 2003  ax-8 2100  ax-9 2108  ax-10 2129  ax-11 2146  ax-12 2166  ax-13 2365  ax-ext 2696  ax-sep 5300  ax-nul 5307  ax-pr 5429  ax-un 7741  ax-reg 9617

This theorem depends on definitions:  df-bi 206  df-an 395  df-or 846  df-3an 1086  df-tru 1536  df-fal 1546  df-ex 1774  df-nf 1778  df-sb 2060  df-clab 2703  df-cleq 2717  df-clel 2802  df-nfc 2877  df-ne 2930  df-ral 3051  df-rex 3060  df-rab 3419  df-v 3463  df-dif 3947  df-un 3949  df-in 3951  df-ss 3961  df-nul 4323  df-if 4531  df-pw 4606  df-sn 4631  df-pr 4633  df-op 4637  df-br 5150  df-opab 5212  df-eprel 5582  df-fr 5633

This theorem is referenced by:  zfcndun  10640  axunprim  35428