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

Theorem omord 8495
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 8494 . . . 4 (((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ On) ∧ ∅ ∈ 𝐶) → (𝐴𝐵 ↔ (𝐶 ·o 𝐴) ∈ (𝐶 ·o 𝐵)))
21ex 412 . . 3 ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ On) → (∅ ∈ 𝐶 → (𝐴𝐵 ↔ (𝐶 ·o 𝐴) ∈ (𝐶 ·o 𝐵))))
32pm5.32rd 578 . 2 ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ On) → ((𝐴𝐵 ∧ ∅ ∈ 𝐶) ↔ ((𝐶 ·o 𝐴) ∈ (𝐶 ·o 𝐵) ∧ ∅ ∈ 𝐶)))
4 simpl 482 . . 3 (((𝐶 ·o 𝐴) ∈ (𝐶 ·o 𝐵) ∧ ∅ ∈ 𝐶) → (𝐶 ·o 𝐴) ∈ (𝐶 ·o 𝐵))
5 ne0i 4293 . . . . . . . 8 ((𝐶 ·o 𝐴) ∈ (𝐶 ·o 𝐵) → (𝐶 ·o 𝐵) ≠ ∅)
6 om0r 8466 . . . . . . . . . 10 (𝐵 ∈ On → (∅ ·o 𝐵) = ∅)
7 oveq1 7365 . . . . . . . . . . 11 (𝐶 = ∅ → (𝐶 ·o 𝐵) = (∅ ·o 𝐵))
87eqeq1d 2738 . . . . . . . . . 10 (𝐶 = ∅ → ((𝐶 ·o 𝐵) = ∅ ↔ (∅ ·o 𝐵) = ∅))
96, 8syl5ibrcom 247 . . . . . . . . 9 (𝐵 ∈ On → (𝐶 = ∅ → (𝐶 ·o 𝐵) = ∅))
109necon3d 2953 . . . . . . . 8 (𝐵 ∈ On → ((𝐶 ·o 𝐵) ≠ ∅ → 𝐶 ≠ ∅))
115, 10syl5 34 . . . . . . 7 (𝐵 ∈ On → ((𝐶 ·o 𝐴) ∈ (𝐶 ·o 𝐵) → 𝐶 ≠ ∅))
1211adantr 480 . . . . . 6 ((𝐵 ∈ On ∧ 𝐶 ∈ On) → ((𝐶 ·o 𝐴) ∈ (𝐶 ·o 𝐵) → 𝐶 ≠ ∅))
13 on0eln0 6374 . . . . . . 7 (𝐶 ∈ On → (∅ ∈ 𝐶𝐶 ≠ ∅))
1413adantl 481 . . . . . 6 ((𝐵 ∈ On ∧ 𝐶 ∈ On) → (∅ ∈ 𝐶𝐶 ≠ ∅))
1512, 14sylibrd 259 . . . . 5 ((𝐵 ∈ On ∧ 𝐶 ∈ On) → ((𝐶 ·o 𝐴) ∈ (𝐶 ·o 𝐵) → ∅ ∈ 𝐶))
16153adant1 1130 . . . 4 ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ On) → ((𝐶 ·o 𝐴) ∈ (𝐶 ·o 𝐵) → ∅ ∈ 𝐶))
1716ancld 550 . . 3 ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ On) → ((𝐶 ·o 𝐴) ∈ (𝐶 ·o 𝐵) → ((𝐶 ·o 𝐴) ∈ (𝐶 ·o 𝐵) ∧ ∅ ∈ 𝐶)))
184, 17impbid2 226 . 2 ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ On) → (((𝐶 ·o 𝐴) ∈ (𝐶 ·o 𝐵) ∧ ∅ ∈ 𝐶) ↔ (𝐶 ·o 𝐴) ∈ (𝐶 ·o 𝐵)))
193, 18bitrd 279 1 ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ On) → ((𝐴𝐵 ∧ ∅ ∈ 𝐶) ↔ (𝐶 ·o 𝐴) ∈ (𝐶 ·o 𝐵)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wa 395  w3a 1086   = wceq 1541  wcel 2113  wne 2932  c0 4285  Oncon0 6317  (class class class)co 7358   ·o comu 8395
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 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-10 2146  ax-11 2162  ax-12 2184  ax-ext 2708  ax-rep 5224  ax-sep 5241  ax-nul 5251  ax-pr 5377  ax-un 7680
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-mo 2539  df-eu 2569  df-clab 2715  df-cleq 2728  df-clel 2811  df-nfc 2885  df-ne 2933  df-ral 3052  df-rex 3061  df-reu 3351  df-rab 3400  df-v 3442  df-sbc 3741  df-csb 3850  df-dif 3904  df-un 3906  df-in 3908  df-ss 3918  df-pss 3921  df-nul 4286  df-if 4480  df-pw 4556  df-sn 4581  df-pr 4583  df-op 4587  df-uni 4864  df-iun 4948  df-br 5099  df-opab 5161  df-mpt 5180  df-tr 5206  df-id 5519  df-eprel 5524  df-po 5532  df-so 5533  df-fr 5577  df-we 5579  df-xp 5630  df-rel 5631  df-cnv 5632  df-co 5633  df-dm 5634  df-rn 5635  df-res 5636  df-ima 5637  df-pred 6259  df-ord 6320  df-on 6321  df-lim 6322  df-suc 6323  df-iota 6448  df-fun 6494  df-fn 6495  df-f 6496  df-f1 6497  df-fo 6498  df-f1o 6499  df-fv 6500  df-ov 7361  df-oprab 7362  df-mpo 7363  df-om 7809  df-2nd 7934  df-frecs 8223  df-wrecs 8254  df-recs 8303  df-rdg 8341  df-oadd 8401  df-omul 8402
This theorem is referenced by:  omlimcl  8505  oneo  8508  omord2lim  43542  omord2com  43544
  Copyright terms: Public domain W3C validator