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

Theorem omwordi 8183
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 8182 . . . 4 (((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ On) ∧ ∅ ∈ 𝐶) → (𝐴𝐵 ↔ (𝐶 ·o 𝐴) ⊆ (𝐶 ·o 𝐵)))
21biimpd 231 . . 3 (((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ On) ∧ ∅ ∈ 𝐶) → (𝐴𝐵 → (𝐶 ·o 𝐴) ⊆ (𝐶 ·o 𝐵)))
32ex 415 . 2 ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ On) → (∅ ∈ 𝐶 → (𝐴𝐵 → (𝐶 ·o 𝐴) ⊆ (𝐶 ·o 𝐵))))
4 eloni 6187 . . . . . 6 (𝐶 ∈ On → Ord 𝐶)
5 ord0eln0 6231 . . . . . . 7 (Ord 𝐶 → (∅ ∈ 𝐶𝐶 ≠ ∅))
65necon2bbid 3059 . . . . . 6 (Ord 𝐶 → (𝐶 = ∅ ↔ ¬ ∅ ∈ 𝐶))
74, 6syl 17 . . . . 5 (𝐶 ∈ On → (𝐶 = ∅ ↔ ¬ ∅ ∈ 𝐶))
873ad2ant3 1131 . . . 4 ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ On) → (𝐶 = ∅ ↔ ¬ ∅ ∈ 𝐶))
9 ssid 3977 . . . . . . 7 ∅ ⊆ ∅
10 om0r 8150 . . . . . . . . 9 (𝐴 ∈ On → (∅ ·o 𝐴) = ∅)
1110adantr 483 . . . . . . . 8 ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (∅ ·o 𝐴) = ∅)
12 om0r 8150 . . . . . . . . 9 (𝐵 ∈ On → (∅ ·o 𝐵) = ∅)
1312adantl 484 . . . . . . . 8 ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (∅ ·o 𝐵) = ∅)
1411, 13sseq12d 3988 . . . . . . 7 ((𝐴 ∈ On ∧ 𝐵 ∈ On) → ((∅ ·o 𝐴) ⊆ (∅ ·o 𝐵) ↔ ∅ ⊆ ∅))
159, 14mpbiri 260 . . . . . 6 ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (∅ ·o 𝐴) ⊆ (∅ ·o 𝐵))
16 oveq1 7149 . . . . . . 7 (𝐶 = ∅ → (𝐶 ·o 𝐴) = (∅ ·o 𝐴))
17 oveq1 7149 . . . . . . 7 (𝐶 = ∅ → (𝐶 ·o 𝐵) = (∅ ·o 𝐵))
1816, 17sseq12d 3988 . . . . . 6 (𝐶 = ∅ → ((𝐶 ·o 𝐴) ⊆ (𝐶 ·o 𝐵) ↔ (∅ ·o 𝐴) ⊆ (∅ ·o 𝐵)))
1915, 18syl5ibrcom 249 . . . . 5 ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐶 = ∅ → (𝐶 ·o 𝐴) ⊆ (𝐶 ·o 𝐵)))
20193adant3 1128 . . . 4 ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ On) → (𝐶 = ∅ → (𝐶 ·o 𝐴) ⊆ (𝐶 ·o 𝐵)))
218, 20sylbird 262 . . 3 ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ On) → (¬ ∅ ∈ 𝐶 → (𝐶 ·o 𝐴) ⊆ (𝐶 ·o 𝐵)))
2221a1dd 50 . 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 208  wa 398  w3a 1083   = wceq 1537  wcel 2114  wss 3924  c0 4279  Ord word 6176  Oncon0 6177  (class class class)co 7142   ·o comu 8086
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2116  ax-9 2124  ax-10 2145  ax-11 2161  ax-12 2177  ax-ext 2793  ax-rep 5176  ax-sep 5189  ax-nul 5196  ax-pow 5252  ax-pr 5316  ax-un 7447
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3or 1084  df-3an 1085  df-tru 1540  df-ex 1781  df-nf 1785  df-sb 2070  df-mo 2622  df-eu 2654  df-clab 2800  df-cleq 2814  df-clel 2893  df-nfc 2963  df-ne 3017  df-ral 3143  df-rex 3144  df-reu 3145  df-rab 3147  df-v 3488  df-sbc 3764  df-csb 3872  df-dif 3927  df-un 3929  df-in 3931  df-ss 3940  df-pss 3942  df-nul 4280  df-if 4454  df-pw 4527  df-sn 4554  df-pr 4556  df-tp 4558  df-op 4560  df-uni 4825  df-iun 4907  df-br 5053  df-opab 5115  df-mpt 5133  df-tr 5159  df-id 5446  df-eprel 5451  df-po 5460  df-so 5461  df-fr 5500  df-we 5502  df-xp 5547  df-rel 5548  df-cnv 5549  df-co 5550  df-dm 5551  df-rn 5552  df-res 5553  df-ima 5554  df-pred 6134  df-ord 6180  df-on 6181  df-lim 6182  df-suc 6183  df-iota 6300  df-fun 6343  df-fn 6344  df-f 6345  df-f1 6346  df-fo 6347  df-f1o 6348  df-fv 6349  df-ov 7145  df-oprab 7146  df-mpo 7147  df-om 7567  df-wrecs 7933  df-recs 7994  df-rdg 8032  df-oadd 8092  df-omul 8093
This theorem is referenced by:  omword1  8185  omass  8192  omeulem1  8194  oewordri  8204  oeoalem  8208  oeeui  8214  oaabs2  8258  omxpenlem  8604  cantnflt  9121  cantnflem1d  9137
  Copyright terms: Public domain W3C validator