Metamath Proof Explorer


Theorem r1rankid

Description: Any set is a subset of the hierarchy of its rank. (Contributed by NM, 14-Oct-2003) (Revised by Mario Carneiro, 17-Nov-2014)

Ref Expression
Assertion r1rankid ⊢ A ∈ V → A ⊆ R1 ⁡ rank ⁡ A

Proof

Step Hyp Ref Expression
1 elex ⊢ A ∈ V → A ∈ V
2 unir1 ⊢ ⋃ R1 On = V
3 1 2 eleqtrrdi ⊢ A ∈ V → A ∈ ⋃ R1 On
4 r1rankidb ⊢ A ∈ ⋃ R1 On → A ⊆ R1 ⁡ rank ⁡ A
5 3 4 syl ⊢ A ∈ V → A ⊆ R1 ⁡ rank ⁡ A