Theorem r1limwun 9558

Description: Each limit stage in the cumulative hierarchy is a weak universe. (Contributed by Mario Carneiro, 2-Jan-2017.)

Assertion

Ref	Expression
r1limwun	⊢ ((𝐴 ∈ 𝑉 ∧ Lim 𝐴) → (𝑅1‘𝐴) ∈ WUni)

Proof of Theorem r1limwun

Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		r1tr 8639	. . 3 ⊢ Tr (𝑅1‘𝐴)
2	1	a1i 11	. 2 ⊢ ((𝐴 ∈ 𝑉 ∧ Lim 𝐴) → Tr (𝑅1‘𝐴))
3		limelon 5788	. . . . . 6 ⊢ ((𝐴 ∈ 𝑉 ∧ Lim 𝐴) → 𝐴 ∈ On)
4		r1fnon 8630	. . . . . . 7 ⊢ 𝑅1 Fn On
5		fndm 5990	. . . . . . 7 ⊢ (𝑅1 Fn On → dom 𝑅1 = On)
6	4, 5	ax-mp 5	. . . . . 6 ⊢ dom 𝑅1 = On
7	3, 6	syl6eleqr 2712	. . . . 5 ⊢ ((𝐴 ∈ 𝑉 ∧ Lim 𝐴) → 𝐴 ∈ dom 𝑅1)
8		onssr1 8694	. . . . 5 ⊢ (𝐴 ∈ dom 𝑅1 → 𝐴 ⊆ (𝑅1‘𝐴))
9	7, 8	syl 17	. . . 4 ⊢ ((𝐴 ∈ 𝑉 ∧ Lim 𝐴) → 𝐴 ⊆ (𝑅1‘𝐴))
10		0ellim 5787	. . . . 5 ⊢ (Lim 𝐴 → ∅ ∈ 𝐴)
11	10	adantl 482	. . . 4 ⊢ ((𝐴 ∈ 𝑉 ∧ Lim 𝐴) → ∅ ∈ 𝐴)
12	9, 11	sseldd 3604	. . 3 ⊢ ((𝐴 ∈ 𝑉 ∧ Lim 𝐴) → ∅ ∈ (𝑅1‘𝐴))
13		ne0i 3921	. . 3 ⊢ (∅ ∈ (𝑅1‘𝐴) → (𝑅1‘𝐴) ≠ ∅)
14	12, 13	syl 17	. 2 ⊢ ((𝐴 ∈ 𝑉 ∧ Lim 𝐴) → (𝑅1‘𝐴) ≠ ∅)
15		rankuni 8726	. . . . . 6 ⊢ (rank‘∪ 𝑥) = ∪ (rank‘𝑥)
16		rankon 8658	. . . . . . . . 9 ⊢ (rank‘𝑥) ∈ On
17		eloni 5733	. . . . . . . . 9 ⊢ ((rank‘𝑥) ∈ On → Ord (rank‘𝑥))
18		orduniss 5821	. . . . . . . . 9 ⊢ (Ord (rank‘𝑥) → ∪ (rank‘𝑥) ⊆ (rank‘𝑥))
19	16, 17, 18	mp2b 10	. . . . . . . 8 ⊢ ∪ (rank‘𝑥) ⊆ (rank‘𝑥)
20	19	a1i 11	. . . . . . 7 ⊢ (((𝐴 ∈ 𝑉 ∧ Lim 𝐴) ∧ 𝑥 ∈ (𝑅1‘𝐴)) → ∪ (rank‘𝑥) ⊆ (rank‘𝑥))
21		rankr1ai 8661	. . . . . . . 8 ⊢ (𝑥 ∈ (𝑅1‘𝐴) → (rank‘𝑥) ∈ 𝐴)
22	21	adantl 482	. . . . . . 7 ⊢ (((𝐴 ∈ 𝑉 ∧ Lim 𝐴) ∧ 𝑥 ∈ (𝑅1‘𝐴)) → (rank‘𝑥) ∈ 𝐴)
23		onuni 6993	. . . . . . . . 9 ⊢ ((rank‘𝑥) ∈ On → ∪ (rank‘𝑥) ∈ On)
24	16, 23	ax-mp 5	. . . . . . . 8 ⊢ ∪ (rank‘𝑥) ∈ On
25	3	adantr 481	. . . . . . . 8 ⊢ (((𝐴 ∈ 𝑉 ∧ Lim 𝐴) ∧ 𝑥 ∈ (𝑅1‘𝐴)) → 𝐴 ∈ On)
26		ontr2 5772	. . . . . . . 8 ⊢ ((∪ (rank‘𝑥) ∈ On ∧ 𝐴 ∈ On) → ((∪ (rank‘𝑥) ⊆ (rank‘𝑥) ∧ (rank‘𝑥) ∈ 𝐴) → ∪ (rank‘𝑥) ∈ 𝐴))
27	24, 25, 26	sylancr 695	. . . . . . 7 ⊢ (((𝐴 ∈ 𝑉 ∧ Lim 𝐴) ∧ 𝑥 ∈ (𝑅1‘𝐴)) → ((∪ (rank‘𝑥) ⊆ (rank‘𝑥) ∧ (rank‘𝑥) ∈ 𝐴) → ∪ (rank‘𝑥) ∈ 𝐴))
28	20, 22, 27	mp2and 715	. . . . . 6 ⊢ (((𝐴 ∈ 𝑉 ∧ Lim 𝐴) ∧ 𝑥 ∈ (𝑅1‘𝐴)) → ∪ (rank‘𝑥) ∈ 𝐴)
29	15, 28	syl5eqel 2705	. . . . 5 ⊢ (((𝐴 ∈ 𝑉 ∧ Lim 𝐴) ∧ 𝑥 ∈ (𝑅1‘𝐴)) → (rank‘∪ 𝑥) ∈ 𝐴)
30		r1elwf 8659	. . . . . . . 8 ⊢ (𝑥 ∈ (𝑅1‘𝐴) → 𝑥 ∈ ∪ (𝑅1 “ On))
31	30	adantl 482	. . . . . . 7 ⊢ (((𝐴 ∈ 𝑉 ∧ Lim 𝐴) ∧ 𝑥 ∈ (𝑅1‘𝐴)) → 𝑥 ∈ ∪ (𝑅1 “ On))
32		uniwf 8682	. . . . . . 7 ⊢ (𝑥 ∈ ∪ (𝑅1 “ On) ↔ ∪ 𝑥 ∈ ∪ (𝑅1 “ On))
33	31, 32	sylib 208	. . . . . 6 ⊢ (((𝐴 ∈ 𝑉 ∧ Lim 𝐴) ∧ 𝑥 ∈ (𝑅1‘𝐴)) → ∪ 𝑥 ∈ ∪ (𝑅1 “ On))
34	7	adantr 481	. . . . . 6 ⊢ (((𝐴 ∈ 𝑉 ∧ Lim 𝐴) ∧ 𝑥 ∈ (𝑅1‘𝐴)) → 𝐴 ∈ dom 𝑅1)
35		rankr1ag 8665	. . . . . 6 ⊢ ((∪ 𝑥 ∈ ∪ (𝑅1 “ On) ∧ 𝐴 ∈ dom 𝑅1) → (∪ 𝑥 ∈ (𝑅1‘𝐴) ↔ (rank‘∪ 𝑥) ∈ 𝐴))
36	33, 34, 35	syl2anc 693	. . . . 5 ⊢ (((𝐴 ∈ 𝑉 ∧ Lim 𝐴) ∧ 𝑥 ∈ (𝑅1‘𝐴)) → (∪ 𝑥 ∈ (𝑅1‘𝐴) ↔ (rank‘∪ 𝑥) ∈ 𝐴))
37	29, 36	mpbird 247	. . . 4 ⊢ (((𝐴 ∈ 𝑉 ∧ Lim 𝐴) ∧ 𝑥 ∈ (𝑅1‘𝐴)) → ∪ 𝑥 ∈ (𝑅1‘𝐴))
38		r1pwcl 8710	. . . . . 6 ⊢ (Lim 𝐴 → (𝑥 ∈ (𝑅1‘𝐴) ↔ 𝒫 𝑥 ∈ (𝑅1‘𝐴)))
39	38	adantl 482	. . . . 5 ⊢ ((𝐴 ∈ 𝑉 ∧ Lim 𝐴) → (𝑥 ∈ (𝑅1‘𝐴) ↔ 𝒫 𝑥 ∈ (𝑅1‘𝐴)))
40	39	biimpa 501	. . . 4 ⊢ (((𝐴 ∈ 𝑉 ∧ Lim 𝐴) ∧ 𝑥 ∈ (𝑅1‘𝐴)) → 𝒫 𝑥 ∈ (𝑅1‘𝐴))
41	30	ad2antlr 763	. . . . . . . 8 ⊢ ((((𝐴 ∈ 𝑉 ∧ Lim 𝐴) ∧ 𝑥 ∈ (𝑅1‘𝐴)) ∧ 𝑦 ∈ (𝑅1‘𝐴)) → 𝑥 ∈ ∪ (𝑅1 “ On))
42		r1elwf 8659	. . . . . . . . 9 ⊢ (𝑦 ∈ (𝑅1‘𝐴) → 𝑦 ∈ ∪ (𝑅1 “ On))
43	42	adantl 482	. . . . . . . 8 ⊢ ((((𝐴 ∈ 𝑉 ∧ Lim 𝐴) ∧ 𝑥 ∈ (𝑅1‘𝐴)) ∧ 𝑦 ∈ (𝑅1‘𝐴)) → 𝑦 ∈ ∪ (𝑅1 “ On))
44		rankprb 8714	. . . . . . . 8 ⊢ ((𝑥 ∈ ∪ (𝑅1 “ On) ∧ 𝑦 ∈ ∪ (𝑅1 “ On)) → (rank‘{𝑥, 𝑦}) = suc ((rank‘𝑥) ∪ (rank‘𝑦)))
45	41, 43, 44	syl2anc 693	. . . . . . 7 ⊢ ((((𝐴 ∈ 𝑉 ∧ Lim 𝐴) ∧ 𝑥 ∈ (𝑅1‘𝐴)) ∧ 𝑦 ∈ (𝑅1‘𝐴)) → (rank‘{𝑥, 𝑦}) = suc ((rank‘𝑥) ∪ (rank‘𝑦)))
46		limord 5784	. . . . . . . . . 10 ⊢ (Lim 𝐴 → Ord 𝐴)
47	46	ad3antlr 767	. . . . . . . . 9 ⊢ ((((𝐴 ∈ 𝑉 ∧ Lim 𝐴) ∧ 𝑥 ∈ (𝑅1‘𝐴)) ∧ 𝑦 ∈ (𝑅1‘𝐴)) → Ord 𝐴)
48	22	adantr 481	. . . . . . . . 9 ⊢ ((((𝐴 ∈ 𝑉 ∧ Lim 𝐴) ∧ 𝑥 ∈ (𝑅1‘𝐴)) ∧ 𝑦 ∈ (𝑅1‘𝐴)) → (rank‘𝑥) ∈ 𝐴)
49		rankr1ai 8661	. . . . . . . . . 10 ⊢ (𝑦 ∈ (𝑅1‘𝐴) → (rank‘𝑦) ∈ 𝐴)
50	49	adantl 482	. . . . . . . . 9 ⊢ ((((𝐴 ∈ 𝑉 ∧ Lim 𝐴) ∧ 𝑥 ∈ (𝑅1‘𝐴)) ∧ 𝑦 ∈ (𝑅1‘𝐴)) → (rank‘𝑦) ∈ 𝐴)
51		ordunel 7027	. . . . . . . . 9 ⊢ ((Ord 𝐴 ∧ (rank‘𝑥) ∈ 𝐴 ∧ (rank‘𝑦) ∈ 𝐴) → ((rank‘𝑥) ∪ (rank‘𝑦)) ∈ 𝐴)
52	47, 48, 50, 51	syl3anc 1326	. . . . . . . 8 ⊢ ((((𝐴 ∈ 𝑉 ∧ Lim 𝐴) ∧ 𝑥 ∈ (𝑅1‘𝐴)) ∧ 𝑦 ∈ (𝑅1‘𝐴)) → ((rank‘𝑥) ∪ (rank‘𝑦)) ∈ 𝐴)
53		limsuc 7049	. . . . . . . . 9 ⊢ (Lim 𝐴 → (((rank‘𝑥) ∪ (rank‘𝑦)) ∈ 𝐴 ↔ suc ((rank‘𝑥) ∪ (rank‘𝑦)) ∈ 𝐴))
54	53	ad3antlr 767	. . . . . . . 8 ⊢ ((((𝐴 ∈ 𝑉 ∧ Lim 𝐴) ∧ 𝑥 ∈ (𝑅1‘𝐴)) ∧ 𝑦 ∈ (𝑅1‘𝐴)) → (((rank‘𝑥) ∪ (rank‘𝑦)) ∈ 𝐴 ↔ suc ((rank‘𝑥) ∪ (rank‘𝑦)) ∈ 𝐴))
55	52, 54	mpbid 222	. . . . . . 7 ⊢ ((((𝐴 ∈ 𝑉 ∧ Lim 𝐴) ∧ 𝑥 ∈ (𝑅1‘𝐴)) ∧ 𝑦 ∈ (𝑅1‘𝐴)) → suc ((rank‘𝑥) ∪ (rank‘𝑦)) ∈ 𝐴)
56	45, 55	eqeltrd 2701	. . . . . 6 ⊢ ((((𝐴 ∈ 𝑉 ∧ Lim 𝐴) ∧ 𝑥 ∈ (𝑅1‘𝐴)) ∧ 𝑦 ∈ (𝑅1‘𝐴)) → (rank‘{𝑥, 𝑦}) ∈ 𝐴)
57		prwf 8674	. . . . . . . 8 ⊢ ((𝑥 ∈ ∪ (𝑅1 “ On) ∧ 𝑦 ∈ ∪ (𝑅1 “ On)) → {𝑥, 𝑦} ∈ ∪ (𝑅1 “ On))
58	41, 43, 57	syl2anc 693	. . . . . . 7 ⊢ ((((𝐴 ∈ 𝑉 ∧ Lim 𝐴) ∧ 𝑥 ∈ (𝑅1‘𝐴)) ∧ 𝑦 ∈ (𝑅1‘𝐴)) → {𝑥, 𝑦} ∈ ∪ (𝑅1 “ On))
59	34	adantr 481	. . . . . . 7 ⊢ ((((𝐴 ∈ 𝑉 ∧ Lim 𝐴) ∧ 𝑥 ∈ (𝑅1‘𝐴)) ∧ 𝑦 ∈ (𝑅1‘𝐴)) → 𝐴 ∈ dom 𝑅1)
60		rankr1ag 8665	. . . . . . 7 ⊢ (({𝑥, 𝑦} ∈ ∪ (𝑅1 “ On) ∧ 𝐴 ∈ dom 𝑅1) → ({𝑥, 𝑦} ∈ (𝑅1‘𝐴) ↔ (rank‘{𝑥, 𝑦}) ∈ 𝐴))
61	58, 59, 60	syl2anc 693	. . . . . 6 ⊢ ((((𝐴 ∈ 𝑉 ∧ Lim 𝐴) ∧ 𝑥 ∈ (𝑅1‘𝐴)) ∧ 𝑦 ∈ (𝑅1‘𝐴)) → ({𝑥, 𝑦} ∈ (𝑅1‘𝐴) ↔ (rank‘{𝑥, 𝑦}) ∈ 𝐴))
62	56, 61	mpbird 247	. . . . 5 ⊢ ((((𝐴 ∈ 𝑉 ∧ Lim 𝐴) ∧ 𝑥 ∈ (𝑅1‘𝐴)) ∧ 𝑦 ∈ (𝑅1‘𝐴)) → {𝑥, 𝑦} ∈ (𝑅1‘𝐴))
63	62	ralrimiva 2966	. . . 4 ⊢ (((𝐴 ∈ 𝑉 ∧ Lim 𝐴) ∧ 𝑥 ∈ (𝑅1‘𝐴)) → ∀𝑦 ∈ (𝑅1‘𝐴){𝑥, 𝑦} ∈ (𝑅1‘𝐴))
64	37, 40, 63	3jca 1242	. . 3 ⊢ (((𝐴 ∈ 𝑉 ∧ Lim 𝐴) ∧ 𝑥 ∈ (𝑅1‘𝐴)) → (∪ 𝑥 ∈ (𝑅1‘𝐴) ∧ 𝒫 𝑥 ∈ (𝑅1‘𝐴) ∧ ∀𝑦 ∈ (𝑅1‘𝐴){𝑥, 𝑦} ∈ (𝑅1‘𝐴)))
65	64	ralrimiva 2966	. 2 ⊢ ((𝐴 ∈ 𝑉 ∧ Lim 𝐴) → ∀𝑥 ∈ (𝑅1‘𝐴)(∪ 𝑥 ∈ (𝑅1‘𝐴) ∧ 𝒫 𝑥 ∈ (𝑅1‘𝐴) ∧ ∀𝑦 ∈ (𝑅1‘𝐴){𝑥, 𝑦} ∈ (𝑅1‘𝐴)))
66		fvex 6201	. . 3 ⊢ (𝑅1‘𝐴) ∈ V
67		iswun 9526	. . 3 ⊢ ((𝑅1‘𝐴) ∈ V → ((𝑅1‘𝐴) ∈ WUni ↔ (Tr (𝑅1‘𝐴) ∧ (𝑅1‘𝐴) ≠ ∅ ∧ ∀𝑥 ∈ (𝑅1‘𝐴)(∪ 𝑥 ∈ (𝑅1‘𝐴) ∧ 𝒫 𝑥 ∈ (𝑅1‘𝐴) ∧ ∀𝑦 ∈ (𝑅1‘𝐴){𝑥, 𝑦} ∈ (𝑅1‘𝐴)))))
68	66, 67	ax-mp 5	. 2 ⊢ ((𝑅1‘𝐴) ∈ WUni ↔ (Tr (𝑅1‘𝐴) ∧ (𝑅1‘𝐴) ≠ ∅ ∧ ∀𝑥 ∈ (𝑅1‘𝐴)(∪ 𝑥 ∈ (𝑅1‘𝐴) ∧ 𝒫 𝑥 ∈ (𝑅1‘𝐴) ∧ ∀𝑦 ∈ (𝑅1‘𝐴){𝑥, 𝑦} ∈ (𝑅1‘𝐴))))
69	2, 14, 65, 68	syl3anbrc 1246	1 ⊢ ((𝐴 ∈ 𝑉 ∧ Lim 𝐴) → (𝑅1‘𝐴) ∈ WUni)

Syntax hints:   → wi 4   ↔ wb 196   ∧ wa 384   ∧ w3a 1037   = wceq 1483   ∈ wcel 1990   ≠ wne 2794  ∀wral 2912  Vcvv 3200   ∪ cun 3572   ⊆ wss 3574  ∅c0 3915  𝒫 cpw 4158  {cpr 4179  ∪ cuni 4436  Tr wtr 4752  dom cdm 5114   “ cima 5117  Ord word 5722  Oncon0 5723  Lim wlim 5724  suc csuc 5725   Fn wfn 5883  ‘cfv 5888  𝑅₁cr1 8625  rankcrnk 8626  WUnicwun 9522

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-8 1992  ax-9 1999  ax-10 2019  ax-11 2034  ax-12 2047  ax-13 2246  ax-ext 2602  ax-rep 4771  ax-sep 4781  ax-nul 4789  ax-pow 4843  ax-pr 4906  ax-un 6949  ax-reg 8497  ax-inf2 8538

This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3or 1038  df-3an 1039  df-tru 1486  df-ex 1705  df-nf 1710  df-sb 1881  df-eu 2474  df-mo 2475  df-clab 2609  df-cleq 2615  df-clel 2618  df-nfc 2753  df-ne 2795  df-ral 2917  df-rex 2918  df-reu 2919  df-rab 2921  df-v 3202  df-sbc 3436  df-csb 3534  df-dif 3577  df-un 3579  df-in 3581  df-ss 3588  df-pss 3590  df-nul 3916  df-if 4087  df-pw 4160  df-sn 4178  df-pr 4180  df-tp 4182  df-op 4184  df-uni 4437  df-int 4476  df-iun 4522  df-br 4654  df-opab 4713  df-mpt 4730  df-tr 4753  df-id 5024  df-eprel 5029  df-po 5035  df-so 5036  df-fr 5073  df-we 5075  df-xp 5120  df-rel 5121  df-cnv 5122  df-co 5123  df-dm 5124  df-rn 5125  df-res 5126  df-ima 5127  df-pred 5680  df-ord 5726  df-on 5727  df-lim 5728  df-suc 5729  df-iota 5851  df-fun 5890  df-fn 5891  df-f 5892  df-f1 5893  df-fo 5894  df-f1o 5895  df-fv 5896  df-om 7066  df-wrecs 7407  df-recs 7468  df-rdg 7506  df-r1 8627  df-rank 8628  df-wun 9524

This theorem is referenced by:  r1wunlim  9559  wunex3  9563