MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  r1limg Structured version   Visualization version   GIF version

Theorem r1limg 9815
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.)
Assertion
Ref Expression
r1limg ((𝐴 ∈ dom 𝑅1 ∧ Lim 𝐴) → (𝑅1‘𝐴) = ∪ 𝑥 ∈ 𝐴 (𝑅1‘𝑥))
Distinct variable group:   𝑥,𝐴

Proof of Theorem r1limg
Dummy variable 𝑦 is distinct from all other variables.
StepHypRef Expression
1 df-r1 9805 . . . . 5 𝑅1 = rec((𝑦 ∈ V ↦ 𝒫 𝑦), ∅)
21dmeqi 5898 . . . 4 dom 𝑅1 = dom rec((𝑦 ∈ V ↦ 𝒫 𝑦), ∅)
32eleq2i 2856 . . 3 (𝐴 ∈ dom 𝑅1 ↔ 𝐴 ∈ dom rec((𝑦 ∈ V ↦ 𝒫 𝑦), ∅))
4 rdglimg 8471 . . 3 ((𝐴 ∈ dom rec((𝑦 ∈ V ↦ 𝒫 𝑦), ∅) ∧ Lim 𝐴) → (rec((𝑦 ∈ V ↦ 𝒫 𝑦), ∅)‘𝐴) = ∪ (rec((𝑦 ∈ V ↦ 𝒫 𝑦), ∅) “ 𝐴))
53, 4sylanb 593 . 2 ((𝐴 ∈ dom 𝑅1 ∧ Lim 𝐴) → (rec((𝑦 ∈ V ↦ 𝒫 𝑦), ∅)‘𝐴) = ∪ (rec((𝑦 ∈ V ↦ 𝒫 𝑦), ∅) “ 𝐴))
61fveq1i 6917 . 2 (𝑅1‘𝐴) = (rec((𝑦 ∈ V ↦ 𝒫 𝑦), ∅)‘𝐴)
7 r1fun 9808 . . . 4 Fun 𝑅1
8 funiunfv 7283 . . . 4 (Fun 𝑅1 → ∪ 𝑥 ∈ 𝐴 (𝑅1‘𝑥) = ∪ (𝑅1 “ 𝐴))
97, 8ax-mp 5 . . 3 ∪ 𝑥 ∈ 𝐴 (𝑅1‘𝑥) = ∪ (𝑅1 “ 𝐴)
101imaeq1i 6067 . . . 4 (𝑅1 “ 𝐴) = (rec((𝑦 ∈ V ↦ 𝒫 𝑦), ∅) “ 𝐴)
1110unieqi 4884 . . 3 ∪ (𝑅1 “ 𝐴) = ∪ (rec((𝑦 ∈ V ↦ 𝒫 𝑦), ∅) “ 𝐴)
129, 11eqtri 2786 . 2 ∪ 𝑥 ∈ 𝐴 (𝑅1‘𝑥) = ∪ (rec((𝑦 ∈ V ↦ 𝒫 𝑦), ∅) “ 𝐴)
135, 6, 123eqtr4g 2823 1 ((𝐴 ∈ dom 𝑅1 ∧ Lim 𝐴) → (𝑅1‘𝐴) = ∪ 𝑥 ∈ 𝐴 (𝑅1‘𝑥))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2147  Vcvv 3454  ∅c0 4281  𝒫 cpw 4560  ∪ cuni 4872  ∪ ciun 4956   ↦ cmpt 5192  dom cdm 5658   “ cima 5661  Lim wlim 6389  Fun wfun 6560  ‘cfv 6566  reccrdg 8455  𝑅1cr1 9803
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-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5255  ax-nul 5266  ax-pr 5398  ax-un 7783
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 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-pss 4017  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 4841  df-uni 4873  df-iun 4958  df-br 5109  df-opab 5174  df-mpt 5193  df-tr 5219  df-id 5553  df-eprel 5558  df-po 5566  df-so 5567  df-fr 5611  df-we 5613  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-res 5670  df-ima 5671  df-pred 6330  df-ord 6391  df-on 6392  df-lim 6393  df-suc 6394  df-iota 6520  df-fun 6568  df-fn 6569  df-f 6570  df-f1 6571  df-fo 6572  df-f1o 6573  df-fv 6574  df-ov 7454  df-2nd 8036  df-frecs 8337  df-wrecs 8368  df-recs 8417  df-rdg 8456  df-r1 9805
This theorem is used by:  r1lim  9816  r1tr  9820  r1ordg  9822  r1pwss  9828  r1val1  9830
  Copyright terms: Public domain W3C validator