| 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 9892), 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 9925. (Contributed by NM, 4-Nov-2013.) |
| Ref | Expression |
|---|---|
| pm54.43lem | ⊢ (𝐴 ≈ 1o ↔ 𝐴 ∈ {𝑥 ∣ (card‘𝑥) = 1o}) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | carden2b 9891 | . . . 4 ⊢ (𝐴 ≈ 1o → (card‘𝐴) = (card‘1o)) | |
| 2 | 1onn 8576 | . . . . 5 ⊢ 1o ∈ ω | |
| 3 | cardnn 9887 | . . . . 5 ⊢ (1o ∈ ω → (card‘1o) = 1o) | |
| 4 | 2, 3 | ax-mp 5 | . . . 4 ⊢ (card‘1o) = 1o |
| 5 | 1, 4 | eqtrdi 2787 | . . 3 ⊢ (𝐴 ≈ 1o → (card‘𝐴) = 1o) |
| 6 | 4 | eqeq2i 2749 | . . . . 5 ⊢ ((card‘𝐴) = (card‘1o) ↔ (card‘𝐴) = 1o) |
| 7 | 6 | biimpri 228 | . . . 4 ⊢ ((card‘𝐴) = 1o → (card‘𝐴) = (card‘1o)) |
| 8 | 1n0 8423 | . . . . . . . 8 ⊢ 1o ≠ ∅ | |
| 9 | 8 | neii 2934 | . . . . . . 7 ⊢ ¬ 1o = ∅ |
| 10 | eqeq1 2740 | . . . . . . 7 ⊢ ((card‘𝐴) = 1o → ((card‘𝐴) = ∅ ↔ 1o = ∅)) | |
| 11 | 9, 10 | mtbiri 327 | . . . . . 6 ⊢ ((card‘𝐴) = 1o → ¬ (card‘𝐴) = ∅) |
| 12 | ndmfv 6872 | . . . . . 6 ⊢ (¬ 𝐴 ∈ dom card → (card‘𝐴) = ∅) | |
| 13 | 11, 12 | nsyl2 141 | . . . . 5 ⊢ ((card‘𝐴) = 1o → 𝐴 ∈ dom card) |
| 14 | 1on 8417 | . . . . . 6 ⊢ 1o ∈ On | |
| 15 | onenon 9873 | . . . . . 6 ⊢ (1o ∈ On → 1o ∈ dom card) | |
| 16 | 14, 15 | ax-mp 5 | . . . . 5 ⊢ 1o ∈ dom card |
| 17 | carden2 9911 | . . . . 5 ⊢ ((𝐴 ∈ dom card ∧ 1o ∈ dom card) → ((card‘𝐴) = (card‘1o) ↔ 𝐴 ≈ 1o)) | |
| 18 | 13, 16, 17 | sylancl 587 | . . . 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 6849 | . . 3 ⊢ (𝑥 = 𝐴 → ((card‘𝑥) = 1o ↔ (card‘𝐴) = 1o)) | |
| 22 | 13, 21 | elab3 3629 | . 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 1542 ∈ wcel 2114 {cab 2714 ∅c0 4273 class class class wbr 5085 dom cdm 5631 Oncon0 6323 ‘cfv 6498 ωcom 7817 1oc1o 8398 ≈ cen 8890 cardccrd 9859 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2708 ax-sep 5231 ax-nul 5241 ax-pow 5307 ax-pr 5375 ax-un 7689 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2539 df-eu 2569 df-clab 2715 df-cleq 2728 df-clel 2811 df-nfc 2885 df-ne 2933 df-ral 3052 df-rex 3062 df-reu 3343 df-rab 3390 df-v 3431 df-sbc 3729 df-csb 3838 df-dif 3892 df-un 3894 df-in 3896 df-ss 3906 df-pss 3909 df-nul 4274 df-if 4467 df-pw 4543 df-sn 4568 df-pr 4570 df-op 4574 df-uni 4851 df-int 4890 df-br 5086 df-opab 5148 df-mpt 5167 df-tr 5193 df-id 5526 df-eprel 5531 df-po 5539 df-so 5540 df-fr 5584 df-we 5586 df-xp 5637 df-rel 5638 df-cnv 5639 df-co 5640 df-dm 5641 df-rn 5642 df-res 5643 df-ima 5644 df-ord 6326 df-on 6327 df-lim 6328 df-suc 6329 df-iota 6454 df-fun 6500 df-fn 6501 df-f 6502 df-f1 6503 df-fo 6504 df-f1o 6505 df-fv 6506 df-om 7818 df-1o 8405 df-er 8643 df-en 8894 df-dom 8895 df-sdom 8896 df-fin 8897 df-card 9863 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |