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

Theorem iscard2 8685
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 8653 . . 3 (card‘𝐴) ∈ On
2 eleq1 2676 . . 3 ((card‘𝐴) = 𝐴 → ((card‘𝐴) ∈ On ↔ 𝐴 ∈ On))
31, 2mpbii 222 . 2 ((card‘𝐴) = 𝐴𝐴 ∈ On)
4 cardonle 8666 . . . . . 6 (𝐴 ∈ On → (card‘𝐴) ⊆ 𝐴)
54biantrurd 528 . . . . 5 (𝐴 ∈ On → (𝐴 ⊆ (card‘𝐴) ↔ ((card‘𝐴) ⊆ 𝐴𝐴 ⊆ (card‘𝐴))))
6 eqss 3583 . . . . 5 ((card‘𝐴) = 𝐴 ↔ ((card‘𝐴) ⊆ 𝐴𝐴 ⊆ (card‘𝐴)))
75, 6syl6rbbr 278 . . . 4 (𝐴 ∈ On → ((card‘𝐴) = 𝐴𝐴 ⊆ (card‘𝐴)))
8 oncardval 8664 . . . . 5 (𝐴 ∈ On → (card‘𝐴) = {𝑦 ∈ On ∣ 𝑦𝐴})
98sseq2d 3596 . . . 4 (𝐴 ∈ On → (𝐴 ⊆ (card‘𝐴) ↔ 𝐴 {𝑦 ∈ On ∣ 𝑦𝐴}))
107, 9bitrd 267 . . 3 (𝐴 ∈ On → ((card‘𝐴) = 𝐴𝐴 {𝑦 ∈ On ∣ 𝑦𝐴}))
11 ssint 4428 . . . 4 (𝐴 {𝑦 ∈ On ∣ 𝑦𝐴} ↔ ∀𝑥 ∈ {𝑦 ∈ On ∣ 𝑦𝐴}𝐴𝑥)
12 breq1 4586 . . . . . . . . 9 (𝑦 = 𝑥 → (𝑦𝐴𝑥𝐴))
1312elrab 3331 . . . . . . . 8 (𝑥 ∈ {𝑦 ∈ On ∣ 𝑦𝐴} ↔ (𝑥 ∈ On ∧ 𝑥𝐴))
14 ensymb 7890 . . . . . . . . 9 (𝑥𝐴𝐴𝑥)
1514anbi2i 726 . . . . . . . 8 ((𝑥 ∈ On ∧ 𝑥𝐴) ↔ (𝑥 ∈ On ∧ 𝐴𝑥))
1613, 15bitri 263 . . . . . . 7 (𝑥 ∈ {𝑦 ∈ On ∣ 𝑦𝐴} ↔ (𝑥 ∈ On ∧ 𝐴𝑥))
1716imbi1i 338 . . . . . 6 ((𝑥 ∈ {𝑦 ∈ On ∣ 𝑦𝐴} → 𝐴𝑥) ↔ ((𝑥 ∈ On ∧ 𝐴𝑥) → 𝐴𝑥))
18 impexp 461 . . . . . 6 (((𝑥 ∈ On ∧ 𝐴𝑥) → 𝐴𝑥) ↔ (𝑥 ∈ On → (𝐴𝑥𝐴𝑥)))
1917, 18bitri 263 . . . . 5 ((𝑥 ∈ {𝑦 ∈ On ∣ 𝑦𝐴} → 𝐴𝑥) ↔ (𝑥 ∈ On → (𝐴𝑥𝐴𝑥)))
2019ralbii2 2961 . . . 4 (∀𝑥 ∈ {𝑦 ∈ On ∣ 𝑦𝐴}𝐴𝑥 ↔ ∀𝑥 ∈ On (𝐴𝑥𝐴𝑥))
2111, 20bitri 263 . . 3 (𝐴 {𝑦 ∈ On ∣ 𝑦𝐴} ↔ ∀𝑥 ∈ On (𝐴𝑥𝐴𝑥))
2210, 21syl6bb 275 . 2 (𝐴 ∈ On → ((card‘𝐴) = 𝐴 ↔ ∀𝑥 ∈ On (𝐴𝑥𝐴𝑥)))
233, 22biadan2 672 1 ((card‘𝐴) = 𝐴 ↔ (𝐴 ∈ On ∧ ∀𝑥 ∈ On (𝐴𝑥𝐴𝑥)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 195  wa 383   = wceq 1475  wcel 1977  wral 2896  {crab 2900  wss 3540   cint 4410   class class class wbr 4583  Oncon0 5640  cfv 5804  cen 7838  cardccrd 8644
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1713  ax-4 1728  ax-5 1827  ax-6 1875  ax-7 1922  ax-8 1979  ax-9 1986  ax-10 2006  ax-11 2021  ax-12 2034  ax-13 2234  ax-ext 2590  ax-sep 4709  ax-nul 4717  ax-pow 4769  ax-pr 4833  ax-un 6847
This theorem depends on definitions:  df-bi 196  df-or 384  df-an 385  df-3or 1032  df-3an 1033  df-tru 1478  df-ex 1696  df-nf 1701  df-sb 1868  df-eu 2462  df-mo 2463  df-clab 2597  df-cleq 2603  df-clel 2606  df-nfc 2740  df-ne 2782  df-ral 2901  df-rex 2902  df-rab 2905  df-v 3175  df-sbc 3403  df-dif 3543  df-un 3545  df-in 3547  df-ss 3554  df-pss 3556  df-nul 3875  df-if 4037  df-pw 4110  df-sn 4126  df-pr 4128  df-tp 4130  df-op 4132  df-uni 4373  df-int 4411  df-br 4584  df-opab 4644  df-mpt 4645  df-tr 4681  df-eprel 4949  df-id 4953  df-po 4959  df-so 4960  df-fr 4997  df-we 4999  df-xp 5044  df-rel 5045  df-cnv 5046  df-co 5047  df-dm 5048  df-rn 5049  df-res 5050  df-ima 5051  df-ord 5643  df-on 5644  df-iota 5768  df-fun 5806  df-fn 5807  df-f 5808  df-f1 5809  df-fo 5810  df-f1o 5811  df-fv 5812  df-er 7629  df-en 7842  df-card 8648
This theorem is referenced by:  harcard  8687
  Copyright terms: Public domain W3C validator