Metamath Proof Explorer


Theorem onenon

Description: Every ordinal number is numerable. (Contributed by Mario Carneiro, 29-Apr-2015)

Ref Expression
Assertion onenon ⊢ A ∈ On → A ∈ dom ⁡ card

Proof

Step Hyp Ref Expression
1 enrefg ⊢ A ∈ On → A ≈ A
2 isnumi ⊢ A ∈ On ∧ A ≈ A → A ∈ dom ⁡ card
3 1 2 mpdan ⊢ A ∈ On → A ∈ dom ⁡ card