Metamath Proof Explorer


Theorem rncardr1prc

Description: The Axiom of Choice implies that the cardinalities of the layers of the cumulative hierarchy form a proper class. (Contributed by BTernaryTau, 2-Jul-2026)

Ref Expression
Assertion rncardr1prc ⊢ CHOICE → ¬ ran ⁡ card ∘ R1 ∈ V

Proof

Step Hyp Ref Expression
1 onprc ⊢ ¬ On ∈ V
2 dfac10 ⊢ CHOICE ↔ dom ⁡ card = V
3 df-card ⊢ card = x ∈ V ⟼ ⋂ y ∈ On | y ≈ x
4 3 funmpt2 ⊢ Fun ⁡ card
5 df-fn ⊢ card Fn V ↔ Fun ⁡ card ∧ dom ⁡ card = V
6 4 5 mpbiran ⊢ card Fn V ↔ dom ⁡ card = V
7 2 6 sylbb2 ⊢ CHOICE → card Fn V
8 r111 ⊢ R1 : On ⟶ 1-1 V
9 f1f ⊢ R1 : On ⟶ 1-1 V → R1 : On ⟶ V
10 8 9 ax-mp ⊢ R1 : On ⟶ V
11 fnfco ⊢ card Fn V ∧ R1 : On ⟶ V → card ∘ R1 Fn On
12 7 10 11 sylancl ⊢ CHOICE → card ∘ R1 Fn On
13 dffn3 ⊢ card ∘ R1 Fn On ↔ card ∘ R1 : On ⟶ ran ⁡ card ∘ R1
14 12 13 sylib ⊢ CHOICE → card ∘ R1 : On ⟶ ran ⁡ card ∘ R1
15 smobeth ⊢ Smo ⁡ card ∘ R1
16 smo11 ⊢ card ∘ R1 : On ⟶ ran ⁡ card ∘ R1 ∧ Smo ⁡ card ∘ R1 → card ∘ R1 : On ⟶ 1-1 ran ⁡ card ∘ R1
17 15 16 mpan2 ⊢ card ∘ R1 : On ⟶ ran ⁡ card ∘ R1 → card ∘ R1 : On ⟶ 1-1 ran ⁡ card ∘ R1
18 f1dmex ⊢ card ∘ R1 : On ⟶ 1-1 ran ⁡ card ∘ R1 ∧ ran ⁡ card ∘ R1 ∈ V → On ∈ V
19 18 ex ⊢ card ∘ R1 : On ⟶ 1-1 ran ⁡ card ∘ R1 → ran ⁡ card ∘ R1 ∈ V → On ∈ V
20 14 17 19 3syl ⊢ CHOICE → ran ⁡ card ∘ R1 ∈ V → On ∈ V
21 1 20 mtoi ⊢ CHOICE → ¬ ran ⁡ card ∘ R1 ∈ V