MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  pm54.43lem Structured version   Visualization version   GIF version

Theorem pm54.43lem 9960
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 9928), 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 9961. (Contributed by NM, 4-Nov-2013.)
Assertion
Ref Expression
pm54.43lem (𝐴 ≈ 1o𝐴 ∈ {𝑥 ∣ (card‘𝑥) = 1o})
Distinct variable group:   𝑥,𝐴

Proof of Theorem pm54.43lem
StepHypRef Expression
1 carden2b 9927 . . . 4 (𝐴 ≈ 1o → (card‘𝐴) = (card‘1o))
2 1onn 8607 . . . . 5 1o ∈ ω
3 cardnn 9923 . . . . 5 (1o ∈ ω → (card‘1o) = 1o)
42, 3ax-mp 5 . . . 4 (card‘1o) = 1o
51, 4eqtrdi 2781 . . 3 (𝐴 ≈ 1o → (card‘𝐴) = 1o)
64eqeq2i 2743 . . . . 5 ((card‘𝐴) = (card‘1o) ↔ (card‘𝐴) = 1o)
76biimpri 228 . . . 4 ((card‘𝐴) = 1o → (card‘𝐴) = (card‘1o))
8 1n0 8455 . . . . . . . 8 1o ≠ ∅
98neii 2928 . . . . . . 7 ¬ 1o = ∅
10 eqeq1 2734 . . . . . . 7 ((card‘𝐴) = 1o → ((card‘𝐴) = ∅ ↔ 1o = ∅))
119, 10mtbiri 327 . . . . . 6 ((card‘𝐴) = 1o → ¬ (card‘𝐴) = ∅)
12 ndmfv 6896 . . . . . 6 𝐴 ∈ dom card → (card‘𝐴) = ∅)
1311, 12nsyl2 141 . . . . 5 ((card‘𝐴) = 1o𝐴 ∈ dom card)
14 1on 8449 . . . . . 6 1o ∈ On
15 onenon 9909 . . . . . 6 (1o ∈ On → 1o ∈ dom card)
1614, 15ax-mp 5 . . . . 5 1o ∈ dom card
17 carden2 9947 . . . . 5 ((𝐴 ∈ dom card ∧ 1o ∈ dom card) → ((card‘𝐴) = (card‘1o) ↔ 𝐴 ≈ 1o))
1813, 16, 17sylancl 586 . . . 4 ((card‘𝐴) = 1o → ((card‘𝐴) = (card‘1o) ↔ 𝐴 ≈ 1o))
197, 18mpbid 232 . . 3 ((card‘𝐴) = 1o𝐴 ≈ 1o)
205, 19impbii 209 . 2 (𝐴 ≈ 1o ↔ (card‘𝐴) = 1o)
21 fveqeq2 6870 . . 3 (𝑥 = 𝐴 → ((card‘𝑥) = 1o ↔ (card‘𝐴) = 1o))
2213, 21elab3 3656 . 2 (𝐴 ∈ {𝑥 ∣ (card‘𝑥) = 1o} ↔ (card‘𝐴) = 1o)
2320, 22bitr4i 278 1 (𝐴 ≈ 1o𝐴 ∈ {𝑥 ∣ (card‘𝑥) = 1o})
Colors of variables: wff setvar class
Syntax hints:  wb 206   = wceq 1540  wcel 2109  {cab 2708  c0 4299   class class class wbr 5110  dom cdm 5641  Oncon0 6335  cfv 6514  ωcom 7845  1oc1o 8430  cen 8918  cardccrd 9895
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 2702  ax-sep 5254  ax-nul 5264  ax-pow 5323  ax-pr 5390  ax-un 7714
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 2534  df-eu 2563  df-clab 2709  df-cleq 2722  df-clel 2804  df-nfc 2879  df-ne 2927  df-ral 3046  df-rex 3055  df-reu 3357  df-rab 3409  df-v 3452  df-sbc 3757  df-csb 3866  df-dif 3920  df-un 3922  df-in 3924  df-ss 3934  df-pss 3937  df-nul 4300  df-if 4492  df-pw 4568  df-sn 4593  df-pr 4595  df-op 4599  df-uni 4875  df-int 4914  df-br 5111  df-opab 5173  df-mpt 5192  df-tr 5218  df-id 5536  df-eprel 5541  df-po 5549  df-so 5550  df-fr 5594  df-we 5596  df-xp 5647  df-rel 5648  df-cnv 5649  df-co 5650  df-dm 5651  df-rn 5652  df-res 5653  df-ima 5654  df-ord 6338  df-on 6339  df-lim 6340  df-suc 6341  df-iota 6467  df-fun 6516  df-fn 6517  df-f 6518  df-f1 6519  df-fo 6520  df-f1o 6521  df-fv 6522  df-om 7846  df-1o 8437  df-er 8674  df-en 8922  df-dom 8923  df-sdom 8924  df-fin 8925  df-card 9899
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator