Theorem axgroth6 10894

Description: The Tarski-Grothendieck axiom using abbreviations. This version is called Tarski's axiom: given a set 𝑥, there exists a set 𝑦 containing 𝑥, the subsets of the members of 𝑦, the power sets of the members of 𝑦, and the subsets of 𝑦 of cardinality less than that of 𝑦. (Contributed by NM, 21-Jun-2009.)

Assertion

Ref	Expression
axgroth6	⊢ ∃𝑦(𝑥 ∈ 𝑦 ∧ ∀𝑧 ∈ 𝑦 (𝒫 𝑧 ⊆ 𝑦 ∧ 𝒫 𝑧 ∈ 𝑦) ∧ ∀𝑧 ∈ 𝒫 𝑦(𝑧 ≺ 𝑦 → 𝑧 ∈ 𝑦))

Distinct variable group:   𝑥,𝑦,𝑧

Proof of Theorem axgroth6

Dummy variables 𝑤 𝑣 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		axgroth5 10890	. 2 ⊢ ∃𝑦(𝑥 ∈ 𝑦 ∧ ∀𝑧 ∈ 𝑦 (𝒫 𝑧 ⊆ 𝑦 ∧ ∃𝑤 ∈ 𝑦 𝒫 𝑧 ⊆ 𝑤) ∧ ∀𝑧 ∈ 𝒫 𝑦(𝑧 ≈ 𝑦 ∨ 𝑧 ∈ 𝑦))
2		biid 264	. . . 4 ⊢ (𝑥 ∈ 𝑦 ↔ 𝑥 ∈ 𝑦)
3		pweq 4571	. . . . . . . . 9 ⊢ (𝑧 = 𝑣 → 𝒫 𝑧 = 𝒫 𝑣)
4	3	sseq1d 3962	. . . . . . . 8 ⊢ (𝑧 = 𝑣 → (𝒫 𝑧 ⊆ 𝑦 ↔ 𝒫 𝑣 ⊆ 𝑦))
5	4	cbvralvw 3241	. . . . . . 7 ⊢ (∀𝑧 ∈ 𝑦 𝒫 𝑧 ⊆ 𝑦 ↔ ∀𝑣 ∈ 𝑦 𝒫 𝑣 ⊆ 𝑦)
6		ssid 3953	. . . . . . . . . 10 ⊢ 𝒫 𝑧 ⊆ 𝒫 𝑧
7		sseq2 3957	. . . . . . . . . . 11 ⊢ (𝑤 = 𝒫 𝑧 → (𝒫 𝑧 ⊆ 𝑤 ↔ 𝒫 𝑧 ⊆ 𝒫 𝑧))
8	7	rspcev 3577	. . . . . . . . . 10 ⊢ ((𝒫 𝑧 ∈ 𝑦 ∧ 𝒫 𝑧 ⊆ 𝒫 𝑧) → ∃𝑤 ∈ 𝑦 𝒫 𝑧 ⊆ 𝑤)
9	6, 8	mpan2 704	. . . . . . . . 9 ⊢ (𝒫 𝑧 ∈ 𝑦 → ∃𝑤 ∈ 𝑦 𝒫 𝑧 ⊆ 𝑤)
10		pweq 4571	. . . . . . . . . . . . 13 ⊢ (𝑣 = 𝑤 → 𝒫 𝑣 = 𝒫 𝑤)
11	10	sseq1d 3962	. . . . . . . . . . . 12 ⊢ (𝑣 = 𝑤 → (𝒫 𝑣 ⊆ 𝑦 ↔ 𝒫 𝑤 ⊆ 𝑦))
12	11	rspccv 3574	. . . . . . . . . . 11 ⊢ (∀𝑣 ∈ 𝑦 𝒫 𝑣 ⊆ 𝑦 → (𝑤 ∈ 𝑦 → 𝒫 𝑤 ⊆ 𝑦))
13		pwss 4581	. . . . . . . . . . . 12 ⊢ (𝒫 𝑤 ⊆ 𝑦 ↔ ∀𝑣(𝑣 ⊆ 𝑤 → 𝑣 ∈ 𝑦))
14		vpwex 5339	. . . . . . . . . . . . 13 ⊢ 𝒫 𝑧 ∈ V
15		sseq1 3956	. . . . . . . . . . . . . 14 ⊢ (𝑣 = 𝒫 𝑧 → (𝑣 ⊆ 𝑤 ↔ 𝒫 𝑧 ⊆ 𝑤))
16		eleq1 2849	. . . . . . . . . . . . . 14 ⊢ (𝑣 = 𝒫 𝑧 → (𝑣 ∈ 𝑦 ↔ 𝒫 𝑧 ∈ 𝑦))
17	15, 16	imbi12d 347	. . . . . . . . . . . . 13 ⊢ (𝑣 = 𝒫 𝑧 → ((𝑣 ⊆ 𝑤 → 𝑣 ∈ 𝑦) ↔ (𝒫 𝑧 ⊆ 𝑤 → 𝒫 𝑧 ∈ 𝑦)))
18	14, 17	spcv 3560	. . . . . . . . . . . 12 ⊢ (∀𝑣(𝑣 ⊆ 𝑤 → 𝑣 ∈ 𝑦) → (𝒫 𝑧 ⊆ 𝑤 → 𝒫 𝑧 ∈ 𝑦))
19	13, 18	sylbi 220	. . . . . . . . . . 11 ⊢ (𝒫 𝑤 ⊆ 𝑦 → (𝒫 𝑧 ⊆ 𝑤 → 𝒫 𝑧 ∈ 𝑦))
20	12, 19	syl6 36	. . . . . . . . . 10 ⊢ (∀𝑣 ∈ 𝑦 𝒫 𝑣 ⊆ 𝑦 → (𝑤 ∈ 𝑦 → (𝒫 𝑧 ⊆ 𝑤 → 𝒫 𝑧 ∈ 𝑦)))
21	20	rexlimdv 3162	. . . . . . . . 9 ⊢ (∀𝑣 ∈ 𝑦 𝒫 𝑣 ⊆ 𝑦 → (∃𝑤 ∈ 𝑦 𝒫 𝑧 ⊆ 𝑤 → 𝒫 𝑧 ∈ 𝑦))
22	9, 21	impbid2 229	. . . . . . . 8 ⊢ (∀𝑣 ∈ 𝑦 𝒫 𝑣 ⊆ 𝑦 → (𝒫 𝑧 ∈ 𝑦 ↔ ∃𝑤 ∈ 𝑦 𝒫 𝑧 ⊆ 𝑤))
23	22	ralbidv 3186	. . . . . . 7 ⊢ (∀𝑣 ∈ 𝑦 𝒫 𝑣 ⊆ 𝑦 → (∀𝑧 ∈ 𝑦 𝒫 𝑧 ∈ 𝑦 ↔ ∀𝑧 ∈ 𝑦 ∃𝑤 ∈ 𝑦 𝒫 𝑧 ⊆ 𝑤))
24	5, 23	sylbi 220	. . . . . 6 ⊢ (∀𝑧 ∈ 𝑦 𝒫 𝑧 ⊆ 𝑦 → (∀𝑧 ∈ 𝑦 𝒫 𝑧 ∈ 𝑦 ↔ ∀𝑧 ∈ 𝑦 ∃𝑤 ∈ 𝑦 𝒫 𝑧 ⊆ 𝑤))
25	24	pm5.32i 585	. . . . 5 ⊢ ((∀𝑧 ∈ 𝑦 𝒫 𝑧 ⊆ 𝑦 ∧ ∀𝑧 ∈ 𝑦 𝒫 𝑧 ∈ 𝑦) ↔ (∀𝑧 ∈ 𝑦 𝒫 𝑧 ⊆ 𝑦 ∧ ∀𝑧 ∈ 𝑦 ∃𝑤 ∈ 𝑦 𝒫 𝑧 ⊆ 𝑤))
26		r19.26 3123	. . . . 5 ⊢ (∀𝑧 ∈ 𝑦 (𝒫 𝑧 ⊆ 𝑦 ∧ 𝒫 𝑧 ∈ 𝑦) ↔ (∀𝑧 ∈ 𝑦 𝒫 𝑧 ⊆ 𝑦 ∧ ∀𝑧 ∈ 𝑦 𝒫 𝑧 ∈ 𝑦))
27		r19.26 3123	. . . . 5 ⊢ (∀𝑧 ∈ 𝑦 (𝒫 𝑧 ⊆ 𝑦 ∧ ∃𝑤 ∈ 𝑦 𝒫 𝑧 ⊆ 𝑤) ↔ (∀𝑧 ∈ 𝑦 𝒫 𝑧 ⊆ 𝑦 ∧ ∀𝑧 ∈ 𝑦 ∃𝑤 ∈ 𝑦 𝒫 𝑧 ⊆ 𝑤))
28	25, 26, 27	3bitr4i 306	. . . 4 ⊢ (∀𝑧 ∈ 𝑦 (𝒫 𝑧 ⊆ 𝑦 ∧ 𝒫 𝑧 ∈ 𝑦) ↔ ∀𝑧 ∈ 𝑦 (𝒫 𝑧 ⊆ 𝑦 ∧ ∃𝑤 ∈ 𝑦 𝒫 𝑧 ⊆ 𝑤))
29		velpw 4562	. . . . . 6 ⊢ (𝑧 ∈ 𝒫 𝑦 ↔ 𝑧 ⊆ 𝑦)
30		impexp 456	. . . . . . . . 9 ⊢ (((𝑧 ⊆ 𝑦 ∧ 𝑧 ≼ 𝑦) → (¬ 𝑧 ≈ 𝑦 → 𝑧 ∈ 𝑦)) ↔ (𝑧 ⊆ 𝑦 → (𝑧 ≼ 𝑦 → (¬ 𝑧 ≈ 𝑦 → 𝑧 ∈ 𝑦))))
31		ssdomg 9011	. . . . . . . . . . . 12 ⊢ (𝑦 ∈ V → (𝑧 ⊆ 𝑦 → 𝑧 ≼ 𝑦))
32	31	elv 3456	. . . . . . . . . . 11 ⊢ (𝑧 ⊆ 𝑦 → 𝑧 ≼ 𝑦)
33	32	pm4.71i 569	. . . . . . . . . 10 ⊢ (𝑧 ⊆ 𝑦 ↔ (𝑧 ⊆ 𝑦 ∧ 𝑧 ≼ 𝑦))
34	33	imbi1i 352	. . . . . . . . 9 ⊢ ((𝑧 ⊆ 𝑦 → (¬ 𝑧 ≈ 𝑦 → 𝑧 ∈ 𝑦)) ↔ ((𝑧 ⊆ 𝑦 ∧ 𝑧 ≼ 𝑦) → (¬ 𝑧 ≈ 𝑦 → 𝑧 ∈ 𝑦)))
35		brsdom 8985	. . . . . . . . . . . 12 ⊢ (𝑧 ≺ 𝑦 ↔ (𝑧 ≼ 𝑦 ∧ ¬ 𝑧 ≈ 𝑦))
36	35	imbi1i 352	. . . . . . . . . . 11 ⊢ ((𝑧 ≺ 𝑦 → 𝑧 ∈ 𝑦) ↔ ((𝑧 ≼ 𝑦 ∧ ¬ 𝑧 ≈ 𝑦) → 𝑧 ∈ 𝑦))
37		impexp 456	. . . . . . . . . . 11 ⊢ (((𝑧 ≼ 𝑦 ∧ ¬ 𝑧 ≈ 𝑦) → 𝑧 ∈ 𝑦) ↔ (𝑧 ≼ 𝑦 → (¬ 𝑧 ≈ 𝑦 → 𝑧 ∈ 𝑦)))
38	36, 37	bitri 278	. . . . . . . . . 10 ⊢ ((𝑧 ≺ 𝑦 → 𝑧 ∈ 𝑦) ↔ (𝑧 ≼ 𝑦 → (¬ 𝑧 ≈ 𝑦 → 𝑧 ∈ 𝑦)))
39	38	imbi2i 339	. . . . . . . . 9 ⊢ ((𝑧 ⊆ 𝑦 → (𝑧 ≺ 𝑦 → 𝑧 ∈ 𝑦)) ↔ (𝑧 ⊆ 𝑦 → (𝑧 ≼ 𝑦 → (¬ 𝑧 ≈ 𝑦 → 𝑧 ∈ 𝑦))))
40	30, 34, 39	3bitr4ri 307	. . . . . . . 8 ⊢ ((𝑧 ⊆ 𝑦 → (𝑧 ≺ 𝑦 → 𝑧 ∈ 𝑦)) ↔ (𝑧 ⊆ 𝑦 → (¬ 𝑧 ≈ 𝑦 → 𝑧 ∈ 𝑦)))
41	40	pm5.74ri 275	. . . . . . 7 ⊢ (𝑧 ⊆ 𝑦 → ((𝑧 ≺ 𝑦 → 𝑧 ∈ 𝑦) ↔ (¬ 𝑧 ≈ 𝑦 → 𝑧 ∈ 𝑦)))
42		pm4.64 863	. . . . . . 7 ⊢ ((¬ 𝑧 ≈ 𝑦 → 𝑧 ∈ 𝑦) ↔ (𝑧 ≈ 𝑦 ∨ 𝑧 ∈ 𝑦))
43	41, 42	bitrdi 290	. . . . . 6 ⊢ (𝑧 ⊆ 𝑦 → ((𝑧 ≺ 𝑦 → 𝑧 ∈ 𝑦) ↔ (𝑧 ≈ 𝑦 ∨ 𝑧 ∈ 𝑦)))
44	29, 43	sylbi 220	. . . . 5 ⊢ (𝑧 ∈ 𝒫 𝑦 → ((𝑧 ≺ 𝑦 → 𝑧 ∈ 𝑦) ↔ (𝑧 ≈ 𝑦 ∨ 𝑧 ∈ 𝑦)))
45	44	ralbiia 3107	. . . 4 ⊢ (∀𝑧 ∈ 𝒫 𝑦(𝑧 ≺ 𝑦 → 𝑧 ∈ 𝑦) ↔ ∀𝑧 ∈ 𝒫 𝑦(𝑧 ≈ 𝑦 ∨ 𝑧 ∈ 𝑦))
46	2, 28, 45	3anbi123i 1173	. . 3 ⊢ ((𝑥 ∈ 𝑦 ∧ ∀𝑧 ∈ 𝑦 (𝒫 𝑧 ⊆ 𝑦 ∧ 𝒫 𝑧 ∈ 𝑦) ∧ ∀𝑧 ∈ 𝒫 𝑦(𝑧 ≺ 𝑦 → 𝑧 ∈ 𝑦)) ↔ (𝑥 ∈ 𝑦 ∧ ∀𝑧 ∈ 𝑦 (𝒫 𝑧 ⊆ 𝑦 ∧ ∃𝑤 ∈ 𝑦 𝒫 𝑧 ⊆ 𝑤) ∧ ∀𝑧 ∈ 𝒫 𝑦(𝑧 ≈ 𝑦 ∨ 𝑧 ∈ 𝑦)))
47	46	exbii 1881	. 2 ⊢ (∃𝑦(𝑥 ∈ 𝑦 ∧ ∀𝑧 ∈ 𝑦 (𝒫 𝑧 ⊆ 𝑦 ∧ 𝒫 𝑧 ∈ 𝑦) ∧ ∀𝑧 ∈ 𝒫 𝑦(𝑧 ≺ 𝑦 → 𝑧 ∈ 𝑦)) ↔ ∃𝑦(𝑥 ∈ 𝑦 ∧ ∀𝑧 ∈ 𝑦 (𝒫 𝑧 ⊆ 𝑦 ∧ ∃𝑤 ∈ 𝑦 𝒫 𝑧 ⊆ 𝑤) ∧ ∀𝑧 ∈ 𝒫 𝑦(𝑧 ≈ 𝑦 ∨ 𝑧 ∈ 𝑦)))
48	1, 47	mpbir 234	1 ⊢ ∃𝑦(𝑥 ∈ 𝑦 ∧ ∀𝑧 ∈ 𝑦 (𝒫 𝑧 ⊆ 𝑦 ∧ 𝒫 𝑧 ∈ 𝑦) ∧ ∀𝑧 ∈ 𝒫 𝑦(𝑧 ≺ 𝑦 → 𝑧 ∈ 𝑦))

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 401   ∨ wo 861   ∧ w3a 1103  ∀wal 1568   = wceq 1570  ∃wex 1812   ∈ wcel 2145  ∀wral 3077  ∃wrex 3087  Vcvv 3451   ⊆ wss 3899  𝒫 cpw 4557   class class class wbr 5103   ≈ cen 8954   ≼ cdom 8955   ≺ csdm 8956

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-ext 2733  ax-sep 5249  ax-pow 5327  ax-pr 5391  ax-un 7740  ax-groth 10889

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2100  df-clab 2740  df-cleq 2753  df-clel 2836  df-ral 3078  df-rex 3088  df-rab 3414  df-v 3453  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-br 5104  df-opab 5168  df-id 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-fun 6533  df-fn 6534  df-f 6535  df-f1 6536  df-fo 6537  df-f1o 6538  df-dom 8959  df-sdom 8960

This theorem is used by:  grothomex  10895  grothac  10896