Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > r1limg | Structured version Visualization version GIF version |
Description: Value of the cumulative hierarchy of sets function at a limit ordinal. Part of Definition 9.9 of [TakeutiZaring] p. 76. (Contributed by Mario Carneiro, 16-Nov-2014.) |
Ref | Expression |
---|---|
r1limg | ⊢ ((𝐴 ∈ dom 𝑅1 ∧ Lim 𝐴) → (𝑅1‘𝐴) = ∪ 𝑥 ∈ 𝐴 (𝑅1‘𝑥)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | df-r1 9195 | . . . . 5 ⊢ 𝑅1 = rec((𝑦 ∈ V ↦ 𝒫 𝑦), ∅) | |
2 | 1 | dmeqi 5775 | . . . 4 ⊢ dom 𝑅1 = dom rec((𝑦 ∈ V ↦ 𝒫 𝑦), ∅) |
3 | 2 | eleq2i 2906 | . . 3 ⊢ (𝐴 ∈ dom 𝑅1 ↔ 𝐴 ∈ dom rec((𝑦 ∈ V ↦ 𝒫 𝑦), ∅)) |
4 | rdglimg 8063 | . . 3 ⊢ ((𝐴 ∈ dom rec((𝑦 ∈ V ↦ 𝒫 𝑦), ∅) ∧ Lim 𝐴) → (rec((𝑦 ∈ V ↦ 𝒫 𝑦), ∅)‘𝐴) = ∪ (rec((𝑦 ∈ V ↦ 𝒫 𝑦), ∅) “ 𝐴)) | |
5 | 3, 4 | sylanb 583 | . 2 ⊢ ((𝐴 ∈ dom 𝑅1 ∧ Lim 𝐴) → (rec((𝑦 ∈ V ↦ 𝒫 𝑦), ∅)‘𝐴) = ∪ (rec((𝑦 ∈ V ↦ 𝒫 𝑦), ∅) “ 𝐴)) |
6 | 1 | fveq1i 6673 | . 2 ⊢ (𝑅1‘𝐴) = (rec((𝑦 ∈ V ↦ 𝒫 𝑦), ∅)‘𝐴) |
7 | r1funlim 9197 | . . . . 5 ⊢ (Fun 𝑅1 ∧ Lim dom 𝑅1) | |
8 | 7 | simpli 486 | . . . 4 ⊢ Fun 𝑅1 |
9 | funiunfv 7009 | . . . 4 ⊢ (Fun 𝑅1 → ∪ 𝑥 ∈ 𝐴 (𝑅1‘𝑥) = ∪ (𝑅1 “ 𝐴)) | |
10 | 8, 9 | ax-mp 5 | . . 3 ⊢ ∪ 𝑥 ∈ 𝐴 (𝑅1‘𝑥) = ∪ (𝑅1 “ 𝐴) |
11 | 1 | imaeq1i 5928 | . . . 4 ⊢ (𝑅1 “ 𝐴) = (rec((𝑦 ∈ V ↦ 𝒫 𝑦), ∅) “ 𝐴) |
12 | 11 | unieqi 4853 | . . 3 ⊢ ∪ (𝑅1 “ 𝐴) = ∪ (rec((𝑦 ∈ V ↦ 𝒫 𝑦), ∅) “ 𝐴) |
13 | 10, 12 | eqtri 2846 | . 2 ⊢ ∪ 𝑥 ∈ 𝐴 (𝑅1‘𝑥) = ∪ (rec((𝑦 ∈ V ↦ 𝒫 𝑦), ∅) “ 𝐴) |
14 | 5, 6, 13 | 3eqtr4g 2883 | 1 ⊢ ((𝐴 ∈ dom 𝑅1 ∧ Lim 𝐴) → (𝑅1‘𝐴) = ∪ 𝑥 ∈ 𝐴 (𝑅1‘𝑥)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 398 = wceq 1537 ∈ wcel 2114 Vcvv 3496 ∅c0 4293 𝒫 cpw 4541 ∪ cuni 4840 ∪ ciun 4921 ↦ cmpt 5148 dom cdm 5557 “ cima 5560 Lim wlim 6194 Fun wfun 6351 ‘cfv 6357 reccrdg 8047 𝑅1cr1 9193 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2116 ax-9 2124 ax-10 2145 ax-11 2161 ax-12 2177 ax-ext 2795 ax-sep 5205 ax-nul 5212 ax-pow 5268 ax-pr 5332 ax-un 7463 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1084 df-3an 1085 df-tru 1540 df-ex 1781 df-nf 1785 df-sb 2070 df-mo 2622 df-eu 2654 df-clab 2802 df-cleq 2816 df-clel 2895 df-nfc 2965 df-ne 3019 df-ral 3145 df-rex 3146 df-reu 3147 df-rab 3149 df-v 3498 df-sbc 3775 df-csb 3886 df-dif 3941 df-un 3943 df-in 3945 df-ss 3954 df-pss 3956 df-nul 4294 df-if 4470 df-pw 4543 df-sn 4570 df-pr 4572 df-tp 4574 df-op 4576 df-uni 4841 df-iun 4923 df-br 5069 df-opab 5131 df-mpt 5149 df-tr 5175 df-id 5462 df-eprel 5467 df-po 5476 df-so 5477 df-fr 5516 df-we 5518 df-xp 5563 df-rel 5564 df-cnv 5565 df-co 5566 df-dm 5567 df-rn 5568 df-res 5569 df-ima 5570 df-pred 6150 df-ord 6196 df-on 6197 df-lim 6198 df-suc 6199 df-iota 6316 df-fun 6359 df-fn 6360 df-f 6361 df-f1 6362 df-fo 6363 df-f1o 6364 df-fv 6365 df-wrecs 7949 df-recs 8010 df-rdg 8048 df-r1 9195 |
This theorem is referenced by: r1lim 9203 r1tr 9207 r1ordg 9209 r1pwss 9215 r1val1 9217 |
Copyright terms: Public domain | W3C validator |