Metamath Proof Explorer


Theorem cardonle

Description: The cardinal of an ordinal number is less than or equal to the ordinal number. Proposition 10.6(3) of TakeutiZaring p. 85. (Contributed by NM, 22-Oct-2003)

Ref Expression
Assertion cardonle ⊢ A ∈ On → card ⁡ A ⊆ A

Proof

Step Hyp Ref Expression
1 oncardval ⊢ A ∈ On → card ⁡ A = ⋂ x ∈ On | x ≈ A
2 enrefg ⊢ A ∈ On → A ≈ A
3 breq1 ⊢ x = A → x ≈ A ↔ A ≈ A
4 3 intminss ⊢ A ∈ On ∧ A ≈ A → ⋂ x ∈ On | x ≈ A ⊆ A
5 2 4 mpdan ⊢ A ∈ On → ⋂ x ∈ On | x ≈ A ⊆ A
6 1 5 eqsstrd ⊢ A ∈ On → card ⁡ A ⊆ A