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

Theorem omord 8576
Description: Ordering property of ordinal multiplication. Proposition 8.19 of [TakeutiZaring] p. 63. Theorem 3.16 of [Schloeder] p. 9. (Contributed by NM, 14-Dec-2004.)
Assertion
Ref Expression
omord ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ On) → ((𝐴 ∈ 𝐵 ∧ ∅ ∈ 𝐶) ↔ (𝐶 ·o 𝐴) ∈ (𝐶 ·o 𝐵)))

Proof of Theorem omord
StepHypRef Expression
1 omord2 8575 . . . 4 (((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ On) ∧ ∅ ∈ 𝐶) → (𝐴 ∈ 𝐵 ↔ (𝐶 ·o 𝐴) ∈ (𝐶 ·o 𝐵)))
21ex 418 . . 3 ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ On) → (∅ ∈ 𝐶 → (𝐴 ∈ 𝐵 ↔ (𝐶 ·o 𝐴) ∈ (𝐶 ·o 𝐵))))
32pm5.32rd 589 . 2 ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ On) → ((𝐴 ∈ 𝐵 ∧ ∅ ∈ 𝐶) ↔ ((𝐶 ·o 𝐴) ∈ (𝐶 ·o 𝐵) ∧ ∅ ∈ 𝐶)))
4 simpl 488 . . 3 (((𝐶 ·o 𝐴) ∈ (𝐶 ·o 𝐵) ∧ ∅ ∈ 𝐶) → (𝐶 ·o 𝐴) ∈ (𝐶 ·o 𝐵))
5 ne0i 4286 . . . . . . . 8 ((𝐶 ·o 𝐴) ∈ (𝐶 ·o 𝐵) → (𝐶 ·o 𝐵) ≠ ∅)
6 om0r 8547 . . . . . . . . . 10 (𝐵 ∈ On → (∅ ·o 𝐵) = ∅)
7 oveq1 7427 . . . . . . . . . . 11 (𝐶 = ∅ → (𝐶 ·o 𝐵) = (∅ ·o 𝐵))
87eqeq1d 2762 . . . . . . . . . 10 (𝐶 = ∅ → ((𝐶 ·o 𝐵) = ∅ ↔ (∅ ·o 𝐵) = ∅))
96, 8syl5ibrcom 250 . . . . . . . . 9 (𝐵 ∈ On → (𝐶 = ∅ → (𝐶 ·o 𝐵) = ∅))
109necon3d 2976 . . . . . . . 8 (𝐵 ∈ On → ((𝐶 ·o 𝐵) ≠ ∅ → 𝐶 ≠ ∅))
115, 10syl5 35 . . . . . . 7 (𝐵 ∈ On → ((𝐶 ·o 𝐴) ∈ (𝐶 ·o 𝐵) → 𝐶 ≠ ∅))
1211adantr 486 . . . . . 6 ((𝐵 ∈ On ∧ 𝐶 ∈ On) → ((𝐶 ·o 𝐴) ∈ (𝐶 ·o 𝐵) → 𝐶 ≠ ∅))
13 on0eln0 6420 . . . . . . 7 (𝐶 ∈ On → (∅ ∈ 𝐶 ↔ 𝐶 ≠ ∅))
1413adantl 487 . . . . . 6 ((𝐵 ∈ On ∧ 𝐶 ∈ On) → (∅ ∈ 𝐶 ↔ 𝐶 ≠ ∅))
1512, 14sylibrd 262 . . . . 5 ((𝐵 ∈ On ∧ 𝐶 ∈ On) → ((𝐶 ·o 𝐴) ∈ (𝐶 ·o 𝐵) → ∅ ∈ 𝐶))
16153adant1 1148 . . . 4 ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ On) → ((𝐶 ·o 𝐴) ∈ (𝐶 ·o 𝐵) → ∅ ∈ 𝐶))
1716ancld 560 . . 3 ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ On) → ((𝐶 ·o 𝐴) ∈ (𝐶 ·o 𝐵) → ((𝐶 ·o 𝐴) ∈ (𝐶 ·o 𝐵) ∧ ∅ ∈ 𝐶)))
184, 17impbid2 229 . 2 ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ On) → (((𝐶 ·o 𝐴) ∈ (𝐶 ·o 𝐵) ∧ ∅ ∈ 𝐶) ↔ (𝐶 ·o 𝐴) ∈ (𝐶 ·o 𝐵)))
193, 18bitrd 282 1 ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ On) → ((𝐴 ∈ 𝐵 ∧ ∅ ∈ 𝐶) ↔ (𝐶 ·o 𝐴) ∈ (𝐶 ·o 𝐵)))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   = wceq 1569   ∈ wcel 2144   ≠ wne 2955  ∅c0 4278  Oncon0 6362  (class class class)co 7420   ·o comu 8474
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-rep 5231  ax-sep 5248  ax-nul 5259  ax-pr 5390  ax-un 7751
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-reu 3366  df-rab 3413  df-v 3452  df-sbc 3739  df-csb 3847  df-ss 3896  df-pss 4014  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-pw 4558  df-sn 4584  df-pr 4586  df-op 4590  df-uni 4867  df-iun 4952  df-br 5103  df-opab 5167  df-mpt 5186  df-tr 5212  df-id 5545  df-eprel 5550  df-po 5558  df-so 5559  df-fr 5603  df-we 5605  df-xp 5656  df-rel 5657  df-cnv 5658  df-co 5659  df-dm 5660  df-rn 5661  df-res 5662  df-ima 5663  df-pred 6304  df-ord 6365  df-on 6366  df-lim 6367  df-suc 6368  df-iota 6494  df-fun 6540  df-fn 6541  df-f 6542  df-f1 6543  df-fo 6544  df-f1o 6545  df-fv 6546  df-ov 7423  df-oprab 7424  df-mpo 7425  df-om 7878  df-2nd 8002  df-frecs 8299  df-wrecs 8330  df-recs 8379  df-rdg 8418  df-oadd 8480  df-omul 8481
This theorem is used by:  omlimcl  8586  oneo  8589  omord2lim  44302  omord2com  44304
  Copyright terms: Public domain W3C validator