Users' Mathboxes Mathbox for Richard Penner < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  oenord1 Structured version   Visualization version   GIF version

Theorem oenord1 44318
Description: When two ordinals (both at least as large as two) are raised to the same power, ordering of the powers is not equivalent to the ordering of the bases. Remark 3.26 of [Schloeder] p. 11. (Contributed by RP, 4-Feb-2025.)
Assertion
Ref Expression
oenord1 ∃𝑎 ∈ (On ∖ 2o)∃𝑏 ∈ (On ∖ 2o)∃𝑐 ∈ (On ∖ 1o) ¬ (𝑎 ∈ 𝑏 ↔ (𝑎 ↑o 𝑐) ∈ (𝑏 ↑o 𝑐))
Distinct variable group:   𝑎,𝑏,𝑐

Proof of Theorem oenord1
StepHypRef Expression
1 oenord1ex 44317 . 2 ¬ (2o ∈ 3o ↔ (2o ↑o ω) ∈ (3o ↑o ω))
2 2on 8490 . . . 4 2o ∈ On
3 1oelpr 8487 . . . . 5 1o ∈ {∅, 1o}
4 df2o3 8484 . . . . 5 2o = {∅, 1o}
53, 4eleqtrri 2859 . . . 4 1o ∈ 2o
6 ondif2 8510 . . . 4 (2o ∈ (On ∖ 2o) ↔ (2o ∈ On ∧ 1o ∈ 2o))
72, 5, 6mpbir2an 724 . . 3 2o ∈ (On ∖ 2o)
8 3on 8493 . . . . 5 3o ∈ On
9 1oex 8486 . . . . . . 7 1o ∈ V
109tpid2 4730 . . . . . 6 1o ∈ {∅, 1o, 2o}
11 df3o2 44315 . . . . . 6 3o = {∅, 1o, 2o}
1210, 11eleqtrri 2859 . . . . 5 1o ∈ 3o
13 ondif2 8510 . . . . 5 (3o ∈ (On ∖ 2o) ↔ (3o ∈ On ∧ 1o ∈ 3o))
148, 12, 13mpbir2an 724 . . . 4 3o ∈ (On ∖ 2o)
15 omelon 9647 . . . . . 6 ω ∈ On
16 peano1 7900 . . . . . 6 ∅ ∈ ω
17 ondif1 8509 . . . . . 6 (ω ∈ (On ∖ 1o) ↔ (ω ∈ On ∧ ∅ ∈ ω))
1815, 16, 17mpbir2an 724 . . . . 5 ω ∈ (On ∖ 1o)
19 oveq2 7428 . . . . . . . . 9 (𝑐 = ω → (2o ↑o 𝑐) = (2o ↑o ω))
20 oveq2 7428 . . . . . . . . 9 (𝑐 = ω → (3o ↑o 𝑐) = (3o ↑o ω))
2119, 20eleq12d 2854 . . . . . . . 8 (𝑐 = ω → ((2o ↑o 𝑐) ∈ (3o ↑o 𝑐) ↔ (2o ↑o ω) ∈ (3o ↑o ω)))
2221bibi2d 345 . . . . . . 7 (𝑐 = ω → ((2o ∈ 3o ↔ (2o ↑o 𝑐) ∈ (3o ↑o 𝑐)) ↔ (2o ∈ 3o ↔ (2o ↑o ω) ∈ (3o ↑o ω))))
2322notbid 321 . . . . . 6 (𝑐 = ω → (¬ (2o ∈ 3o ↔ (2o ↑o 𝑐) ∈ (3o ↑o 𝑐)) ↔ ¬ (2o ∈ 3o ↔ (2o ↑o ω) ∈ (3o ↑o ω))))
2423rspcev 3576 . . . . 5 ((ω ∈ (On ∖ 1o) ∧ ¬ (2o ∈ 3o ↔ (2o ↑o ω) ∈ (3o ↑o ω))) → ∃𝑐 ∈ (On ∖ 1o) ¬ (2o ∈ 3o ↔ (2o ↑o 𝑐) ∈ (3o ↑o 𝑐)))
2518, 24mpan 703 . . . 4 (¬ (2o ∈ 3o ↔ (2o ↑o ω) ∈ (3o ↑o ω)) → ∃𝑐 ∈ (On ∖ 1o) ¬ (2o ∈ 3o ↔ (2o ↑o 𝑐) ∈ (3o ↑o 𝑐)))
26 eleq2 2849 . . . . . . . 8 (𝑏 = 3o → (2o ∈ 𝑏 ↔ 2o ∈ 3o))
27 oveq1 7427 . . . . . . . . 9 (𝑏 = 3o → (𝑏 ↑o 𝑐) = (3o ↑o 𝑐))
2827eleq2d 2846 . . . . . . . 8 (𝑏 = 3o → ((2o ↑o 𝑐) ∈ (𝑏 ↑o 𝑐) ↔ (2o ↑o 𝑐) ∈ (3o ↑o 𝑐)))
2926, 28bibi12d 348 . . . . . . 7 (𝑏 = 3o → ((2o ∈ 𝑏 ↔ (2o ↑o 𝑐) ∈ (𝑏 ↑o 𝑐)) ↔ (2o ∈ 3o ↔ (2o ↑o 𝑐) ∈ (3o ↑o 𝑐))))
3029notbid 321 . . . . . 6 (𝑏 = 3o → (¬ (2o ∈ 𝑏 ↔ (2o ↑o 𝑐) ∈ (𝑏 ↑o 𝑐)) ↔ ¬ (2o ∈ 3o ↔ (2o ↑o 𝑐) ∈ (3o ↑o 𝑐))))
3130rexbidv 3186 . . . . 5 (𝑏 = 3o → (∃𝑐 ∈ (On ∖ 1o) ¬ (2o ∈ 𝑏 ↔ (2o ↑o 𝑐) ∈ (𝑏 ↑o 𝑐)) ↔ ∃𝑐 ∈ (On ∖ 1o) ¬ (2o ∈ 3o ↔ (2o ↑o 𝑐) ∈ (3o ↑o 𝑐))))
3231rspcev 3576 . . . 4 ((3o ∈ (On ∖ 2o) ∧ ∃𝑐 ∈ (On ∖ 1o) ¬ (2o ∈ 3o ↔ (2o ↑o 𝑐) ∈ (3o ↑o 𝑐))) → ∃𝑏 ∈ (On ∖ 2o)∃𝑐 ∈ (On ∖ 1o) ¬ (2o ∈ 𝑏 ↔ (2o ↑o 𝑐) ∈ (𝑏 ↑o 𝑐)))
3314, 25, 32sylancr 599 . . 3 (¬ (2o ∈ 3o ↔ (2o ↑o ω) ∈ (3o ↑o ω)) → ∃𝑏 ∈ (On ∖ 2o)∃𝑐 ∈ (On ∖ 1o) ¬ (2o ∈ 𝑏 ↔ (2o ↑o 𝑐) ∈ (𝑏 ↑o 𝑐)))
34 eleq1 2848 . . . . . . 7 (𝑎 = 2o → (𝑎 ∈ 𝑏 ↔ 2o ∈ 𝑏))
35 oveq1 7427 . . . . . . . 8 (𝑎 = 2o → (𝑎 ↑o 𝑐) = (2o ↑o 𝑐))
3635eleq1d 2845 . . . . . . 7 (𝑎 = 2o → ((𝑎 ↑o 𝑐) ∈ (𝑏 ↑o 𝑐) ↔ (2o ↑o 𝑐) ∈ (𝑏 ↑o 𝑐)))
3734, 36bibi12d 348 . . . . . 6 (𝑎 = 2o → ((𝑎 ∈ 𝑏 ↔ (𝑎 ↑o 𝑐) ∈ (𝑏 ↑o 𝑐)) ↔ (2o ∈ 𝑏 ↔ (2o ↑o 𝑐) ∈ (𝑏 ↑o 𝑐))))
3837notbid 321 . . . . 5 (𝑎 = 2o → (¬ (𝑎 ∈ 𝑏 ↔ (𝑎 ↑o 𝑐) ∈ (𝑏 ↑o 𝑐)) ↔ ¬ (2o ∈ 𝑏 ↔ (2o ↑o 𝑐) ∈ (𝑏 ↑o 𝑐))))
39382rexbidv 3227 . . . 4 (𝑎 = 2o → (∃𝑏 ∈ (On ∖ 2o)∃𝑐 ∈ (On ∖ 1o) ¬ (𝑎 ∈ 𝑏 ↔ (𝑎 ↑o 𝑐) ∈ (𝑏 ↑o 𝑐)) ↔ ∃𝑏 ∈ (On ∖ 2o)∃𝑐 ∈ (On ∖ 1o) ¬ (2o ∈ 𝑏 ↔ (2o ↑o 𝑐) ∈ (𝑏 ↑o 𝑐))))
4039rspcev 3576 . . 3 ((2o ∈ (On ∖ 2o) ∧ ∃𝑏 ∈ (On ∖ 2o)∃𝑐 ∈ (On ∖ 1o) ¬ (2o ∈ 𝑏 ↔ (2o ↑o 𝑐) ∈ (𝑏 ↑o 𝑐))) → ∃𝑎 ∈ (On ∖ 2o)∃𝑏 ∈ (On ∖ 2o)∃𝑐 ∈ (On ∖ 1o) ¬ (𝑎 ∈ 𝑏 ↔ (𝑎 ↑o 𝑐) ∈ (𝑏 ↑o 𝑐)))
417, 33, 40sylancr 599 . 2 (¬ (2o ∈ 3o ↔ (2o ↑o ω) ∈ (3o ↑o ω)) → ∃𝑎 ∈ (On ∖ 2o)∃𝑏 ∈ (On ∖ 2o)∃𝑐 ∈ (On ∖ 1o) ¬ (𝑎 ∈ 𝑏 ↔ (𝑎 ↑o 𝑐) ∈ (𝑏 ↑o 𝑐)))
421, 41ax-mp 5 1 ∃𝑎 ∈ (On ∖ 2o)∃𝑏 ∈ (On ∖ 2o)∃𝑐 ∈ (On ∖ 1o) ¬ (𝑎 ∈ 𝑏 ↔ (𝑎 ↑o 𝑐) ∈ (𝑏 ↑o 𝑐))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3   ↔ wb 209   = wceq 1569   ∈ wcel 2144  ∃wrex 3086   ∖ cdif 4045  ∅c0 4278  {cpr 4585  {ctp 4587  Oncon0 6362  (class class class)co 7420  ωcom 7877  1oc1o 8469  2oc2o 8470  3oc3o 8471   ↑o coe 8475
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-rep 5231  ax-sep 5248  ax-nul 5259  ax-pr 5390  ax-un 7751  ax-inf2 9642
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-reu 3366  df-rab 3413  df-v 3452  df-sbc 3739  df-csb 3847  df-ss 3896  df-pss 4014  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-pw 4558  df-sn 4584  df-pr 4586  df-tp 4588  df-op 4590  df-uni 4867  df-iun 4952  df-br 5103  df-opab 5167  df-mpt 5186  df-tr 5212  df-id 5545  df-eprel 5550  df-po 5558  df-so 5559  df-fr 5603  df-we 5605  df-xp 5656  df-rel 5657  df-cnv 5658  df-co 5659  df-dm 5660  df-rn 5661  df-res 5662  df-ima 5663  df-pred 6304  df-ord 6365  df-on 6366  df-lim 6367  df-suc 6368  df-iota 6494  df-fun 6540  df-fn 6541  df-f 6542  df-f1 6543  df-fo 6544  df-f1o 6545  df-fv 6546  df-ov 7423  df-oprab 7424  df-mpo 7425  df-om 7878  df-2nd 8002  df-frecs 8299  df-wrecs 8330  df-recs 8379  df-rdg 8418  df-1o 8476  df-2o 8477  df-3o 8478  df-oadd 8480  df-omul 8481  df-oexp 8482
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator