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

Theorem iscard2 9391
 Description: Two ways to express the property of being a cardinal number. Definition 8 of [Suppes] p. 225. (Contributed by Mario Carneiro, 15-Jan-2013.)
Assertion
Ref Expression
iscard2 ((card‘𝐴) = 𝐴 ↔ (𝐴 ∈ On ∧ ∀𝑥 ∈ On (𝐴𝑥𝐴𝑥)))
Distinct variable group:   𝑥,𝐴

Proof of Theorem iscard2
Dummy variable 𝑦 is distinct from all other variables.
StepHypRef Expression
1 cardon 9359 . . 3 (card‘𝐴) ∈ On
2 eleq1 2877 . . 3 ((card‘𝐴) = 𝐴 → ((card‘𝐴) ∈ On ↔ 𝐴 ∈ On))
31, 2mpbii 236 . 2 ((card‘𝐴) = 𝐴𝐴 ∈ On)
4 eqss 3930 . . . . 5 ((card‘𝐴) = 𝐴 ↔ ((card‘𝐴) ⊆ 𝐴𝐴 ⊆ (card‘𝐴)))
5 cardonle 9372 . . . . . 6 (𝐴 ∈ On → (card‘𝐴) ⊆ 𝐴)
65biantrurd 536 . . . . 5 (𝐴 ∈ On → (𝐴 ⊆ (card‘𝐴) ↔ ((card‘𝐴) ⊆ 𝐴𝐴 ⊆ (card‘𝐴))))
74, 6bitr4id 293 . . . 4 (𝐴 ∈ On → ((card‘𝐴) = 𝐴𝐴 ⊆ (card‘𝐴)))
8 oncardval 9370 . . . . 5 (𝐴 ∈ On → (card‘𝐴) = {𝑦 ∈ On ∣ 𝑦𝐴})
98sseq2d 3947 . . . 4 (𝐴 ∈ On → (𝐴 ⊆ (card‘𝐴) ↔ 𝐴 {𝑦 ∈ On ∣ 𝑦𝐴}))
107, 9bitrd 282 . . 3 (𝐴 ∈ On → ((card‘𝐴) = 𝐴𝐴 {𝑦 ∈ On ∣ 𝑦𝐴}))
11 ssint 4854 . . . 4 (𝐴 {𝑦 ∈ On ∣ 𝑦𝐴} ↔ ∀𝑥 ∈ {𝑦 ∈ On ∣ 𝑦𝐴}𝐴𝑥)
12 breq1 5033 . . . . . . . . 9 (𝑦 = 𝑥 → (𝑦𝐴𝑥𝐴))
1312elrab 3628 . . . . . . . 8 (𝑥 ∈ {𝑦 ∈ On ∣ 𝑦𝐴} ↔ (𝑥 ∈ On ∧ 𝑥𝐴))
14 ensymb 8542 . . . . . . . . 9 (𝑥𝐴𝐴𝑥)
1514anbi2i 625 . . . . . . . 8 ((𝑥 ∈ On ∧ 𝑥𝐴) ↔ (𝑥 ∈ On ∧ 𝐴𝑥))
1613, 15bitri 278 . . . . . . 7 (𝑥 ∈ {𝑦 ∈ On ∣ 𝑦𝐴} ↔ (𝑥 ∈ On ∧ 𝐴𝑥))
1716imbi1i 353 . . . . . 6 ((𝑥 ∈ {𝑦 ∈ On ∣ 𝑦𝐴} → 𝐴𝑥) ↔ ((𝑥 ∈ On ∧ 𝐴𝑥) → 𝐴𝑥))
18 impexp 454 . . . . . 6 (((𝑥 ∈ On ∧ 𝐴𝑥) → 𝐴𝑥) ↔ (𝑥 ∈ On → (𝐴𝑥𝐴𝑥)))
1917, 18bitri 278 . . . . 5 ((𝑥 ∈ {𝑦 ∈ On ∣ 𝑦𝐴} → 𝐴𝑥) ↔ (𝑥 ∈ On → (𝐴𝑥𝐴𝑥)))
2019ralbii2 3131 . . . 4 (∀𝑥 ∈ {𝑦 ∈ On ∣ 𝑦𝐴}𝐴𝑥 ↔ ∀𝑥 ∈ On (𝐴𝑥𝐴𝑥))
2111, 20bitri 278 . . 3 (𝐴 {𝑦 ∈ On ∣ 𝑦𝐴} ↔ ∀𝑥 ∈ On (𝐴𝑥𝐴𝑥))
2210, 21syl6bb 290 . 2 (𝐴 ∈ On → ((card‘𝐴) = 𝐴 ↔ ∀𝑥 ∈ On (𝐴𝑥𝐴𝑥)))
233, 22biadanii 821 1 ((card‘𝐴) = 𝐴 ↔ (𝐴 ∈ On ∧ ∀𝑥 ∈ On (𝐴𝑥𝐴𝑥)))
 Colors of variables: wff setvar class Syntax hints:   → wi 4   ↔ wb 209   ∧ wa 399   = wceq 1538   ∈ wcel 2111  ∀wral 3106  {crab 3110   ⊆ wss 3881  ∩ cint 4838   class class class wbr 5030  Oncon0 6159  ‘cfv 6324   ≈ cen 8491  cardccrd 9350 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 1911  ax-6 1970  ax-7 2015  ax-8 2113  ax-9 2121  ax-10 2142  ax-11 2158  ax-12 2175  ax-ext 2770  ax-sep 5167  ax-nul 5174  ax-pow 5231  ax-pr 5295  ax-un 7443 This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-3or 1085  df-3an 1086  df-tru 1541  df-ex 1782  df-nf 1786  df-sb 2070  df-mo 2598  df-eu 2629  df-clab 2777  df-cleq 2791  df-clel 2870  df-nfc 2938  df-ne 2988  df-ral 3111  df-rex 3112  df-rab 3115  df-v 3443  df-sbc 3721  df-dif 3884  df-un 3886  df-in 3888  df-ss 3898  df-pss 3900  df-nul 4244  df-if 4426  df-pw 4499  df-sn 4526  df-pr 4528  df-tp 4530  df-op 4532  df-uni 4801  df-int 4839  df-br 5031  df-opab 5093  df-mpt 5111  df-tr 5137  df-id 5425  df-eprel 5430  df-po 5438  df-so 5439  df-fr 5478  df-we 5480  df-xp 5525  df-rel 5526  df-cnv 5527  df-co 5528  df-dm 5529  df-rn 5530  df-res 5531  df-ima 5532  df-ord 6162  df-on 6163  df-iota 6283  df-fun 6326  df-fn 6327  df-f 6328  df-f1 6329  df-fo 6330  df-f1o 6331  df-fv 6332  df-er 8274  df-en 8495  df-card 9354 This theorem is referenced by:  harcard  9393
 Copyright terms: Public domain W3C validator