Metamath Proof Explorer


Theorem r1lim

Description: Value of the cumulative hierarchy of sets function at a limit ordinal. Use r1limg (which does not require ax-rep ) when sufficient. Part of Definition 9.9 of TakeutiZaring p. 76. (Contributed by NM, 4-Oct-2003) (Revised by Mario Carneiro, 16-Nov-2014)

Ref Expression
Assertion r1lim ( ( 𝐴 ∈ 𝐵 ∧ Lim 𝐴 ) → ( 𝑅1 ‘ 𝐴 ) = ∪ 𝑥 ∈ 𝐴 ( 𝑅1 ‘ 𝑥 ) )

Proof

Step Hyp Ref Expression
1 limelon ⊢ ( ( 𝐴 ∈ 𝐵 ∧ Lim 𝐴 ) → 𝐴 ∈ On )
2 r1fnon ⊢ 𝑅1 Fn On
3 2 fndmi ⊢ dom 𝑅1 = On
4 1 3 eleqtrrdi ⊢ ( ( 𝐴 ∈ 𝐵 ∧ Lim 𝐴 ) → 𝐴 ∈ dom 𝑅1 )
5 r1limg ⊢ ( ( 𝐴 ∈ dom 𝑅1 ∧ Lim 𝐴 ) → ( 𝑅1 ‘ 𝐴 ) = ∪ 𝑥 ∈ 𝐴 ( 𝑅1 ‘ 𝑥 ) )
6 4 5 sylancom ⊢ ( ( 𝐴 ∈ 𝐵 ∧ Lim 𝐴 ) → ( 𝑅1 ‘ 𝐴 ) = ∪ 𝑥 ∈ 𝐴 ( 𝑅1 ‘ 𝑥 ) )