| Mathbox for BTernaryTau |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > kardcard2a | Structured version Visualization version GIF version | ||
| Description: If two sets have equal nonzero card cardinalities, then they have equal kard cardinalities. This theorem does not depend on the Axiom of Choice. (Contributed by BTernaryTau, 3-Jul-2026.) |
| Ref | Expression |
|---|---|
| kardcard2a | ⊢ (((card‘𝐴) = (card‘𝐵) ∧ (card‘𝐴) ≠ ∅) → (kard‘𝐴) = (kard‘𝐵)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | carden2a 10057 | . 2 ⊢ (((card‘𝐴) = (card‘𝐵) ∧ (card‘𝐴) ≠ ∅) → 𝐴 ≈ 𝐵) | |
| 2 | fvfundmfvn0 6933 | . . . . 5 ⊢ ((card‘𝐴) ≠ ∅ → (𝐴 ∈ dom card ∧ Fun (card ↾ {𝐴}))) | |
| 3 | 2 | simpld 500 | . . . 4 ⊢ ((card‘𝐴) ≠ ∅ → 𝐴 ∈ dom card) |
| 4 | kardeng 35896 | . . . 4 ⊢ (𝐴 ∈ dom card → ((kard‘𝐴) = (kard‘𝐵) ↔ 𝐴 ≈ 𝐵)) | |
| 5 | 3, 4 | syl 18 | . . 3 ⊢ ((card‘𝐴) ≠ ∅ → ((kard‘𝐴) = (kard‘𝐵) ↔ 𝐴 ≈ 𝐵)) |
| 6 | 5 | adantl 487 | . 2 ⊢ (((card‘𝐴) = (card‘𝐵) ∧ (card‘𝐴) ≠ ∅) → ((kard‘𝐴) = (kard‘𝐵) ↔ 𝐴 ≈ 𝐵)) |
| 7 | 1, 6 | mpbird 260 | 1 ⊢ (((card‘𝐴) = (card‘𝐵) ∧ (card‘𝐴) ≠ ∅) → (kard‘𝐴) = (kard‘𝐵)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 = wceq 1569 ∈ wcel 2146 ≠ wne 2958 ∅c0 4280 {csn 4587 class class class wbr 5105 dom cdm 5654 ↾ cres 5656 Fun wfun 6540 ‘cfv 6546 ≈ cen 8981 cardccrd 10026 kardckard 35888 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1944 ax-6 2001 ax-7 2042 ax-8 2148 ax-9 2156 ax-10 2179 ax-11 2196 ax-12 2215 ax-ext 2735 ax-rep 5234 ax-sep 5251 ax-nul 5262 ax-pow 5330 ax-pr 5394 ax-un 7758 ax-reg 9596 ax-inf2 9652 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-nf 1816 df-sb 2101 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2838 df-nfc 2912 df-ne 2959 df-ral 3080 df-rex 3090 df-reu 3369 df-rab 3416 df-v 3455 df-sbc 3742 df-csb 3851 df-ss 3900 df-pss 4016 df-dif 4049 df-in 4093 df-un 4153 df-nul 4281 df-if 4485 df-pw 4561 df-sn 4588 df-pr 4590 df-op 4838 df-uni 4870 df-int 4910 df-iun 4955 df-iin 4956 df-br 5106 df-opab 5170 df-mpt 5189 df-tr 5215 df-id 5549 df-eprel 5554 df-po 5562 df-so 5563 df-fr 5607 df-we 5609 df-xp 5660 df-rel 5661 df-cnv 5662 df-co 5663 df-dm 5664 df-rn 5665 df-res 5666 df-ima 5667 df-pred 6310 df-ord 6371 df-on 6372 df-lim 6373 df-suc 6374 df-iota 6500 df-fun 6548 df-fn 6549 df-f 6550 df-f1 6551 df-fo 6552 df-f1o 6553 df-fv 6554 df-ov 7430 df-om 7885 df-2nd 8009 df-frecs 8310 df-wrecs 8341 df-recs 8390 df-rdg 8429 df-er 8728 df-en 8985 df-r1 9778 df-rank 9779 df-scott 9939 df-card 10030 df-kard 35889 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |