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

Theorem smobeth 10509
Description: The beth function is strictly monotone. This function is not strictly the beth function, but rather bethA is the same as (card‘(𝑅1‘(ω +o 𝐴))), since conventionally we start counting at the first infinite level, and ignore the finite levels. (Contributed by Mario Carneiro, 6-Jun-2013.) (Revised by Mario Carneiro, 2-Jun-2015.)
Assertion
Ref Expression
smobeth Smo (card ∘ 𝑅1)

Proof of Theorem smobeth
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 cardf2 9867 . . . . . . 7 card:{𝑥 ∣ ∃𝑦 ∈ On 𝑦𝑥}⟶On
2 ffun 6671 . . . . . . 7 (card:{𝑥 ∣ ∃𝑦 ∈ On 𝑦𝑥}⟶On → Fun card)
31, 2ax-mp 5 . . . . . 6 Fun card
4 r1fnon 9691 . . . . . . 7 𝑅1 Fn On
5 fnfun 6598 . . . . . . 7 (𝑅1 Fn On → Fun 𝑅1)
64, 5ax-mp 5 . . . . . 6 Fun 𝑅1
7 funco 6538 . . . . . 6 ((Fun card ∧ Fun 𝑅1) → Fun (card ∘ 𝑅1))
83, 6, 7mp2an 693 . . . . 5 Fun (card ∘ 𝑅1)
9 funfn 6528 . . . . 5 (Fun (card ∘ 𝑅1) ↔ (card ∘ 𝑅1) Fn dom (card ∘ 𝑅1))
108, 9mpbi 230 . . . 4 (card ∘ 𝑅1) Fn dom (card ∘ 𝑅1)
11 rnco 6216 . . . . 5 ran (card ∘ 𝑅1) = ran (card ↾ ran 𝑅1)
12 resss 5966 . . . . . . 7 (card ↾ ran 𝑅1) ⊆ card
1312rnssi 5895 . . . . . 6 ran (card ↾ ran 𝑅1) ⊆ ran card
14 frn 6675 . . . . . . 7 (card:{𝑥 ∣ ∃𝑦 ∈ On 𝑦𝑥}⟶On → ran card ⊆ On)
151, 14ax-mp 5 . . . . . 6 ran card ⊆ On
1613, 15sstri 3931 . . . . 5 ran (card ↾ ran 𝑅1) ⊆ On
1711, 16eqsstri 3968 . . . 4 ran (card ∘ 𝑅1) ⊆ On
18 df-f 6502 . . . 4 ((card ∘ 𝑅1):dom (card ∘ 𝑅1)⟶On ↔ ((card ∘ 𝑅1) Fn dom (card ∘ 𝑅1) ∧ ran (card ∘ 𝑅1) ⊆ On))
1910, 17, 18mpbir2an 712 . . 3 (card ∘ 𝑅1):dom (card ∘ 𝑅1)⟶On
20 dmco 6219 . . . 4 dom (card ∘ 𝑅1) = (𝑅1 “ dom card)
2120feq2i 6660 . . 3 ((card ∘ 𝑅1):dom (card ∘ 𝑅1)⟶On ↔ (card ∘ 𝑅1):(𝑅1 “ dom card)⟶On)
2219, 21mpbi 230 . 2 (card ∘ 𝑅1):(𝑅1 “ dom card)⟶On
23 elpreima 7010 . . . . . . . . 9 (𝑅1 Fn On → (𝑥 ∈ (𝑅1 “ dom card) ↔ (𝑥 ∈ On ∧ (𝑅1𝑥) ∈ dom card)))
244, 23ax-mp 5 . . . . . . . 8 (𝑥 ∈ (𝑅1 “ dom card) ↔ (𝑥 ∈ On ∧ (𝑅1𝑥) ∈ dom card))
2524simplbi 496 . . . . . . 7 (𝑥 ∈ (𝑅1 “ dom card) → 𝑥 ∈ On)
26 onelon 6348 . . . . . . 7 ((𝑥 ∈ On ∧ 𝑦𝑥) → 𝑦 ∈ On)
2725, 26sylan 581 . . . . . 6 ((𝑥 ∈ (𝑅1 “ dom card) ∧ 𝑦𝑥) → 𝑦 ∈ On)
2824simprbi 497 . . . . . . . 8 (𝑥 ∈ (𝑅1 “ dom card) → (𝑅1𝑥) ∈ dom card)
2928adantr 480 . . . . . . 7 ((𝑥 ∈ (𝑅1 “ dom card) ∧ 𝑦𝑥) → (𝑅1𝑥) ∈ dom card)
30 r1ord2 9705 . . . . . . . . 9 (𝑥 ∈ On → (𝑦𝑥 → (𝑅1𝑦) ⊆ (𝑅1𝑥)))
3130imp 406 . . . . . . . 8 ((𝑥 ∈ On ∧ 𝑦𝑥) → (𝑅1𝑦) ⊆ (𝑅1𝑥))
3225, 31sylan 581 . . . . . . 7 ((𝑥 ∈ (𝑅1 “ dom card) ∧ 𝑦𝑥) → (𝑅1𝑦) ⊆ (𝑅1𝑥))
33 ssnum 9961 . . . . . . 7 (((𝑅1𝑥) ∈ dom card ∧ (𝑅1𝑦) ⊆ (𝑅1𝑥)) → (𝑅1𝑦) ∈ dom card)
3429, 32, 33syl2anc 585 . . . . . 6 ((𝑥 ∈ (𝑅1 “ dom card) ∧ 𝑦𝑥) → (𝑅1𝑦) ∈ dom card)
35 elpreima 7010 . . . . . . 7 (𝑅1 Fn On → (𝑦 ∈ (𝑅1 “ dom card) ↔ (𝑦 ∈ On ∧ (𝑅1𝑦) ∈ dom card)))
364, 35ax-mp 5 . . . . . 6 (𝑦 ∈ (𝑅1 “ dom card) ↔ (𝑦 ∈ On ∧ (𝑅1𝑦) ∈ dom card))
3727, 34, 36sylanbrc 584 . . . . 5 ((𝑥 ∈ (𝑅1 “ dom card) ∧ 𝑦𝑥) → 𝑦 ∈ (𝑅1 “ dom card))
3837rgen2 3177 . . . 4 𝑥 ∈ (𝑅1 “ dom card)∀𝑦𝑥 𝑦 ∈ (𝑅1 “ dom card)
39 dftr5 5196 . . . 4 (Tr (𝑅1 “ dom card) ↔ ∀𝑥 ∈ (𝑅1 “ dom card)∀𝑦𝑥 𝑦 ∈ (𝑅1 “ dom card))
4038, 39mpbir 231 . . 3 Tr (𝑅1 “ dom card)
41 cnvimass 6047 . . . . 5 (𝑅1 “ dom card) ⊆ dom 𝑅1
42 dffn2 6670 . . . . . . 7 (𝑅1 Fn On ↔ 𝑅1:On⟶V)
434, 42mpbi 230 . . . . . 6 𝑅1:On⟶V
4443fdmi 6679 . . . . 5 dom 𝑅1 = On
4541, 44sseqtri 3970 . . . 4 (𝑅1 “ dom card) ⊆ On
46 epweon 7729 . . . 4 E We On
47 wess 5617 . . . 4 ((𝑅1 “ dom card) ⊆ On → ( E We On → E We (𝑅1 “ dom card)))
4845, 46, 47mp2 9 . . 3 E We (𝑅1 “ dom card)
49 df-ord 6326 . . 3 (Ord (𝑅1 “ dom card) ↔ (Tr (𝑅1 “ dom card) ∧ E We (𝑅1 “ dom card)))
5040, 48, 49mpbir2an 712 . 2 Ord (𝑅1 “ dom card)
51 r1sdom 9698 . . . . . . 7 ((𝑥 ∈ On ∧ 𝑦𝑥) → (𝑅1𝑦) ≺ (𝑅1𝑥))
5225, 51sylan 581 . . . . . 6 ((𝑥 ∈ (𝑅1 “ dom card) ∧ 𝑦𝑥) → (𝑅1𝑦) ≺ (𝑅1𝑥))
53 cardsdom2 9912 . . . . . . 7 (((𝑅1𝑦) ∈ dom card ∧ (𝑅1𝑥) ∈ dom card) → ((card‘(𝑅1𝑦)) ∈ (card‘(𝑅1𝑥)) ↔ (𝑅1𝑦) ≺ (𝑅1𝑥)))
5434, 29, 53syl2anc 585 . . . . . 6 ((𝑥 ∈ (𝑅1 “ dom card) ∧ 𝑦𝑥) → ((card‘(𝑅1𝑦)) ∈ (card‘(𝑅1𝑥)) ↔ (𝑅1𝑦) ≺ (𝑅1𝑥)))
5552, 54mpbird 257 . . . . 5 ((𝑥 ∈ (𝑅1 “ dom card) ∧ 𝑦𝑥) → (card‘(𝑅1𝑦)) ∈ (card‘(𝑅1𝑥)))
56 fvco2 6937 . . . . . 6 ((𝑅1 Fn On ∧ 𝑦 ∈ On) → ((card ∘ 𝑅1)‘𝑦) = (card‘(𝑅1𝑦)))
574, 27, 56sylancr 588 . . . . 5 ((𝑥 ∈ (𝑅1 “ dom card) ∧ 𝑦𝑥) → ((card ∘ 𝑅1)‘𝑦) = (card‘(𝑅1𝑦)))
5825adantr 480 . . . . . 6 ((𝑥 ∈ (𝑅1 “ dom card) ∧ 𝑦𝑥) → 𝑥 ∈ On)
59 fvco2 6937 . . . . . 6 ((𝑅1 Fn On ∧ 𝑥 ∈ On) → ((card ∘ 𝑅1)‘𝑥) = (card‘(𝑅1𝑥)))
604, 58, 59sylancr 588 . . . . 5 ((𝑥 ∈ (𝑅1 “ dom card) ∧ 𝑦𝑥) → ((card ∘ 𝑅1)‘𝑥) = (card‘(𝑅1𝑥)))
6155, 57, 603eltr4d 2851 . . . 4 ((𝑥 ∈ (𝑅1 “ dom card) ∧ 𝑦𝑥) → ((card ∘ 𝑅1)‘𝑦) ∈ ((card ∘ 𝑅1)‘𝑥))
6261ex 412 . . 3 (𝑥 ∈ (𝑅1 “ dom card) → (𝑦𝑥 → ((card ∘ 𝑅1)‘𝑦) ∈ ((card ∘ 𝑅1)‘𝑥)))
6362adantl 481 . 2 ((𝑦 ∈ (𝑅1 “ dom card) ∧ 𝑥 ∈ (𝑅1 “ dom card)) → (𝑦𝑥 → ((card ∘ 𝑅1)‘𝑦) ∈ ((card ∘ 𝑅1)‘𝑥)))
6422, 50, 63, 20issmo 8288 1 Smo (card ∘ 𝑅1)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wa 395   = wceq 1542  wcel 2114  {cab 2714  wral 3051  wrex 3061  Vcvv 3429  wss 3889   class class class wbr 5085  Tr wtr 5192   E cep 5530   We wwe 5583  ccnv 5630  dom cdm 5631  ran crn 5632  cres 5633  cima 5634  ccom 5635  Ord word 6322  Oncon0 6323  Fun wfun 6492   Fn wfn 6493  wf 6494  cfv 6498  Smo wsmo 8285  cen 8890  csdm 8892  𝑅1cr1 9686  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-rep 5212  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-rmo 3342  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-iun 4935  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-se 5585  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-pred 6265  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-isom 6507  df-riota 7324  df-ov 7370  df-om 7818  df-2nd 7943  df-frecs 8231  df-wrecs 8262  df-smo 8286  df-recs 8311  df-rdg 8349  df-er 8643  df-en 8894  df-dom 8895  df-sdom 8896  df-r1 9688  df-card 9863
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator