Theorem r1limwun 10749

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 9762	. . 3 ⊢ Tr (𝑅1‘𝐴)
2	1	a1i 11	. 2 ⊢ ((𝐴 ∈ 𝑉 ∧ Lim 𝐴) → Tr (𝑅1‘𝐴))
3		limelon 6427	. . . . . 6 ⊢ ((𝐴 ∈ 𝑉 ∧ Lim 𝐴) → 𝐴 ∈ On)
4		r1fnon 9753	. . . . . . 7 ⊢ 𝑅1 Fn On
5	4	fndmi 6640	. . . . . 6 ⊢ dom 𝑅1 = On
6	3, 5	eleqtrrdi 2873	. . . . 5 ⊢ ((𝐴 ∈ 𝑉 ∧ Lim 𝐴) → 𝐴 ∈ dom 𝑅1)
7		onssr1 9817	. . . . 5 ⊢ (𝐴 ∈ dom 𝑅1 → 𝐴 ⊆ (𝑅1‘𝐴))
8	6, 7	syl 18	. . . 4 ⊢ ((𝐴 ∈ 𝑉 ∧ Lim 𝐴) → 𝐴 ⊆ (𝑅1‘𝐴))
9		0ellim 6426	. . . . 5 ⊢ (Lim 𝐴 → ∅ ∈ 𝐴)
10	9	adantl 487	. . . 4 ⊢ ((𝐴 ∈ 𝑉 ∧ Lim 𝐴) → ∅ ∈ 𝐴)
11	8, 10	sseldd 3935	. . 3 ⊢ ((𝐴 ∈ 𝑉 ∧ Lim 𝐴) → ∅ ∈ (𝑅1‘𝐴))
12	11	ne0d 4291	. 2 ⊢ ((𝐴 ∈ 𝑉 ∧ Lim 𝐴) → (𝑅1‘𝐴) ≠ ∅)
13		rankuni 9849	. . . . . 6 ⊢ (rank‘∪ 𝑥) = ∪ (rank‘𝑥)
14		rankon 9781	. . . . . . . . 9 ⊢ (rank‘𝑥) ∈ On
15		eloni 6371	. . . . . . . . 9 ⊢ ((rank‘𝑥) ∈ On → Ord (rank‘𝑥))
16		orduniss 6461	. . . . . . . . 9 ⊢ (Ord (rank‘𝑥) → ∪ (rank‘𝑥) ⊆ (rank‘𝑥))
17	14, 15, 16	mp2b 10	. . . . . . . 8 ⊢ ∪ (rank‘𝑥) ⊆ (rank‘𝑥)
18	17	a1i 11	. . . . . . 7 ⊢ (((𝐴 ∈ 𝑉 ∧ Lim 𝐴) ∧ 𝑥 ∈ (𝑅1‘𝐴)) → ∪ (rank‘𝑥) ⊆ (rank‘𝑥))
19		rankr1ai 9784	. . . . . . . 8 ⊢ (𝑥 ∈ (𝑅1‘𝐴) → (rank‘𝑥) ∈ 𝐴)
20	19	adantl 487	. . . . . . 7 ⊢ (((𝐴 ∈ 𝑉 ∧ Lim 𝐴) ∧ 𝑥 ∈ (𝑅1‘𝐴)) → (rank‘𝑥) ∈ 𝐴)
21		onuni 7791	. . . . . . . . 9 ⊢ ((rank‘𝑥) ∈ On → ∪ (rank‘𝑥) ∈ On)
22	14, 21	ax-mp 5	. . . . . . . 8 ⊢ ∪ (rank‘𝑥) ∈ On
23	3	adantr 486	. . . . . . . 8 ⊢ (((𝐴 ∈ 𝑉 ∧ Lim 𝐴) ∧ 𝑥 ∈ (𝑅1‘𝐴)) → 𝐴 ∈ On)
24		ontr2 6410	. . . . . . . 8 ⊢ ((∪ (rank‘𝑥) ∈ On ∧ 𝐴 ∈ On) → ((∪ (rank‘𝑥) ⊆ (rank‘𝑥) ∧ (rank‘𝑥) ∈ 𝐴) → ∪ (rank‘𝑥) ∈ 𝐴))
25	22, 23, 24	sylancr 599	. . . . . . 7 ⊢ (((𝐴 ∈ 𝑉 ∧ Lim 𝐴) ∧ 𝑥 ∈ (𝑅1‘𝐴)) → ((∪ (rank‘𝑥) ⊆ (rank‘𝑥) ∧ (rank‘𝑥) ∈ 𝐴) → ∪ (rank‘𝑥) ∈ 𝐴))
26	18, 20, 25	mp2and 712	. . . . . 6 ⊢ (((𝐴 ∈ 𝑉 ∧ Lim 𝐴) ∧ 𝑥 ∈ (𝑅1‘𝐴)) → ∪ (rank‘𝑥) ∈ 𝐴)
27	13, 26	eqeltrid 2866	. . . . 5 ⊢ (((𝐴 ∈ 𝑉 ∧ Lim 𝐴) ∧ 𝑥 ∈ (𝑅1‘𝐴)) → (rank‘∪ 𝑥) ∈ 𝐴)
28		r1elwf 9782	. . . . . . . 8 ⊢ (𝑥 ∈ (𝑅1‘𝐴) → 𝑥 ∈ ∪ (𝑅1 “ On))
29	28	adantl 487	. . . . . . 7 ⊢ (((𝐴 ∈ 𝑉 ∧ Lim 𝐴) ∧ 𝑥 ∈ (𝑅1‘𝐴)) → 𝑥 ∈ ∪ (𝑅1 “ On))
30		uniwf 9805	. . . . . . 7 ⊢ (𝑥 ∈ ∪ (𝑅1 “ On) ↔ ∪ 𝑥 ∈ ∪ (𝑅1 “ On))
31	29, 30	sylib 221	. . . . . 6 ⊢ (((𝐴 ∈ 𝑉 ∧ Lim 𝐴) ∧ 𝑥 ∈ (𝑅1‘𝐴)) → ∪ 𝑥 ∈ ∪ (𝑅1 “ On))
32	6	adantr 486	. . . . . 6 ⊢ (((𝐴 ∈ 𝑉 ∧ Lim 𝐴) ∧ 𝑥 ∈ (𝑅1‘𝐴)) → 𝐴 ∈ dom 𝑅1)
33		rankr1ag 9788	. . . . . 6 ⊢ ((∪ 𝑥 ∈ ∪ (𝑅1 “ On) ∧ 𝐴 ∈ dom 𝑅1) → (∪ 𝑥 ∈ (𝑅1‘𝐴) ↔ (rank‘∪ 𝑥) ∈ 𝐴))
34	31, 32, 33	syl2anc 596	. . . . 5 ⊢ (((𝐴 ∈ 𝑉 ∧ Lim 𝐴) ∧ 𝑥 ∈ (𝑅1‘𝐴)) → (∪ 𝑥 ∈ (𝑅1‘𝐴) ↔ (rank‘∪ 𝑥) ∈ 𝐴))
35	27, 34	mpbird 260	. . . 4 ⊢ (((𝐴 ∈ 𝑉 ∧ Lim 𝐴) ∧ 𝑥 ∈ (𝑅1‘𝐴)) → ∪ 𝑥 ∈ (𝑅1‘𝐴))
36		r1pwcl 9833	. . . . . 6 ⊢ (Lim 𝐴 → (𝑥 ∈ (𝑅1‘𝐴) ↔ 𝒫 𝑥 ∈ (𝑅1‘𝐴)))
37	36	adantl 487	. . . . 5 ⊢ ((𝐴 ∈ 𝑉 ∧ Lim 𝐴) → (𝑥 ∈ (𝑅1‘𝐴) ↔ 𝒫 𝑥 ∈ (𝑅1‘𝐴)))
38	37	biimpa 482	. . . 4 ⊢ (((𝐴 ∈ 𝑉 ∧ Lim 𝐴) ∧ 𝑥 ∈ (𝑅1‘𝐴)) → 𝒫 𝑥 ∈ (𝑅1‘𝐴))
39	28	ad2antlr 740	. . . . . . . 8 ⊢ ((((𝐴 ∈ 𝑉 ∧ Lim 𝐴) ∧ 𝑥 ∈ (𝑅1‘𝐴)) ∧ 𝑦 ∈ (𝑅1‘𝐴)) → 𝑥 ∈ ∪ (𝑅1 “ On))
40		r1elwf 9782	. . . . . . . . 9 ⊢ (𝑦 ∈ (𝑅1‘𝐴) → 𝑦 ∈ ∪ (𝑅1 “ On))
41	40	adantl 487	. . . . . . . 8 ⊢ ((((𝐴 ∈ 𝑉 ∧ Lim 𝐴) ∧ 𝑥 ∈ (𝑅1‘𝐴)) ∧ 𝑦 ∈ (𝑅1‘𝐴)) → 𝑦 ∈ ∪ (𝑅1 “ On))
42		rankprb 9837	. . . . . . . 8 ⊢ ((𝑥 ∈ ∪ (𝑅1 “ On) ∧ 𝑦 ∈ ∪ (𝑅1 “ On)) → (rank‘{𝑥, 𝑦}) = suc ((rank‘𝑥) ∪ (rank‘𝑦)))
43	39, 41, 42	syl2anc 596	. . . . . . 7 ⊢ ((((𝐴 ∈ 𝑉 ∧ Lim 𝐴) ∧ 𝑥 ∈ (𝑅1‘𝐴)) ∧ 𝑦 ∈ (𝑅1‘𝐴)) → (rank‘{𝑥, 𝑦}) = suc ((rank‘𝑥) ∪ (rank‘𝑦)))
44		limord 6423	. . . . . . . . . 10 ⊢ (Lim 𝐴 → Ord 𝐴)
45	44	ad3antlr 744	. . . . . . . . 9 ⊢ ((((𝐴 ∈ 𝑉 ∧ Lim 𝐴) ∧ 𝑥 ∈ (𝑅1‘𝐴)) ∧ 𝑦 ∈ (𝑅1‘𝐴)) → Ord 𝐴)
46	20	adantr 486	. . . . . . . . 9 ⊢ ((((𝐴 ∈ 𝑉 ∧ Lim 𝐴) ∧ 𝑥 ∈ (𝑅1‘𝐴)) ∧ 𝑦 ∈ (𝑅1‘𝐴)) → (rank‘𝑥) ∈ 𝐴)
47		rankr1ai 9784	. . . . . . . . . 10 ⊢ (𝑦 ∈ (𝑅1‘𝐴) → (rank‘𝑦) ∈ 𝐴)
48	47	adantl 487	. . . . . . . . 9 ⊢ ((((𝐴 ∈ 𝑉 ∧ Lim 𝐴) ∧ 𝑥 ∈ (𝑅1‘𝐴)) ∧ 𝑦 ∈ (𝑅1‘𝐴)) → (rank‘𝑦) ∈ 𝐴)
49		ordunel 7827	. . . . . . . . 9 ⊢ ((Ord 𝐴 ∧ (rank‘𝑥) ∈ 𝐴 ∧ (rank‘𝑦) ∈ 𝐴) → ((rank‘𝑥) ∪ (rank‘𝑦)) ∈ 𝐴)
50	45, 46, 48, 49	syl3anc 1398	. . . . . . . 8 ⊢ ((((𝐴 ∈ 𝑉 ∧ Lim 𝐴) ∧ 𝑥 ∈ (𝑅1‘𝐴)) ∧ 𝑦 ∈ (𝑅1‘𝐴)) → ((rank‘𝑥) ∪ (rank‘𝑦)) ∈ 𝐴)
51		limsuc 7849	. . . . . . . . 9 ⊢ (Lim 𝐴 → (((rank‘𝑥) ∪ (rank‘𝑦)) ∈ 𝐴 ↔ suc ((rank‘𝑥) ∪ (rank‘𝑦)) ∈ 𝐴))
52	51	ad3antlr 744	. . . . . . . 8 ⊢ ((((𝐴 ∈ 𝑉 ∧ Lim 𝐴) ∧ 𝑥 ∈ (𝑅1‘𝐴)) ∧ 𝑦 ∈ (𝑅1‘𝐴)) → (((rank‘𝑥) ∪ (rank‘𝑦)) ∈ 𝐴 ↔ suc ((rank‘𝑥) ∪ (rank‘𝑦)) ∈ 𝐴))
53	50, 52	mpbid 235	. . . . . . 7 ⊢ ((((𝐴 ∈ 𝑉 ∧ Lim 𝐴) ∧ 𝑥 ∈ (𝑅1‘𝐴)) ∧ 𝑦 ∈ (𝑅1‘𝐴)) → suc ((rank‘𝑥) ∪ (rank‘𝑦)) ∈ 𝐴)
54	43, 53	eqeltrd 2862	. . . . . 6 ⊢ ((((𝐴 ∈ 𝑉 ∧ Lim 𝐴) ∧ 𝑥 ∈ (𝑅1‘𝐴)) ∧ 𝑦 ∈ (𝑅1‘𝐴)) → (rank‘{𝑥, 𝑦}) ∈ 𝐴)
55		prwf 9797	. . . . . . . 8 ⊢ ((𝑥 ∈ ∪ (𝑅1 “ On) ∧ 𝑦 ∈ ∪ (𝑅1 “ On)) → {𝑥, 𝑦} ∈ ∪ (𝑅1 “ On))
56	39, 41, 55	syl2anc 596	. . . . . . 7 ⊢ ((((𝐴 ∈ 𝑉 ∧ Lim 𝐴) ∧ 𝑥 ∈ (𝑅1‘𝐴)) ∧ 𝑦 ∈ (𝑅1‘𝐴)) → {𝑥, 𝑦} ∈ ∪ (𝑅1 “ On))
57	32	adantr 486	. . . . . . 7 ⊢ ((((𝐴 ∈ 𝑉 ∧ Lim 𝐴) ∧ 𝑥 ∈ (𝑅1‘𝐴)) ∧ 𝑦 ∈ (𝑅1‘𝐴)) → 𝐴 ∈ dom 𝑅1)
58		rankr1ag 9788	. . . . . . 7 ⊢ (({𝑥, 𝑦} ∈ ∪ (𝑅1 “ On) ∧ 𝐴 ∈ dom 𝑅1) → ({𝑥, 𝑦} ∈ (𝑅1‘𝐴) ↔ (rank‘{𝑥, 𝑦}) ∈ 𝐴))
59	56, 57, 58	syl2anc 596	. . . . . 6 ⊢ ((((𝐴 ∈ 𝑉 ∧ Lim 𝐴) ∧ 𝑥 ∈ (𝑅1‘𝐴)) ∧ 𝑦 ∈ (𝑅1‘𝐴)) → ({𝑥, 𝑦} ∈ (𝑅1‘𝐴) ↔ (rank‘{𝑥, 𝑦}) ∈ 𝐴))
60	54, 59	mpbird 260	. . . . 5 ⊢ ((((𝐴 ∈ 𝑉 ∧ Lim 𝐴) ∧ 𝑥 ∈ (𝑅1‘𝐴)) ∧ 𝑦 ∈ (𝑅1‘𝐴)) → {𝑥, 𝑦} ∈ (𝑅1‘𝐴))
61	60	ralrimiva 3156	. . . 4 ⊢ (((𝐴 ∈ 𝑉 ∧ Lim 𝐴) ∧ 𝑥 ∈ (𝑅1‘𝐴)) → ∀𝑦 ∈ (𝑅1‘𝐴){𝑥, 𝑦} ∈ (𝑅1‘𝐴))
62	35, 38, 61	3jca 1146	. . 3 ⊢ (((𝐴 ∈ 𝑉 ∧ Lim 𝐴) ∧ 𝑥 ∈ (𝑅1‘𝐴)) → (∪ 𝑥 ∈ (𝑅1‘𝐴) ∧ 𝒫 𝑥 ∈ (𝑅1‘𝐴) ∧ ∀𝑦 ∈ (𝑅1‘𝐴){𝑥, 𝑦} ∈ (𝑅1‘𝐴)))
63	62	ralrimiva 3156	. 2 ⊢ ((𝐴 ∈ 𝑉 ∧ Lim 𝐴) → ∀𝑥 ∈ (𝑅1‘𝐴)(∪ 𝑥 ∈ (𝑅1‘𝐴) ∧ 𝒫 𝑥 ∈ (𝑅1‘𝐴) ∧ ∀𝑦 ∈ (𝑅1‘𝐴){𝑥, 𝑦} ∈ (𝑅1‘𝐴)))
64		fvex 6895	. . 3 ⊢ (𝑅1‘𝐴) ∈ V
65		iswun 10717	. . 3 ⊢ ((𝑅1‘𝐴) ∈ V → ((𝑅1‘𝐴) ∈ WUni ↔ (Tr (𝑅1‘𝐴) ∧ (𝑅1‘𝐴) ≠ ∅ ∧ ∀𝑥 ∈ (𝑅1‘𝐴)(∪ 𝑥 ∈ (𝑅1‘𝐴) ∧ 𝒫 𝑥 ∈ (𝑅1‘𝐴) ∧ ∀𝑦 ∈ (𝑅1‘𝐴){𝑥, 𝑦} ∈ (𝑅1‘𝐴)))))
66	64, 65	ax-mp 5	. 2 ⊢ ((𝑅1‘𝐴) ∈ WUni ↔ (Tr (𝑅1‘𝐴) ∧ (𝑅1‘𝐴) ≠ ∅ ∧ ∀𝑥 ∈ (𝑅1‘𝐴)(∪ 𝑥 ∈ (𝑅1‘𝐴) ∧ 𝒫 𝑥 ∈ (𝑅1‘𝐴) ∧ ∀𝑦 ∈ (𝑅1‘𝐴){𝑥, 𝑦} ∈ (𝑅1‘𝐴))))
67	2, 12, 63, 66	syl3anbrc 1362	1 ⊢ ((𝐴 ∈ 𝑉 ∧ Lim 𝐴) → (𝑅1‘𝐴) ∈ WUni)

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2145   ≠ wne 2957  ∀wral 3078  Vcvv 3453   ∪ cun 3900   ⊆ wss 3902  ∅c0 4282  𝒫 cpw 4560  {cpr 4589  ∪ cuni 4870  Tr wtr 5216  dom cdm 5659   “ cima 5662  Ord word 6360  Oncon0 6361  Lim wlim 6362  suc csuc 6363  ‘cfv 6537  𝑅₁cr1 9748  rankcrnk 9749  WUnicwun 10713

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 2215  ax-ext 2734  ax-rep 5236  ax-sep 5255  ax-nul 5267  ax-pow 5334  ax-pr 5402  ax-un 7740  ax-reg 9568  ax-inf2 9624

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-ral 3079  df-rex 3089  df-reu 3368  df-rab 3415  df-v 3455  df-sbc 3743  df-csb 3851  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-pss 3922  df-nul 4283  df-if 4486  df-pw 4562  df-sn 4588  df-pr 4590  df-op 4594  df-uni 4871  df-int 4911  df-iun 4956  df-br 5108  df-opab 5172  df-mpt 5191  df-tr 5217  df-id 5554  df-eprel 5559  df-po 5567  df-so 5568  df-fr 5612  df-we 5614  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-rn 5670  df-res 5671  df-ima 5672  df-pred 6303  df-ord 6364  df-on 6365  df-lim 6366  df-suc 6367  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-f1 6542  df-fo 6543  df-f1o 6544  df-fv 6545  df-ov 7420  df-om 7867  df-2nd 7991  df-frecs 8284  df-wrecs 8315  df-recs 8364  df-rdg 8403  df-r1 9750  df-rank 9751  df-wun 10715

This theorem is used by:  r1wunlim  10750  wunex3  10754