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

Theorem omwordi 8191
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 8190 . . . 4 (((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ On) ∧ ∅ ∈ 𝐶) → (𝐴𝐵 ↔ (𝐶 ·o 𝐴) ⊆ (𝐶 ·o 𝐵)))
21biimpd 231 . . 3 (((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ On) ∧ ∅ ∈ 𝐶) → (𝐴𝐵 → (𝐶 ·o 𝐴) ⊆ (𝐶 ·o 𝐵)))
32ex 415 . 2 ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ On) → (∅ ∈ 𝐶 → (𝐴𝐵 → (𝐶 ·o 𝐴) ⊆ (𝐶 ·o 𝐵))))
4 eloni 6196 . . . . . 6 (𝐶 ∈ On → Ord 𝐶)
5 ord0eln0 6240 . . . . . . 7 (Ord 𝐶 → (∅ ∈ 𝐶𝐶 ≠ ∅))
65necon2bbid 3059 . . . . . 6 (Ord 𝐶 → (𝐶 = ∅ ↔ ¬ ∅ ∈ 𝐶))
74, 6syl 17 . . . . 5 (𝐶 ∈ On → (𝐶 = ∅ ↔ ¬ ∅ ∈ 𝐶))
873ad2ant3 1131 . . . 4 ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ On) → (𝐶 = ∅ ↔ ¬ ∅ ∈ 𝐶))
9 ssid 3989 . . . . . . 7 ∅ ⊆ ∅
10 om0r 8158 . . . . . . . . 9 (𝐴 ∈ On → (∅ ·o 𝐴) = ∅)
1110adantr 483 . . . . . . . 8 ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (∅ ·o 𝐴) = ∅)
12 om0r 8158 . . . . . . . . 9 (𝐵 ∈ On → (∅ ·o 𝐵) = ∅)
1312adantl 484 . . . . . . . 8 ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (∅ ·o 𝐵) = ∅)
1411, 13sseq12d 4000 . . . . . . 7 ((𝐴 ∈ On ∧ 𝐵 ∈ On) → ((∅ ·o 𝐴) ⊆ (∅ ·o 𝐵) ↔ ∅ ⊆ ∅))
159, 14mpbiri 260 . . . . . 6 ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (∅ ·o 𝐴) ⊆ (∅ ·o 𝐵))
16 oveq1 7157 . . . . . . 7 (𝐶 = ∅ → (𝐶 ·o 𝐴) = (∅ ·o 𝐴))
17 oveq1 7157 . . . . . . 7 (𝐶 = ∅ → (𝐶 ·o 𝐵) = (∅ ·o 𝐵))
1816, 17sseq12d 4000 . . . . . 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 1533  wcel 2110  wss 3936  c0 4291  Ord word 6185  Oncon0 6186  (class class class)co 7150   ·o comu 8094
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1792  ax-4 1806  ax-5 1907  ax-6 1966  ax-7 2011  ax-8 2112  ax-9 2120  ax-10 2141  ax-11 2156  ax-12 2172  ax-ext 2793  ax-rep 5183  ax-sep 5196  ax-nul 5203  ax-pow 5259  ax-pr 5322  ax-un 7455
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3or 1084  df-3an 1085  df-tru 1536  df-ex 1777  df-nf 1781  df-sb 2066  df-mo 2618  df-eu 2650  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 3497  df-sbc 3773  df-csb 3884  df-dif 3939  df-un 3941  df-in 3943  df-ss 3952  df-pss 3954  df-nul 4292  df-if 4468  df-pw 4541  df-sn 4562  df-pr 4564  df-tp 4566  df-op 4568  df-uni 4833  df-iun 4914  df-br 5060  df-opab 5122  df-mpt 5140  df-tr 5166  df-id 5455  df-eprel 5460  df-po 5469  df-so 5470  df-fr 5509  df-we 5511  df-xp 5556  df-rel 5557  df-cnv 5558  df-co 5559  df-dm 5560  df-rn 5561  df-res 5562  df-ima 5563  df-pred 6143  df-ord 6189  df-on 6190  df-lim 6191  df-suc 6192  df-iota 6309  df-fun 6352  df-fn 6353  df-f 6354  df-f1 6355  df-fo 6356  df-f1o 6357  df-fv 6358  df-ov 7153  df-oprab 7154  df-mpo 7155  df-om 7575  df-wrecs 7941  df-recs 8002  df-rdg 8040  df-oadd 8100  df-omul 8101
This theorem is referenced by:  omword1  8193  omass  8200  omeulem1  8202  oewordri  8212  oeoalem  8216  oeeui  8222  oaabs2  8266  omxpenlem  8612  cantnflt  9129  cantnflem1d  9145
  Copyright terms: Public domain W3C validator