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 9915
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.)
Assertion
Ref Expression
pm54.43lem (𝐴 ≈ 1o𝐴 ∈ {𝑥 ∣ (card‘𝑥) = 1o})
Distinct variable group:   𝑥,𝐴

Proof of Theorem pm54.43lem
StepHypRef Expression
1 carden2b 9882 . . . 4 (𝐴 ≈ 1o → (card‘𝐴) = (card‘1o))
2 1onn 8569 . . . . 5 1o ∈ ω
3 cardnn 9878 . . . . 5 (1o ∈ ω → (card‘1o) = 1o)
42, 3ax-mp 5 . . . 4 (card‘1o) = 1o
51, 4eqtrdi 2788 . . 3 (𝐴 ≈ 1o → (card‘𝐴) = 1o)
64eqeq2i 2750 . . . . 5 ((card‘𝐴) = (card‘1o) ↔ (card‘𝐴) = 1o)
76biimpri 228 . . . 4 ((card‘𝐴) = 1o → (card‘𝐴) = (card‘1o))
8 1n0 8416 . . . . . . . 8 1o ≠ ∅
98neii 2935 . . . . . . 7 ¬ 1o = ∅
10 eqeq1 2741 . . . . . . 7 ((card‘𝐴) = 1o → ((card‘𝐴) = ∅ ↔ 1o = ∅))
119, 10mtbiri 327 . . . . . 6 ((card‘𝐴) = 1o → ¬ (card‘𝐴) = ∅)
12 ndmfv 6866 . . . . . 6 𝐴 ∈ dom card → (card‘𝐴) = ∅)
1311, 12nsyl2 141 . . . . 5 ((card‘𝐴) = 1o𝐴 ∈ dom card)
14 1on 8410 . . . . . 6 1o ∈ On
15 onenon 9864 . . . . . 6 (1o ∈ On → 1o ∈ dom card)
1614, 15ax-mp 5 . . . . 5 1o ∈ dom card
17 carden2 9902 . . . . 5 ((𝐴 ∈ dom card ∧ 1o ∈ dom card) → ((card‘𝐴) = (card‘1o) ↔ 𝐴 ≈ 1o))
1813, 16, 17sylancl 587 . . . 4 ((card‘𝐴) = 1o → ((card‘𝐴) = (card‘1o) ↔ 𝐴 ≈ 1o))
197, 18mpbid 232 . . 3 ((card‘𝐴) = 1o𝐴 ≈ 1o)
205, 19impbii 209 . 2 (𝐴 ≈ 1o ↔ (card‘𝐴) = 1o)
21 fveqeq2 6843 . . 3 (𝑥 = 𝐴 → ((card‘𝑥) = 1o ↔ (card‘𝐴) = 1o))
2213, 21elab3 3630 . 2 (𝐴 ∈ {𝑥 ∣ (card‘𝑥) = 1o} ↔ (card‘𝐴) = 1o)
2320, 22bitr4i 278 1 (𝐴 ≈ 1o𝐴 ∈ {𝑥 ∣ (card‘𝑥) = 1o})
Colors of variables: wff setvar class
Syntax hints:  wb 206   = wceq 1542  wcel 2114  {cab 2715  c0 4274   class class class wbr 5086  dom cdm 5624  Oncon0 6317  cfv 6492  ωcom 7810  1oc1o 8391  cen 8883  cardccrd 9850
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 2709  ax-sep 5231  ax-nul 5241  ax-pow 5302  ax-pr 5370  ax-un 7682
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 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-ral 3053  df-rex 3063  df-reu 3344  df-rab 3391  df-v 3432  df-sbc 3730  df-csb 3839  df-dif 3893  df-un 3895  df-in 3897  df-ss 3907  df-pss 3910  df-nul 4275  df-if 4468  df-pw 4544  df-sn 4569  df-pr 4571  df-op 4575  df-uni 4852  df-int 4891  df-br 5087  df-opab 5149  df-mpt 5168  df-tr 5194  df-id 5519  df-eprel 5524  df-po 5532  df-so 5533  df-fr 5577  df-we 5579  df-xp 5630  df-rel 5631  df-cnv 5632  df-co 5633  df-dm 5634  df-rn 5635  df-res 5636  df-ima 5637  df-ord 6320  df-on 6321  df-lim 6322  df-suc 6323  df-iota 6448  df-fun 6494  df-fn 6495  df-f 6496  df-f1 6497  df-fo 6498  df-f1o 6499  df-fv 6500  df-om 7811  df-1o 8398  df-er 8636  df-en 8887  df-dom 8888  df-sdom 8889  df-fin 8890  df-card 9854
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator