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 44508
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 44507 . 2 ¬ (2o ∈ 3o ↔ (2o ↑o ω) ∈ (3o ↑o ω))
2 2on 8515 . . . 4 2o ∈ On
3 1oelpr 8512 . . . . 5 1o ∈ {∅, 1o}
4 df2o3 8509 . . . . 5 2o = {∅, 1o}
53, 4eleqtrri 2863 . . . 4 1o ∈ 2o
6 ondif2 8535 . . . 4 (2o ∈ (On ∖ 2o) ↔ (2o ∈ On ∧ 1o ∈ 2o))
72, 5, 6mpbir2an 724 . . 3 2o ∈ (On ∖ 2o)
8 3on 8518 . . . . 5 3o ∈ On
9 1oex 8511 . . . . . . 7 1o ∈ V
109tpid2 4731 . . . . . 6 1o ∈ {∅, 1o, 2o}
11 df3o2 44505 . . . . . 6 3o = {∅, 1o, 2o}
1210, 11eleqtrri 2863 . . . . 5 1o ∈ 3o
13 ondif2 8535 . . . . 5 (3o ∈ (On ∖ 2o) ↔ (3o ∈ On ∧ 1o ∈ 3o))
148, 12, 13mpbir2an 724 . . . 4 3o ∈ (On ∖ 2o)
15 omelon 9671 . . . . . 6 ω ∈ On
16 peano1 7921 . . . . . 6 ∅ ∈ ω
17 ondif1 8534 . . . . . 6 (ω ∈ (On ∖ 1o) ↔ (ω ∈ On ∧ ∅ ∈ ω))
1815, 16, 17mpbir2an 724 . . . . 5 ω ∈ (On ∖ 1o)
19 oveq2 7448 . . . . . . . . 9 (𝑐 = ω → (2o ↑o 𝑐) = (2o ↑o ω))
20 oveq2 7448 . . . . . . . . 9 (𝑐 = ω → (3o ↑o 𝑐) = (3o ↑o ω))
2119, 20eleq12d 2858 . . . . . . . 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 3580 . . . . 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 2853 . . . . . . . 8 (𝑏 = 3o → (2o ∈ 𝑏 ↔ 2o ∈ 3o))
27 oveq1 7447 . . . . . . . . 9 (𝑏 = 3o → (𝑏 ↑o 𝑐) = (3o ↑o 𝑐))
2827eleq2d 2850 . . . . . . . 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 3190 . . . . 5 (𝑏 = 3o → (∃𝑐 ∈ (On ∖ 1o) ¬ (2o ∈ 𝑏 ↔ (2o ↑o 𝑐) ∈ (𝑏 ↑o 𝑐)) ↔ ∃𝑐 ∈ (On ∖ 1o) ¬ (2o ∈ 3o ↔ (2o ↑o 𝑐) ∈ (3o ↑o 𝑐))))
3231rspcev 3580 . . . 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 2852 . . . . . . 7 (𝑎 = 2o → (𝑎 ∈ 𝑏 ↔ 2o ∈ 𝑏))
35 oveq1 7447 . . . . . . . 8 (𝑎 = 2o → (𝑎 ↑o 𝑐) = (2o ↑o 𝑐))
3635eleq1d 2849 . . . . . . 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 3231 . . . 4 (𝑎 = 2o → (∃𝑏 ∈ (On ∖ 2o)∃𝑐 ∈ (On ∖ 1o) ¬ (𝑎 ∈ 𝑏 ↔ (𝑎 ↑o 𝑐) ∈ (𝑏 ↑o 𝑐)) ↔ ∃𝑏 ∈ (On ∖ 2o)∃𝑐 ∈ (On ∖ 1o) ¬ (2o ∈ 𝑏 ↔ (2o ↑o 𝑐) ∈ (𝑏 ↑o 𝑐))))
4039rspcev 3580 . . 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 1570   ∈ wcel 2147  ∃wrex 3090   ∖ cdif 4048  ∅c0 4281  {cpr 4590  {ctp 4592  Oncon0 6377  (class class class)co 7440  ωcom 7898  1oc1o 8494  2oc2o 8495  3oc3o 8496   ↑o coe 8500
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-rep 5235  ax-sep 5252  ax-nul 5263  ax-pr 5395  ax-un 7772  ax-inf2 9666
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-pss 4017  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-tp 4593  df-op 4839  df-uni 4871  df-iun 4956  df-br 5107  df-opab 5171  df-mpt 5190  df-tr 5216  df-id 5550  df-eprel 5555  df-po 5563  df-so 5564  df-fr 5608  df-we 5610  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-pred 6319  df-ord 6380  df-on 6381  df-lim 6382  df-suc 6383  df-iota 6509  df-fun 6557  df-fn 6558  df-f 6559  df-f1 6560  df-fo 6561  df-f1o 6562  df-fv 6563  df-ov 7443  df-oprab 7444  df-mpo 7445  df-om 7899  df-2nd 8023  df-frecs 8324  df-wrecs 8355  df-recs 8404  df-rdg 8443  df-1o 8501  df-2o 8502  df-3o 8503  df-oadd 8505  df-omul 8506  df-oexp 8507
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator