Theorem axgroth6 10940

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 10936	. 2 ⊢ ∃𝑦(𝑥 ∈ 𝑦 ∧ ∀𝑧 ∈ 𝑦 (𝒫 𝑧 ⊆ 𝑦 ∧ ∃𝑤 ∈ 𝑦 𝒫 𝑧 ⊆ 𝑤) ∧ ∀𝑧 ∈ 𝒫 𝑦(𝑧 ≈ 𝑦 ∨ 𝑧 ∈ 𝑦))
2		biid 264	. . . 4 ⊢ (𝑥 ∈ 𝑦 ↔ 𝑥 ∈ 𝑦)
3		pweq 4574	. . . . . . . . 9 ⊢ (𝑧 = 𝑣 → 𝒫 𝑧 = 𝒫 𝑣)
4	3	sseq1d 3944	. . . . . . . 8 ⊢ (𝑧 = 𝑣 → (𝒫 𝑧 ⊆ 𝑦 ↔ 𝒫 𝑣 ⊆ 𝑦))
5	4	cbvralvw 3244	. . . . . . 7 ⊢ (∀𝑧 ∈ 𝑦 𝒫 𝑧 ⊆ 𝑦 ↔ ∀𝑣 ∈ 𝑦 𝒫 𝑣 ⊆ 𝑦)
6		ssid 3935	. . . . . . . . . 10 ⊢ 𝒫 𝑧 ⊆ 𝒫 𝑧
7		sseq2 3939	. . . . . . . . . . 11 ⊢ (𝑤 = 𝒫 𝑧 → (𝒫 𝑧 ⊆ 𝑤 ↔ 𝒫 𝑧 ⊆ 𝒫 𝑧))
8	7	rspcev 3580	. . . . . . . . . 10 ⊢ ((𝒫 𝑧 ∈ 𝑦 ∧ 𝒫 𝑧 ⊆ 𝒫 𝑧) → ∃𝑤 ∈ 𝑦 𝒫 𝑧 ⊆ 𝑤)
9	6, 8	mpan2 704	. . . . . . . . 9 ⊢ (𝒫 𝑧 ∈ 𝑦 → ∃𝑤 ∈ 𝑦 𝒫 𝑧 ⊆ 𝑤)
10		pweq 4574	. . . . . . . . . . . . 13 ⊢ (𝑣 = 𝑤 → 𝒫 𝑣 = 𝒫 𝑤)
11	10	sseq1d 3944	. . . . . . . . . . . 12 ⊢ (𝑣 = 𝑤 → (𝒫 𝑣 ⊆ 𝑦 ↔ 𝒫 𝑤 ⊆ 𝑦))
12	11	rspccv 3577	. . . . . . . . . . 11 ⊢ (∀𝑣 ∈ 𝑦 𝒫 𝑣 ⊆ 𝑦 → (𝑤 ∈ 𝑦 → 𝒫 𝑤 ⊆ 𝑦))
13		pwss 4585	. . . . . . . . . . . 12 ⊢ (𝒫 𝑤 ⊆ 𝑦 ↔ ∀𝑣(𝑣 ⊆ 𝑤 → 𝑣 ∈ 𝑦))
14		vpwex 5343	. . . . . . . . . . . . 13 ⊢ 𝒫 𝑧 ∈ V
15		sseq1 3938	. . . . . . . . . . . . . 14 ⊢ (𝑣 = 𝒫 𝑧 → (𝑣 ⊆ 𝑤 ↔ 𝒫 𝑧 ⊆ 𝑤))
16		eleq1 2852	. . . . . . . . . . . . . 14 ⊢ (𝑣 = 𝒫 𝑧 → (𝑣 ∈ 𝑦 ↔ 𝒫 𝑧 ∈ 𝑦))
17	15, 16	imbi12d 347	. . . . . . . . . . . . 13 ⊢ (𝑣 = 𝒫 𝑧 → ((𝑣 ⊆ 𝑤 → 𝑣 ∈ 𝑦) ↔ (𝒫 𝑧 ⊆ 𝑤 → 𝒫 𝑧 ∈ 𝑦)))
18	14, 17	spcv 3563	. . . . . . . . . . . 12 ⊢ (∀𝑣(𝑣 ⊆ 𝑤 → 𝑣 ∈ 𝑦) → (𝒫 𝑧 ⊆ 𝑤 → 𝒫 𝑧 ∈ 𝑦))
19	13, 18	sylbi 220	. . . . . . . . . . 11 ⊢ (𝒫 𝑤 ⊆ 𝑦 → (𝒫 𝑧 ⊆ 𝑤 → 𝒫 𝑧 ∈ 𝑦))
20	12, 19	syl6 36	. . . . . . . . . 10 ⊢ (∀𝑣 ∈ 𝑦 𝒫 𝑣 ⊆ 𝑦 → (𝑤 ∈ 𝑦 → (𝒫 𝑧 ⊆ 𝑤 → 𝒫 𝑧 ∈ 𝑦)))
21	20	rexlimdv 3165	. . . . . . . . 9 ⊢ (∀𝑣 ∈ 𝑦 𝒫 𝑣 ⊆ 𝑦 → (∃𝑤 ∈ 𝑦 𝒫 𝑧 ⊆ 𝑤 → 𝒫 𝑧 ∈ 𝑦))
22	9, 21	impbid2 229	. . . . . . . 8 ⊢ (∀𝑣 ∈ 𝑦 𝒫 𝑣 ⊆ 𝑦 → (𝒫 𝑧 ∈ 𝑦 ↔ ∃𝑤 ∈ 𝑦 𝒫 𝑧 ⊆ 𝑤))
23	22	ralbidv 3189	. . . . . . 7 ⊢ (∀𝑣 ∈ 𝑦 𝒫 𝑣 ⊆ 𝑦 → (∀𝑧 ∈ 𝑦 𝒫 𝑧 ∈ 𝑦 ↔ ∀𝑧 ∈ 𝑦 ∃𝑤 ∈ 𝑦 𝒫 𝑧 ⊆ 𝑤))
24	5, 23	sylbi 220	. . . . . 6 ⊢ (∀𝑧 ∈ 𝑦 𝒫 𝑧 ⊆ 𝑦 → (∀𝑧 ∈ 𝑦 𝒫 𝑧 ∈ 𝑦 ↔ ∀𝑧 ∈ 𝑦 ∃𝑤 ∈ 𝑦 𝒫 𝑧 ⊆ 𝑤))
25	24	pm5.32i 585	. . . . 5 ⊢ ((∀𝑧 ∈ 𝑦 𝒫 𝑧 ⊆ 𝑦 ∧ ∀𝑧 ∈ 𝑦 𝒫 𝑧 ∈ 𝑦) ↔ (∀𝑧 ∈ 𝑦 𝒫 𝑧 ⊆ 𝑦 ∧ ∀𝑧 ∈ 𝑦 ∃𝑤 ∈ 𝑦 𝒫 𝑧 ⊆ 𝑤))
26		r19.26 3126	. . . . 5 ⊢ (∀𝑧 ∈ 𝑦 (𝒫 𝑧 ⊆ 𝑦 ∧ 𝒫 𝑧 ∈ 𝑦) ↔ (∀𝑧 ∈ 𝑦 𝒫 𝑧 ⊆ 𝑦 ∧ ∀𝑧 ∈ 𝑦 𝒫 𝑧 ∈ 𝑦))
27		r19.26 3126	. . . . 5 ⊢ (∀𝑧 ∈ 𝑦 (𝒫 𝑧 ⊆ 𝑦 ∧ ∃𝑤 ∈ 𝑦 𝒫 𝑧 ⊆ 𝑤) ↔ (∀𝑧 ∈ 𝑦 𝒫 𝑧 ⊆ 𝑦 ∧ ∀𝑧 ∈ 𝑦 ∃𝑤 ∈ 𝑦 𝒫 𝑧 ⊆ 𝑤))
28	25, 26, 27	3bitr4i 306	. . . 4 ⊢ (∀𝑧 ∈ 𝑦 (𝒫 𝑧 ⊆ 𝑦 ∧ 𝒫 𝑧 ∈ 𝑦) ↔ ∀𝑧 ∈ 𝑦 (𝒫 𝑧 ⊆ 𝑦 ∧ ∃𝑤 ∈ 𝑦 𝒫 𝑧 ⊆ 𝑤))
29		velpw 4565	. . . . . 6 ⊢ (𝑧 ∈ 𝒫 𝑦 ↔ 𝑧 ⊆ 𝑦)
30		impexp 456	. . . . . . . . 9 ⊢ (((𝑧 ⊆ 𝑦 ∧ 𝑧 ≼ 𝑦) → (¬ 𝑧 ≈ 𝑦 → 𝑧 ∈ 𝑦)) ↔ (𝑧 ⊆ 𝑦 → (𝑧 ≼ 𝑦 → (¬ 𝑧 ≈ 𝑦 → 𝑧 ∈ 𝑦))))
31		ssdomg 9055	. . . . . . . . . . . 12 ⊢ (𝑦 ∈ V → (𝑧 ⊆ 𝑦 → 𝑧 ≼ 𝑦))
32	31	elv 3459	. . . . . . . . . . 11 ⊢ (𝑧 ⊆ 𝑦 → 𝑧 ≼ 𝑦)
33	32	pm4.71i 569	. . . . . . . . . 10 ⊢ (𝑧 ⊆ 𝑦 ↔ (𝑧 ⊆ 𝑦 ∧ 𝑧 ≼ 𝑦))
34	33	imbi1i 352	. . . . . . . . 9 ⊢ ((𝑧 ⊆ 𝑦 → (¬ 𝑧 ≈ 𝑦 → 𝑧 ∈ 𝑦)) ↔ ((𝑧 ⊆ 𝑦 ∧ 𝑧 ≼ 𝑦) → (¬ 𝑧 ≈ 𝑦 → 𝑧 ∈ 𝑦)))
35		brsdom 9029	. . . . . . . . . . . 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 3110	. . . 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 2147  ∀wral 3080  ∃wrex 3090  Vcvv 3454   ⊆ wss 3900  𝒫 cpw 4560   class class class wbr 5106   ≈ cen 8998   ≼ cdom 8999   ≺ csdm 9000

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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-ext 2735  ax-sep 5252  ax-pow 5331  ax-pr 5395  ax-un 7775  ax-groth 10935

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 2102  df-clab 2742  df-cleq 2755  df-clel 2839  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-br 5107  df-opab 5171  df-id 5550  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-fun 6560  df-fn 6561  df-f 6562  df-f1 6563  df-fo 6564  df-f1o 6565  df-dom 9003  df-sdom 9004

This theorem is used by:  grothomex  10941  grothac  10942