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

Theorem smobeth 10567
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 9925 . . . . . . 7 card:{𝑥 ∣ ∃𝑦 ∈ On 𝑦𝑥}⟶On
2 ffun 6706 . . . . . . 7 (card:{𝑥 ∣ ∃𝑦 ∈ On 𝑦𝑥}⟶On → Fun card)
31, 2ax-mp 5 . . . . . 6 Fun card
4 r1fnon 9735 . . . . . . 7 𝑅1 Fn On
5 fnfun 6633 . . . . . . 7 (𝑅1 Fn On → Fun 𝑅1)
64, 5ax-mp 5 . . . . . 6 Fun 𝑅1
7 funco 6573 . . . . . 6 ((Fun card ∧ Fun 𝑅1) → Fun (card ∘ 𝑅1))
83, 6, 7mp2an 704 . . . . 5 Fun (card ∘ 𝑅1)
9 funfn 6563 . . . . 5 (Fun (card ∘ 𝑅1) ↔ (card ∘ 𝑅1) Fn dom (card ∘ 𝑅1))
108, 9mpbi 233 . . . 4 (card ∘ 𝑅1) Fn dom (card ∘ 𝑅1)
11 rnco 6250 . . . . 5 ran (card ∘ 𝑅1) = ran (card ↾ ran 𝑅1)
12 resss 5998 . . . . . . 7 (card ↾ ran 𝑅1) ⊆ card
1312rnssi 5928 . . . . . 6 ran (card ↾ ran 𝑅1) ⊆ ran card
14 frn 6711 . . . . . . 7 (card:{𝑥 ∣ ∃𝑦 ∈ On 𝑦𝑥}⟶On → ran card ⊆ On)
151, 14ax-mp 5 . . . . . 6 ran card ⊆ On
1613, 15sstri 3954 . . . . 5 ran (card ↾ ran 𝑅1) ⊆ On
1711, 16eqsstri 3991 . . . 4 ran (card ∘ 𝑅1) ⊆ On
18 df-f 6537 . . . 4 ((card ∘ 𝑅1):dom (card ∘ 𝑅1)⟶On ↔ ((card ∘ 𝑅1) Fn dom (card ∘ 𝑅1) ∧ ran (card ∘ 𝑅1) ⊆ On))
1910, 17, 18mpbir2an 723 . . 3 (card ∘ 𝑅1):dom (card ∘ 𝑅1)⟶On
20 dmco 6253 . . . 4 dom (card ∘ 𝑅1) = (𝑅1 “ dom card)
2120feq2i 6695 . . 3 ((card ∘ 𝑅1):dom (card ∘ 𝑅1)⟶On ↔ (card ∘ 𝑅1):(𝑅1 “ dom card)⟶On)
2219, 21mpbi 233 . 2 (card ∘ 𝑅1):(𝑅1 “ dom card)⟶On
23 elpreima 7051 . . . . . . . . 9 (𝑅1 Fn On → (𝑥 ∈ (𝑅1 “ dom card) ↔ (𝑥 ∈ On ∧ (𝑅1𝑥) ∈ dom card)))
244, 23ax-mp 5 . . . . . . . 8 (𝑥 ∈ (𝑅1 “ dom card) ↔ (𝑥 ∈ On ∧ (𝑅1𝑥) ∈ dom card))
2524simplbi 501 . . . . . . 7 (𝑥 ∈ (𝑅1 “ dom card) → 𝑥 ∈ On)
26 onelon 6382 . . . . . . 7 ((𝑥 ∈ On ∧ 𝑦𝑥) → 𝑦 ∈ On)
2725, 26sylan 591 . . . . . 6 ((𝑥 ∈ (𝑅1 “ dom card) ∧ 𝑦𝑥) → 𝑦 ∈ On)
2824simprbi 502 . . . . . . . 8 (𝑥 ∈ (𝑅1 “ dom card) → (𝑅1𝑥) ∈ dom card)
2928adantr 485 . . . . . . 7 ((𝑥 ∈ (𝑅1 “ dom card) ∧ 𝑦𝑥) → (𝑅1𝑥) ∈ dom card)
30 r1ord2 9749 . . . . . . . . 9 (𝑥 ∈ On → (𝑦𝑥 → (𝑅1𝑦) ⊆ (𝑅1𝑥)))
3130imp 411 . . . . . . . 8 ((𝑥 ∈ On ∧ 𝑦𝑥) → (𝑅1𝑦) ⊆ (𝑅1𝑥))
3225, 31sylan 591 . . . . . . 7 ((𝑥 ∈ (𝑅1 “ dom card) ∧ 𝑦𝑥) → (𝑅1𝑦) ⊆ (𝑅1𝑥))
33 ssnum 10019 . . . . . . 7 (((𝑅1𝑥) ∈ dom card ∧ (𝑅1𝑦) ⊆ (𝑅1𝑥)) → (𝑅1𝑦) ∈ dom card)
3429, 32, 33syl2anc 595 . . . . . 6 ((𝑥 ∈ (𝑅1 “ dom card) ∧ 𝑦𝑥) → (𝑅1𝑦) ∈ dom card)
35 elpreima 7051 . . . . . . 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 594 . . . . 5 ((𝑥 ∈ (𝑅1 “ dom card) ∧ 𝑦𝑥) → 𝑦 ∈ (𝑅1 “ dom card))
3837rgen2 3211 . . . 4 𝑥 ∈ (𝑅1 “ dom card)∀𝑦𝑥 𝑦 ∈ (𝑅1 “ dom card)
39 dftr5 5223 . . . 4 (Tr (𝑅1 “ dom card) ↔ ∀𝑥 ∈ (𝑅1 “ dom card)∀𝑦𝑥 𝑦 ∈ (𝑅1 “ dom card))
4038, 39mpbir 234 . . 3 Tr (𝑅1 “ dom card)
41 cnvimass 6082 . . . . 5 (𝑅1 “ dom card) ⊆ dom 𝑅1
42 dffn2 6705 . . . . . . 7 (𝑅1 Fn On ↔ 𝑅1:On⟶V)
434, 42mpbi 233 . . . . . 6 𝑅1:On⟶V
4443fdmi 6715 . . . . 5 dom 𝑅1 = On
4541, 44sseqtri 3993 . . . 4 (𝑅1 “ dom card) ⊆ On
46 epweon 7770 . . . 4 E We On
47 wess 5645 . . . 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 6360 . . 3 (Ord (𝑅1 “ dom card) ↔ (Tr (𝑅1 “ dom card) ∧ E We (𝑅1 “ dom card)))
5040, 48, 49mpbir2an 723 . 2 Ord (𝑅1 “ dom card)
51 r1sdom 9742 . . . . . . 7 ((𝑥 ∈ On ∧ 𝑦𝑥) → (𝑅1𝑦) ≺ (𝑅1𝑥))
5225, 51sylan 591 . . . . . 6 ((𝑥 ∈ (𝑅1 “ dom card) ∧ 𝑦𝑥) → (𝑅1𝑦) ≺ (𝑅1𝑥))
53 cardsdom2 9970 . . . . . . 7 (((𝑅1𝑦) ∈ dom card ∧ (𝑅1𝑥) ∈ dom card) → ((card‘(𝑅1𝑦)) ∈ (card‘(𝑅1𝑥)) ↔ (𝑅1𝑦) ≺ (𝑅1𝑥)))
5434, 29, 53syl2anc 595 . . . . . 6 ((𝑥 ∈ (𝑅1 “ dom card) ∧ 𝑦𝑥) → ((card‘(𝑅1𝑦)) ∈ (card‘(𝑅1𝑥)) ↔ (𝑅1𝑦) ≺ (𝑅1𝑥)))
5552, 54mpbird 260 . . . . 5 ((𝑥 ∈ (𝑅1 “ dom card) ∧ 𝑦𝑥) → (card‘(𝑅1𝑦)) ∈ (card‘(𝑅1𝑥)))
56 fvco2 6976 . . . . . 6 ((𝑅1 Fn On ∧ 𝑦 ∈ On) → ((card ∘ 𝑅1)‘𝑦) = (card‘(𝑅1𝑦)))
574, 27, 56sylancr 598 . . . . 5 ((𝑥 ∈ (𝑅1 “ dom card) ∧ 𝑦𝑥) → ((card ∘ 𝑅1)‘𝑦) = (card‘(𝑅1𝑦)))
5825adantr 485 . . . . . 6 ((𝑥 ∈ (𝑅1 “ dom card) ∧ 𝑦𝑥) → 𝑥 ∈ On)
59 fvco2 6976 . . . . . 6 ((𝑅1 Fn On ∧ 𝑥 ∈ On) → ((card ∘ 𝑅1)‘𝑥) = (card‘(𝑅1𝑥)))
604, 58, 59sylancr 598 . . . . 5 ((𝑥 ∈ (𝑅1 “ dom card) ∧ 𝑦𝑥) → ((card ∘ 𝑅1)‘𝑥) = (card‘(𝑅1𝑥)))
6155, 57, 603eltr4d 2884 . . . 4 ((𝑥 ∈ (𝑅1 “ dom card) ∧ 𝑦𝑥) → ((card ∘ 𝑅1)‘𝑦) ∈ ((card ∘ 𝑅1)‘𝑥))
6261ex 417 . . 3 (𝑥 ∈ (𝑅1 “ dom card) → (𝑦𝑥 → ((card ∘ 𝑅1)‘𝑦) ∈ ((card ∘ 𝑅1)‘𝑥)))
6362adantl 486 . 2 ((𝑦 ∈ (𝑅1 “ dom card) ∧ 𝑥 ∈ (𝑅1 “ dom card)) → (𝑦𝑥 → ((card ∘ 𝑅1)‘𝑦) ∈ ((card ∘ 𝑅1)‘𝑥)))
6422, 50, 63, 20issmo 8331 1 Smo (card ∘ 𝑅1)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 209  wa 400   = wceq 1567  wcel 2149  {cab 2747  wral 3085  wrex 3095  Vcvv 3463  wss 3913   class class class wbr 5110  Tr wtr 5219   E cep 5558   We wwe 5611  ccnv 5658  dom cdm 5659  ran crn 5660  cres 5661  cima 5662  ccom 5663  Ord word 6356  Oncon0 6357  Fun wfun 6527   Fn wfn 6528  wf 6529  cfv 6533  Smo wsmo 8328  cen 8936  csdm 8938  𝑅1cr1 9730  cardccrd 9917
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1822  ax-4 1836  ax-5 1937  ax-6 1994  ax-7 2035  ax-8 2151  ax-9 2159  ax-10 2182  ax-11 2198  ax-12 2219  ax-ext 2741  ax-rep 5239  ax-sep 5258  ax-nul 5268  ax-pow 5334  ax-pr 5402  ax-un 7730
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3or 1102  df-3an 1103  df-tru 1570  df-fal 1580  df-ex 1807  df-nf 1811  df-sb 2098  df-mo 2573  df-eu 2603  df-clab 2748  df-cleq 2761  df-clel 2844  df-nfc 2918  df-ne 2965  df-ral 3086  df-rex 3096  df-rmo 3376  df-reu 3377  df-rab 3424  df-v 3465  df-sbc 3754  df-csb 3862  df-dif 3916  df-un 3918  df-in 3920  df-ss 3930  df-pss 3933  df-nul 4295  df-if 4490  df-pw 4566  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4874  df-int 4914  df-iun 4959  df-br 5111  df-opab 5175  df-mpt 5194  df-tr 5220  df-id 5554  df-eprel 5559  df-po 5567  df-so 5568  df-fr 5612  df-se 5613  df-we 5614  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-rn 5670  df-res 5671  df-ima 5672  df-pred 6299  df-ord 6360  df-on 6361  df-lim 6362  df-suc 6363  df-iota 6489  df-fun 6535  df-fn 6536  df-f 6537  df-f1 6538  df-fo 6539  df-f1o 6540  df-fv 6541  df-isom 6542  df-riota 7365  df-ov 7411  df-om 7859  df-2nd 7983  df-frecs 8274  df-wrecs 8305  df-smo 8329  df-recs 8354  df-rdg 8393  df-er 8690  df-en 8940  df-dom 8941  df-sdom 8942  df-r1 9732  df-card 9921
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator