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

Theorem omwordi 8556
Description: Weak ordering property of ordinal multiplication. (Contributed by NM, 21-Dec-2004.)
Assertion
Ref Expression
omwordi ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ On) → (𝐴𝐵 → (𝐶 ·o 𝐴) ⊆ (𝐶 ·o 𝐵)))

Proof of Theorem omwordi
StepHypRef Expression
1 omword 8555 . . . 4 (((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ On) ∧ ∅ ∈ 𝐶) → (𝐴𝐵 ↔ (𝐶 ·o 𝐴) ⊆ (𝐶 ·o 𝐵)))
21biimpd 232 . . 3 (((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ On) ∧ ∅ ∈ 𝐶) → (𝐴𝐵 → (𝐶 ·o 𝐴) ⊆ (𝐶 ·o 𝐵)))
32ex 417 . 2 ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ On) → (∅ ∈ 𝐶 → (𝐴𝐵 → (𝐶 ·o 𝐴) ⊆ (𝐶 ·o 𝐵))))
4 eloni 6371 . . . . . 6 (𝐶 ∈ On → Ord 𝐶)
5 ord0eln0 6418 . . . . . . 7 (Ord 𝐶 → (∅ ∈ 𝐶𝐶 ≠ ∅))
65necon2bbid 3007 . . . . . 6 (Ord 𝐶 → (𝐶 = ∅ ↔ ¬ ∅ ∈ 𝐶))
74, 6syl 18 . . . . 5 (𝐶 ∈ On → (𝐶 = ∅ ↔ ¬ ∅ ∈ 𝐶))
873ad2ant3 1151 . . . 4 ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ On) → (𝐶 = ∅ ↔ ¬ ∅ ∈ 𝐶))
9 ssid 3967 . . . . . . 7 ∅ ⊆ ∅
10 om0r 8524 . . . . . . . . 9 (𝐴 ∈ On → (∅ ·o 𝐴) = ∅)
1110adantr 485 . . . . . . . 8 ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (∅ ·o 𝐴) = ∅)
12 om0r 8524 . . . . . . . . 9 (𝐵 ∈ On → (∅ ·o 𝐵) = ∅)
1312adantl 486 . . . . . . . 8 ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (∅ ·o 𝐵) = ∅)
1411, 13sseq12d 3978 . . . . . . 7 ((𝐴 ∈ On ∧ 𝐵 ∈ On) → ((∅ ·o 𝐴) ⊆ (∅ ·o 𝐵) ↔ ∅ ⊆ ∅))
159, 14mpbiri 261 . . . . . 6 ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (∅ ·o 𝐴) ⊆ (∅ ·o 𝐵))
16 oveq1 7418 . . . . . . 7 (𝐶 = ∅ → (𝐶 ·o 𝐴) = (∅ ·o 𝐴))
17 oveq1 7418 . . . . . . 7 (𝐶 = ∅ → (𝐶 ·o 𝐵) = (∅ ·o 𝐵))
1816, 17sseq12d 3978 . . . . . 6 (𝐶 = ∅ → ((𝐶 ·o 𝐴) ⊆ (𝐶 ·o 𝐵) ↔ (∅ ·o 𝐴) ⊆ (∅ ·o 𝐵)))
1915, 18syl5ibrcom 250 . . . . 5 ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐶 = ∅ → (𝐶 ·o 𝐴) ⊆ (𝐶 ·o 𝐵)))
20193adant3 1148 . . . 4 ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ On) → (𝐶 = ∅ → (𝐶 ·o 𝐴) ⊆ (𝐶 ·o 𝐵)))
218, 20sylbird 263 . . 3 ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ On) → (¬ ∅ ∈ 𝐶 → (𝐶 ·o 𝐴) ⊆ (𝐶 ·o 𝐵)))
2221a1dd 51 . 2 ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ On) → (¬ ∅ ∈ 𝐶 → (𝐴𝐵 → (𝐶 ·o 𝐴) ⊆ (𝐶 ·o 𝐵))))
233, 22pm2.61d 181 1 ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ On) → (𝐴𝐵 → (𝐶 ·o 𝐴) ⊆ (𝐶 ·o 𝐵)))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 209  wa 400  w3a 1101   = wceq 1567  wcel 2149  wss 3913  c0 4294  Ord word 6360  Oncon0 6361  (class class class)co 7411   ·o comu 8451
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 5242  ax-sep 5261  ax-nul 5271  ax-pr 5405  ax-un 7733
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-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 4493  df-pw 4569  df-sn 4595  df-pr 4597  df-op 4601  df-uni 4877  df-iun 4962  df-br 5114  df-opab 5178  df-mpt 5197  df-tr 5223  df-id 5557  df-eprel 5562  df-po 5570  df-so 5571  df-fr 5615  df-we 5617  df-xp 5668  df-rel 5669  df-cnv 5670  df-co 5671  df-dm 5672  df-rn 5673  df-res 5674  df-ima 5675  df-pred 6303  df-ord 6364  df-on 6365  df-lim 6366  df-suc 6367  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-f1 6542  df-fo 6543  df-f1o 6544  df-fv 6545  df-ov 7414  df-oprab 7415  df-mpo 7416  df-om 7863  df-2nd 7987  df-frecs 8278  df-wrecs 8309  df-recs 8358  df-rdg 8397  df-oadd 8457  df-omul 8458
This theorem is referenced by:  omword1  8558  omass  8565  omeulem1  8567  oewordri  8578  oeoalem  8582  oeeui  8588  oaabs2  8635  omxpenlem  9066  cantnflt  9641  cantnflem1d  9657  omabs2  43951  naddwordnexlem0  44015  oaltom  44023
  Copyright terms: Public domain W3C validator