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

Theorem omnord1 44497
Description: When the same nonzero ordinal is multiplied on the right, ordering of the products is not equivalent to the ordering of the ordinals on the left. Remark 3.18 of [Schloeder] p. 10. (Contributed by RP, 4-Feb-2025.)
Assertion
Ref Expression
omnord1 ∃𝑎 ∈ On ∃𝑏 ∈ On ∃𝑐 ∈ (On ∖ 1o) ¬ (𝑎 ∈ 𝑏 ↔ (𝑎 ·o 𝑐) ∈ (𝑏 ·o 𝑐))
Distinct variable group:   𝑎,𝑏,𝑐

Proof of Theorem omnord1
StepHypRef Expression
1 omnord1ex 44496 . 2 ¬ (1o ∈ 2o ↔ (1o ·o ω) ∈ (2o ·o ω))
2 1on 8514 . . 3 1o ∈ On
3 2on 8515 . . . 4 2o ∈ On
4 omelon 9671 . . . . . 6 ω ∈ On
5 peano1 7921 . . . . . 6 ∅ ∈ ω
6 ondif1 8534 . . . . . 6 (ω ∈ (On ∖ 1o) ↔ (ω ∈ On ∧ ∅ ∈ ω))
74, 5, 6mpbir2an 724 . . . . 5 ω ∈ (On ∖ 1o)
8 oveq2 7448 . . . . . . . . 9 (𝑐 = ω → (1o ·o 𝑐) = (1o ·o ω))
9 oveq2 7448 . . . . . . . . 9 (𝑐 = ω → (2o ·o 𝑐) = (2o ·o ω))
108, 9eleq12d 2858 . . . . . . . 8 (𝑐 = ω → ((1o ·o 𝑐) ∈ (2o ·o 𝑐) ↔ (1o ·o ω) ∈ (2o ·o ω)))
1110bibi2d 345 . . . . . . 7 (𝑐 = ω → ((1o ∈ 2o ↔ (1o ·o 𝑐) ∈ (2o ·o 𝑐)) ↔ (1o ∈ 2o ↔ (1o ·o ω) ∈ (2o ·o ω))))
1211notbid 321 . . . . . 6 (𝑐 = ω → (¬ (1o ∈ 2o ↔ (1o ·o 𝑐) ∈ (2o ·o 𝑐)) ↔ ¬ (1o ∈ 2o ↔ (1o ·o ω) ∈ (2o ·o ω))))
1312rspcev 3580 . . . . 5 ((ω ∈ (On ∖ 1o) ∧ ¬ (1o ∈ 2o ↔ (1o ·o ω) ∈ (2o ·o ω))) → ∃𝑐 ∈ (On ∖ 1o) ¬ (1o ∈ 2o ↔ (1o ·o 𝑐) ∈ (2o ·o 𝑐)))
147, 13mpan 703 . . . 4 (¬ (1o ∈ 2o ↔ (1o ·o ω) ∈ (2o ·o ω)) → ∃𝑐 ∈ (On ∖ 1o) ¬ (1o ∈ 2o ↔ (1o ·o 𝑐) ∈ (2o ·o 𝑐)))
15 eleq2 2853 . . . . . . . 8 (𝑏 = 2o → (1o ∈ 𝑏 ↔ 1o ∈ 2o))
16 oveq1 7447 . . . . . . . . 9 (𝑏 = 2o → (𝑏 ·o 𝑐) = (2o ·o 𝑐))
1716eleq2d 2850 . . . . . . . 8 (𝑏 = 2o → ((1o ·o 𝑐) ∈ (𝑏 ·o 𝑐) ↔ (1o ·o 𝑐) ∈ (2o ·o 𝑐)))
1815, 17bibi12d 348 . . . . . . 7 (𝑏 = 2o → ((1o ∈ 𝑏 ↔ (1o ·o 𝑐) ∈ (𝑏 ·o 𝑐)) ↔ (1o ∈ 2o ↔ (1o ·o 𝑐) ∈ (2o ·o 𝑐))))
1918notbid 321 . . . . . 6 (𝑏 = 2o → (¬ (1o ∈ 𝑏 ↔ (1o ·o 𝑐) ∈ (𝑏 ·o 𝑐)) ↔ ¬ (1o ∈ 2o ↔ (1o ·o 𝑐) ∈ (2o ·o 𝑐))))
2019rexbidv 3190 . . . . 5 (𝑏 = 2o → (∃𝑐 ∈ (On ∖ 1o) ¬ (1o ∈ 𝑏 ↔ (1o ·o 𝑐) ∈ (𝑏 ·o 𝑐)) ↔ ∃𝑐 ∈ (On ∖ 1o) ¬ (1o ∈ 2o ↔ (1o ·o 𝑐) ∈ (2o ·o 𝑐))))
2120rspcev 3580 . . . 4 ((2o ∈ On ∧ ∃𝑐 ∈ (On ∖ 1o) ¬ (1o ∈ 2o ↔ (1o ·o 𝑐) ∈ (2o ·o 𝑐))) → ∃𝑏 ∈ On ∃𝑐 ∈ (On ∖ 1o) ¬ (1o ∈ 𝑏 ↔ (1o ·o 𝑐) ∈ (𝑏 ·o 𝑐)))
223, 14, 21sylancr 599 . . 3 (¬ (1o ∈ 2o ↔ (1o ·o ω) ∈ (2o ·o ω)) → ∃𝑏 ∈ On ∃𝑐 ∈ (On ∖ 1o) ¬ (1o ∈ 𝑏 ↔ (1o ·o 𝑐) ∈ (𝑏 ·o 𝑐)))
23 eleq1 2852 . . . . . . . 8 (𝑎 = 1o → (𝑎 ∈ 𝑏 ↔ 1o ∈ 𝑏))
24 oveq1 7447 . . . . . . . . 9 (𝑎 = 1o → (𝑎 ·o 𝑐) = (1o ·o 𝑐))
2524eleq1d 2849 . . . . . . . 8 (𝑎 = 1o → ((𝑎 ·o 𝑐) ∈ (𝑏 ·o 𝑐) ↔ (1o ·o 𝑐) ∈ (𝑏 ·o 𝑐)))
2623, 25bibi12d 348 . . . . . . 7 (𝑎 = 1o → ((𝑎 ∈ 𝑏 ↔ (𝑎 ·o 𝑐) ∈ (𝑏 ·o 𝑐)) ↔ (1o ∈ 𝑏 ↔ (1o ·o 𝑐) ∈ (𝑏 ·o 𝑐))))
2726notbid 321 . . . . . 6 (𝑎 = 1o → (¬ (𝑎 ∈ 𝑏 ↔ (𝑎 ·o 𝑐) ∈ (𝑏 ·o 𝑐)) ↔ ¬ (1o ∈ 𝑏 ↔ (1o ·o 𝑐) ∈ (𝑏 ·o 𝑐))))
2827rexbidv 3190 . . . . 5 (𝑎 = 1o → (∃𝑐 ∈ (On ∖ 1o) ¬ (𝑎 ∈ 𝑏 ↔ (𝑎 ·o 𝑐) ∈ (𝑏 ·o 𝑐)) ↔ ∃𝑐 ∈ (On ∖ 1o) ¬ (1o ∈ 𝑏 ↔ (1o ·o 𝑐) ∈ (𝑏 ·o 𝑐))))
2928rexbidv 3190 . . . 4 (𝑎 = 1o → (∃𝑏 ∈ On ∃𝑐 ∈ (On ∖ 1o) ¬ (𝑎 ∈ 𝑏 ↔ (𝑎 ·o 𝑐) ∈ (𝑏 ·o 𝑐)) ↔ ∃𝑏 ∈ On ∃𝑐 ∈ (On ∖ 1o) ¬ (1o ∈ 𝑏 ↔ (1o ·o 𝑐) ∈ (𝑏 ·o 𝑐))))
3029rspcev 3580 . . 3 ((1o ∈ On ∧ ∃𝑏 ∈ On ∃𝑐 ∈ (On ∖ 1o) ¬ (1o ∈ 𝑏 ↔ (1o ·o 𝑐) ∈ (𝑏 ·o 𝑐))) → ∃𝑎 ∈ On ∃𝑏 ∈ On ∃𝑐 ∈ (On ∖ 1o) ¬ (𝑎 ∈ 𝑏 ↔ (𝑎 ·o 𝑐) ∈ (𝑏 ·o 𝑐)))
312, 22, 30sylancr 599 . 2 (¬ (1o ∈ 2o ↔ (1o ·o ω) ∈ (2o ·o ω)) → ∃𝑎 ∈ On ∃𝑏 ∈ On ∃𝑐 ∈ (On ∖ 1o) ¬ (𝑎 ∈ 𝑏 ↔ (𝑎 ·o 𝑐) ∈ (𝑏 ·o 𝑐)))
321, 31ax-mp 5 1 ∃𝑎 ∈ On ∃𝑏 ∈ On ∃𝑐 ∈ (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  Oncon0 6377  (class class class)co 7440  ωcom 7898  1oc1o 8494  2oc2o 8495   ·o comu 8499
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-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-oadd 8505  df-omul 8506
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator