| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > pm54.43lem | Structured version Visualization version GIF version | ||
| Description: In Theorem *54.43 of [WhiteheadRussell] p. 360, the number 1 is defined as the collection of all sets with cardinality 1 (i.e. all singletons; see card1 9883), so that their 𝐴 ∈ 1 means, in our notation, 𝐴 ∈ {𝑥 ∣ (card‘𝑥) = 1o}. Here we show that this is equivalent to 𝐴 ≈ 1o so that we can use the latter more convenient notation in pm54.43 9916. (Contributed by NM, 4-Nov-2013.) |
| Ref | Expression |
|---|---|
| pm54.43lem | ⊢ (𝐴 ≈ 1o ↔ 𝐴 ∈ {𝑥 ∣ (card‘𝑥) = 1o}) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | carden2b 9882 | . . . 4 ⊢ (𝐴 ≈ 1o → (card‘𝐴) = (card‘1o)) | |
| 2 | 1onn 8565 | . . . . 5 ⊢ 1o ∈ ω | |
| 3 | cardnn 9878 | . . . . 5 ⊢ (1o ∈ ω → (card‘1o) = 1o) | |
| 4 | 2, 3 | ax-mp 5 | . . . 4 ⊢ (card‘1o) = 1o |
| 5 | 1, 4 | eqtrdi 2780 | . . 3 ⊢ (𝐴 ≈ 1o → (card‘𝐴) = 1o) |
| 6 | 4 | eqeq2i 2742 | . . . . 5 ⊢ ((card‘𝐴) = (card‘1o) ↔ (card‘𝐴) = 1o) |
| 7 | 6 | biimpri 228 | . . . 4 ⊢ ((card‘𝐴) = 1o → (card‘𝐴) = (card‘1o)) |
| 8 | 1n0 8413 | . . . . . . . 8 ⊢ 1o ≠ ∅ | |
| 9 | 8 | neii 2927 | . . . . . . 7 ⊢ ¬ 1o = ∅ |
| 10 | eqeq1 2733 | . . . . . . 7 ⊢ ((card‘𝐴) = 1o → ((card‘𝐴) = ∅ ↔ 1o = ∅)) | |
| 11 | 9, 10 | mtbiri 327 | . . . . . 6 ⊢ ((card‘𝐴) = 1o → ¬ (card‘𝐴) = ∅) |
| 12 | ndmfv 6859 | . . . . . 6 ⊢ (¬ 𝐴 ∈ dom card → (card‘𝐴) = ∅) | |
| 13 | 11, 12 | nsyl2 141 | . . . . 5 ⊢ ((card‘𝐴) = 1o → 𝐴 ∈ dom card) |
| 14 | 1on 8407 | . . . . . 6 ⊢ 1o ∈ On | |
| 15 | onenon 9864 | . . . . . 6 ⊢ (1o ∈ On → 1o ∈ dom card) | |
| 16 | 14, 15 | ax-mp 5 | . . . . 5 ⊢ 1o ∈ dom card |
| 17 | carden2 9902 | . . . . 5 ⊢ ((𝐴 ∈ dom card ∧ 1o ∈ dom card) → ((card‘𝐴) = (card‘1o) ↔ 𝐴 ≈ 1o)) | |
| 18 | 13, 16, 17 | sylancl 586 | . . . 4 ⊢ ((card‘𝐴) = 1o → ((card‘𝐴) = (card‘1o) ↔ 𝐴 ≈ 1o)) |
| 19 | 7, 18 | mpbid 232 | . . 3 ⊢ ((card‘𝐴) = 1o → 𝐴 ≈ 1o) |
| 20 | 5, 19 | impbii 209 | . 2 ⊢ (𝐴 ≈ 1o ↔ (card‘𝐴) = 1o) |
| 21 | fveqeq2 6835 | . . 3 ⊢ (𝑥 = 𝐴 → ((card‘𝑥) = 1o ↔ (card‘𝐴) = 1o)) | |
| 22 | 13, 21 | elab3 3644 | . 2 ⊢ (𝐴 ∈ {𝑥 ∣ (card‘𝑥) = 1o} ↔ (card‘𝐴) = 1o) |
| 23 | 20, 22 | bitr4i 278 | 1 ⊢ (𝐴 ≈ 1o ↔ 𝐴 ∈ {𝑥 ∣ (card‘𝑥) = 1o}) |
| Colors of variables: wff setvar class |
| Syntax hints: ↔ wb 206 = wceq 1540 ∈ wcel 2109 {cab 2707 ∅c0 4286 class class class wbr 5095 dom cdm 5623 Oncon0 6311 ‘cfv 6486 ωcom 7806 1oc1o 8388 ≈ cen 8876 cardccrd 9850 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-10 2142 ax-11 2158 ax-12 2178 ax-ext 2701 ax-sep 5238 ax-nul 5248 ax-pow 5307 ax-pr 5374 ax-un 7675 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2533 df-eu 2562 df-clab 2708 df-cleq 2721 df-clel 2803 df-nfc 2878 df-ne 2926 df-ral 3045 df-rex 3054 df-reu 3346 df-rab 3397 df-v 3440 df-sbc 3745 df-csb 3854 df-dif 3908 df-un 3910 df-in 3912 df-ss 3922 df-pss 3925 df-nul 4287 df-if 4479 df-pw 4555 df-sn 4580 df-pr 4582 df-op 4586 df-uni 4862 df-int 4900 df-br 5096 df-opab 5158 df-mpt 5177 df-tr 5203 df-id 5518 df-eprel 5523 df-po 5531 df-so 5532 df-fr 5576 df-we 5578 df-xp 5629 df-rel 5630 df-cnv 5631 df-co 5632 df-dm 5633 df-rn 5634 df-res 5635 df-ima 5636 df-ord 6314 df-on 6315 df-lim 6316 df-suc 6317 df-iota 6442 df-fun 6488 df-fn 6489 df-f 6490 df-f1 6491 df-fo 6492 df-f1o 6493 df-fv 6494 df-om 7807 df-1o 8395 df-er 8632 df-en 8880 df-dom 8881 df-sdom 8882 df-fin 8883 df-card 9854 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |