Metamath Proof Explorer


Theorem ackardcard

Description: The Axiom of Choice implies that two sets have equal kard cardinalities iff they have equal card cardinalities. (Contributed by BTernaryTau, 3-Jul-2026)

Ref Expression
Assertion ackardcard Could not format assertion : No typesetting found for |- ( CHOICE -> ( ( A e. V /\ B e. W ) -> ( ( kard ` A ) = ( kard ` B ) <-> ( card ` A ) = ( card ` B ) ) ) ) with typecode |-

Proof

Step Hyp Ref Expression
1 acnum ⊢ CHOICE → A ∈ V → A ∈ dom ⁡ card
2 acnum ⊢ CHOICE → B ∈ W → B ∈ dom ⁡ card
3 1 2 anim12d ⊢ CHOICE → A ∈ V ∧ B ∈ W → A ∈ dom ⁡ card ∧ B ∈ dom ⁡ card
4 kardcard2 Could not format ( ( A e. dom card /\ B e. dom card ) -> ( ( kard ` A ) = ( kard ` B ) <-> ( card ` A ) = ( card ` B ) ) ) : No typesetting found for |- ( ( A e. dom card /\ B e. dom card ) -> ( ( kard ` A ) = ( kard ` B ) <-> ( card ` A ) = ( card ` B ) ) ) with typecode |-
5 3 4 syl6 Could not format ( CHOICE -> ( ( A e. V /\ B e. W ) -> ( ( kard ` A ) = ( kard ` B ) <-> ( card ` A ) = ( card ` B ) ) ) ) : No typesetting found for |- ( CHOICE -> ( ( A e. V /\ B e. W ) -> ( ( kard ` A ) = ( kard ` B ) <-> ( card ` A ) = ( card ` B ) ) ) ) with typecode |-