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

Theorem smobeth 10538
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 9895 . . . . . . 7 card:{𝑥 ∣ ∃𝑦 ∈ On 𝑦𝑥}⟶On
2 ffun 6689 . . . . . . 7 (card:{𝑥 ∣ ∃𝑦 ∈ On 𝑦𝑥}⟶On → Fun card)
31, 2ax-mp 5 . . . . . 6 Fun card
4 r1fnon 9719 . . . . . . 7 𝑅1 Fn On
5 fnfun 6616 . . . . . . 7 (𝑅1 Fn On → Fun 𝑅1)
64, 5ax-mp 5 . . . . . 6 Fun 𝑅1
7 funco 6556 . . . . . 6 ((Fun card ∧ Fun 𝑅1) → Fun (card ∘ 𝑅1))
83, 6, 7mp2an 702 . . . . 5 Fun (card ∘ 𝑅1)
9 funfn 6546 . . . . 5 (Fun (card ∘ 𝑅1) ↔ (card ∘ 𝑅1) Fn dom (card ∘ 𝑅1))
108, 9mpbi 232 . . . 4 (card ∘ 𝑅1) Fn dom (card ∘ 𝑅1)
11 rnco 6234 . . . . 5 ran (card ∘ 𝑅1) = ran (card ↾ ran 𝑅1)
12 resss 5983 . . . . . . 7 (card ↾ ran 𝑅1) ⊆ card
1312rnssi 5912 . . . . . 6 ran (card ↾ ran 𝑅1) ⊆ ran card
14 frn 6694 . . . . . . 7 (card:{𝑥 ∣ ∃𝑦 ∈ On 𝑦𝑥}⟶On → ran card ⊆ On)
151, 14ax-mp 5 . . . . . 6 ran card ⊆ On
1613, 15sstri 3943 . . . . 5 ran (card ↾ ran 𝑅1) ⊆ On
1711, 16eqsstri 3980 . . . 4 ran (card ∘ 𝑅1) ⊆ On
18 df-f 6520 . . . 4 ((card ∘ 𝑅1):dom (card ∘ 𝑅1)⟶On ↔ ((card ∘ 𝑅1) Fn dom (card ∘ 𝑅1) ∧ ran (card ∘ 𝑅1) ⊆ On))
1910, 17, 18mpbir2an 721 . . 3 (card ∘ 𝑅1):dom (card ∘ 𝑅1)⟶On
20 dmco 6237 . . . 4 dom (card ∘ 𝑅1) = (𝑅1 “ dom card)
2120feq2i 6678 . . 3 ((card ∘ 𝑅1):dom (card ∘ 𝑅1)⟶On ↔ (card ∘ 𝑅1):(𝑅1 “ dom card)⟶On)
2219, 21mpbi 232 . 2 (card ∘ 𝑅1):(𝑅1 “ dom card)⟶On
23 elpreima 7034 . . . . . . . . 9 (𝑅1 Fn On → (𝑥 ∈ (𝑅1 “ dom card) ↔ (𝑥 ∈ On ∧ (𝑅1𝑥) ∈ dom card)))
244, 23ax-mp 5 . . . . . . . 8 (𝑥 ∈ (𝑅1 “ dom card) ↔ (𝑥 ∈ On ∧ (𝑅1𝑥) ∈ dom card))
2524simplbi 500 . . . . . . 7 (𝑥 ∈ (𝑅1 “ dom card) → 𝑥 ∈ On)
26 onelon 6366 . . . . . . 7 ((𝑥 ∈ On ∧ 𝑦𝑥) → 𝑦 ∈ On)
2725, 26sylan 589 . . . . . 6 ((𝑥 ∈ (𝑅1 “ dom card) ∧ 𝑦𝑥) → 𝑦 ∈ On)
2824simprbi 501 . . . . . . . 8 (𝑥 ∈ (𝑅1 “ dom card) → (𝑅1𝑥) ∈ dom card)
2928adantr 484 . . . . . . 7 ((𝑥 ∈ (𝑅1 “ dom card) ∧ 𝑦𝑥) → (𝑅1𝑥) ∈ dom card)
30 r1ord2 9733 . . . . . . . . 9 (𝑥 ∈ On → (𝑦𝑥 → (𝑅1𝑦) ⊆ (𝑅1𝑥)))
3130imp 410 . . . . . . . 8 ((𝑥 ∈ On ∧ 𝑦𝑥) → (𝑅1𝑦) ⊆ (𝑅1𝑥))
3225, 31sylan 589 . . . . . . 7 ((𝑥 ∈ (𝑅1 “ dom card) ∧ 𝑦𝑥) → (𝑅1𝑦) ⊆ (𝑅1𝑥))
33 ssnum 9989 . . . . . . 7 (((𝑅1𝑥) ∈ dom card ∧ (𝑅1𝑦) ⊆ (𝑅1𝑥)) → (𝑅1𝑦) ∈ dom card)
3429, 32, 33syl2anc 593 . . . . . 6 ((𝑥 ∈ (𝑅1 “ dom card) ∧ 𝑦𝑥) → (𝑅1𝑦) ∈ dom card)
35 elpreima 7034 . . . . . . 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 592 . . . . 5 ((𝑥 ∈ (𝑅1 “ dom card) ∧ 𝑦𝑥) → 𝑦 ∈ (𝑅1 “ dom card))
3837rgen2 3201 . . . 4 𝑥 ∈ (𝑅1 “ dom card)∀𝑦𝑥 𝑦 ∈ (𝑅1 “ dom card)
39 dftr5 5208 . . . 4 (Tr (𝑅1 “ dom card) ↔ ∀𝑥 ∈ (𝑅1 “ dom card)∀𝑦𝑥 𝑦 ∈ (𝑅1 “ dom card))
4038, 39mpbir 233 . . 3 Tr (𝑅1 “ dom card)
41 cnvimass 6067 . . . . 5 (𝑅1 “ dom card) ⊆ dom 𝑅1
42 dffn2 6688 . . . . . . 7 (𝑅1 Fn On ↔ 𝑅1:On⟶V)
434, 42mpbi 232 . . . . . 6 𝑅1:On⟶V
4443fdmi 6698 . . . . 5 dom 𝑅1 = On
4541, 44sseqtri 3982 . . . 4 (𝑅1 “ dom card) ⊆ On
46 epweon 7753 . . . 4 E We On
47 wess 5629 . . . 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 6344 . . 3 (Ord (𝑅1 “ dom card) ↔ (Tr (𝑅1 “ dom card) ∧ E We (𝑅1 “ dom card)))
5040, 48, 49mpbir2an 721 . 2 Ord (𝑅1 “ dom card)
51 r1sdom 9726 . . . . . . 7 ((𝑥 ∈ On ∧ 𝑦𝑥) → (𝑅1𝑦) ≺ (𝑅1𝑥))
5225, 51sylan 589 . . . . . 6 ((𝑥 ∈ (𝑅1 “ dom card) ∧ 𝑦𝑥) → (𝑅1𝑦) ≺ (𝑅1𝑥))
53 cardsdom2 9940 . . . . . . 7 (((𝑅1𝑦) ∈ dom card ∧ (𝑅1𝑥) ∈ dom card) → ((card‘(𝑅1𝑦)) ∈ (card‘(𝑅1𝑥)) ↔ (𝑅1𝑦) ≺ (𝑅1𝑥)))
5434, 29, 53syl2anc 593 . . . . . 6 ((𝑥 ∈ (𝑅1 “ dom card) ∧ 𝑦𝑥) → ((card‘(𝑅1𝑦)) ∈ (card‘(𝑅1𝑥)) ↔ (𝑅1𝑦) ≺ (𝑅1𝑥)))
5552, 54mpbird 259 . . . . 5 ((𝑥 ∈ (𝑅1 “ dom card) ∧ 𝑦𝑥) → (card‘(𝑅1𝑦)) ∈ (card‘(𝑅1𝑥)))
56 fvco2 6959 . . . . . 6 ((𝑅1 Fn On ∧ 𝑦 ∈ On) → ((card ∘ 𝑅1)‘𝑦) = (card‘(𝑅1𝑦)))
574, 27, 56sylancr 596 . . . . 5 ((𝑥 ∈ (𝑅1 “ dom card) ∧ 𝑦𝑥) → ((card ∘ 𝑅1)‘𝑦) = (card‘(𝑅1𝑦)))
5825adantr 484 . . . . . 6 ((𝑥 ∈ (𝑅1 “ dom card) ∧ 𝑦𝑥) → 𝑥 ∈ On)
59 fvco2 6959 . . . . . 6 ((𝑅1 Fn On ∧ 𝑥 ∈ On) → ((card ∘ 𝑅1)‘𝑥) = (card‘(𝑅1𝑥)))
604, 58, 59sylancr 596 . . . . 5 ((𝑥 ∈ (𝑅1 “ dom card) ∧ 𝑦𝑥) → ((card ∘ 𝑅1)‘𝑥) = (card‘(𝑅1𝑥)))
6155, 57, 603eltr4d 2876 . . . 4 ((𝑥 ∈ (𝑅1 “ dom card) ∧ 𝑦𝑥) → ((card ∘ 𝑅1)‘𝑦) ∈ ((card ∘ 𝑅1)‘𝑥))
6261ex 416 . . 3 (𝑥 ∈ (𝑅1 “ dom card) → (𝑦𝑥 → ((card ∘ 𝑅1)‘𝑦) ∈ ((card ∘ 𝑅1)‘𝑥)))
6362adantl 485 . 2 ((𝑦 ∈ (𝑅1 “ dom card) ∧ 𝑥 ∈ (𝑅1 “ dom card)) → (𝑦𝑥 → ((card ∘ 𝑅1)‘𝑦) ∈ ((card ∘ 𝑅1)‘𝑥)))
6422, 50, 63, 20issmo 8313 1 Smo (card ∘ 𝑅1)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 208  wa 399   = wceq 1559  wcel 2141  {cab 2739  wral 3075  wrex 3085  Vcvv 3453  wss 3902   class class class wbr 5097  Tr wtr 5204   E cep 5542   We wwe 5595  ccnv 5642  dom cdm 5643  ran crn 5644  cres 5645  cima 5646  ccom 5647  Ord word 6340  Oncon0 6341  Fun wfun 6510   Fn wfn 6511  wf 6512  cfv 6516  Smo wsmo 8310  cen 8918  csdm 8920  𝑅1cr1 9714  cardccrd 9887
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1814  ax-4 1828  ax-5 1929  ax-6 1986  ax-7 2027  ax-8 2143  ax-9 2151  ax-10 2174  ax-11 2190  ax-12 2211  ax-ext 2733  ax-rep 5224  ax-sep 5243  ax-nul 5253  ax-pow 5319  ax-pr 5387  ax-un 7713
This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-3or 1098  df-3an 1099  df-tru 1562  df-fal 1572  df-ex 1799  df-nf 1803  df-sb 2090  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3076  df-rex 3086  df-rmo 3366  df-reu 3367  df-rab 3414  df-v 3455  df-sbc 3743  df-csb 3851  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-pss 3922  df-nul 4284  df-if 4478  df-pw 4554  df-sn 4580  df-pr 4582  df-op 4586  df-uni 4863  df-int 4903  df-iun 4948  df-br 5098  df-opab 5160  df-mpt 5179  df-tr 5205  df-id 5538  df-eprel 5543  df-po 5551  df-so 5552  df-fr 5596  df-se 5597  df-we 5598  df-xp 5649  df-rel 5650  df-cnv 5651  df-co 5652  df-dm 5653  df-rn 5654  df-res 5655  df-ima 5656  df-pred 6283  df-ord 6344  df-on 6345  df-lim 6346  df-suc 6347  df-iota 6472  df-fun 6518  df-fn 6519  df-f 6520  df-f1 6521  df-fo 6522  df-f1o 6523  df-fv 6524  df-isom 6525  df-riota 7348  df-ov 7394  df-om 7842  df-2nd 7966  df-frecs 8256  df-wrecs 8287  df-smo 8311  df-recs 8336  df-rdg 8375  df-er 8672  df-en 8922  df-dom 8923  df-sdom 8924  df-r1 9716  df-card 9891
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator