MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  omcan Structured version   Unicode version

Theorem omcan 7220
Description: Left cancellation law for ordinal multiplication. Proposition 8.20 of [TakeutiZaring] p. 63 and its converse. (Contributed by NM, 14-Dec-2004.)
Assertion
Ref Expression
omcan  |-  ( ( ( A  e.  On  /\  B  e.  On  /\  C  e.  On )  /\  (/)  e.  A )  ->  ( ( A  .o  B )  =  ( A  .o  C
)  <->  B  =  C
) )

Proof of Theorem omcan
StepHypRef Expression
1 omordi 7217 . . . . . . . . 9  |-  ( ( ( C  e.  On  /\  A  e.  On )  /\  (/)  e.  A )  ->  ( B  e.  C  ->  ( A  .o  B )  e.  ( A  .o  C ) ) )
21ex 434 . . . . . . . 8  |-  ( ( C  e.  On  /\  A  e.  On )  ->  ( (/)  e.  A  ->  ( B  e.  C  ->  ( A  .o  B
)  e.  ( A  .o  C ) ) ) )
32ancoms 453 . . . . . . 7  |-  ( ( A  e.  On  /\  C  e.  On )  ->  ( (/)  e.  A  ->  ( B  e.  C  ->  ( A  .o  B
)  e.  ( A  .o  C ) ) ) )
433adant2 1016 . . . . . 6  |-  ( ( A  e.  On  /\  B  e.  On  /\  C  e.  On )  ->  ( (/) 
e.  A  ->  ( B  e.  C  ->  ( A  .o  B )  e.  ( A  .o  C ) ) ) )
54imp 429 . . . . 5  |-  ( ( ( A  e.  On  /\  B  e.  On  /\  C  e.  On )  /\  (/)  e.  A )  ->  ( B  e.  C  ->  ( A  .o  B )  e.  ( A  .o  C ) ) )
6 omordi 7217 . . . . . . . . 9  |-  ( ( ( B  e.  On  /\  A  e.  On )  /\  (/)  e.  A )  ->  ( C  e.  B  ->  ( A  .o  C )  e.  ( A  .o  B ) ) )
76ex 434 . . . . . . . 8  |-  ( ( B  e.  On  /\  A  e.  On )  ->  ( (/)  e.  A  ->  ( C  e.  B  ->  ( A  .o  C
)  e.  ( A  .o  B ) ) ) )
87ancoms 453 . . . . . . 7  |-  ( ( A  e.  On  /\  B  e.  On )  ->  ( (/)  e.  A  ->  ( C  e.  B  ->  ( A  .o  C
)  e.  ( A  .o  B ) ) ) )
983adant3 1017 . . . . . 6  |-  ( ( A  e.  On  /\  B  e.  On  /\  C  e.  On )  ->  ( (/) 
e.  A  ->  ( C  e.  B  ->  ( A  .o  C )  e.  ( A  .o  B ) ) ) )
109imp 429 . . . . 5  |-  ( ( ( A  e.  On  /\  B  e.  On  /\  C  e.  On )  /\  (/)  e.  A )  ->  ( C  e.  B  ->  ( A  .o  C )  e.  ( A  .o  B ) ) )
115, 10orim12d 838 . . . 4  |-  ( ( ( A  e.  On  /\  B  e.  On  /\  C  e.  On )  /\  (/)  e.  A )  ->  ( ( B  e.  C  \/  C  e.  B )  ->  (
( A  .o  B
)  e.  ( A  .o  C )  \/  ( A  .o  C
)  e.  ( A  .o  B ) ) ) )
1211con3d 133 . . 3  |-  ( ( ( A  e.  On  /\  B  e.  On  /\  C  e.  On )  /\  (/)  e.  A )  ->  ( -.  (
( A  .o  B
)  e.  ( A  .o  C )  \/  ( A  .o  C
)  e.  ( A  .o  B ) )  ->  -.  ( B  e.  C  \/  C  e.  B ) ) )
13 omcl 7188 . . . . . . 7  |-  ( ( A  e.  On  /\  B  e.  On )  ->  ( A  .o  B
)  e.  On )
14 eloni 4878 . . . . . . 7  |-  ( ( A  .o  B )  e.  On  ->  Ord  ( A  .o  B
) )
1513, 14syl 16 . . . . . 6  |-  ( ( A  e.  On  /\  B  e.  On )  ->  Ord  ( A  .o  B ) )
16 omcl 7188 . . . . . . 7  |-  ( ( A  e.  On  /\  C  e.  On )  ->  ( A  .o  C
)  e.  On )
17 eloni 4878 . . . . . . 7  |-  ( ( A  .o  C )  e.  On  ->  Ord  ( A  .o  C
) )
1816, 17syl 16 . . . . . 6  |-  ( ( A  e.  On  /\  C  e.  On )  ->  Ord  ( A  .o  C ) )
19 ordtri3 4904 . . . . . 6  |-  ( ( Ord  ( A  .o  B )  /\  Ord  ( A  .o  C
) )  ->  (
( A  .o  B
)  =  ( A  .o  C )  <->  -.  (
( A  .o  B
)  e.  ( A  .o  C )  \/  ( A  .o  C
)  e.  ( A  .o  B ) ) ) )
2015, 18, 19syl2an 477 . . . . 5  |-  ( ( ( A  e.  On  /\  B  e.  On )  /\  ( A  e.  On  /\  C  e.  On ) )  -> 
( ( A  .o  B )  =  ( A  .o  C )  <->  -.  ( ( A  .o  B )  e.  ( A  .o  C )  \/  ( A  .o  C )  e.  ( A  .o  B ) ) ) )
21203impdi 1284 . . . 4  |-  ( ( A  e.  On  /\  B  e.  On  /\  C  e.  On )  ->  (
( A  .o  B
)  =  ( A  .o  C )  <->  -.  (
( A  .o  B
)  e.  ( A  .o  C )  \/  ( A  .o  C
)  e.  ( A  .o  B ) ) ) )
2221adantr 465 . . 3  |-  ( ( ( A  e.  On  /\  B  e.  On  /\  C  e.  On )  /\  (/)  e.  A )  ->  ( ( A  .o  B )  =  ( A  .o  C
)  <->  -.  ( ( A  .o  B )  e.  ( A  .o  C
)  \/  ( A  .o  C )  e.  ( A  .o  B
) ) ) )
23 eloni 4878 . . . . . 6  |-  ( B  e.  On  ->  Ord  B )
24 eloni 4878 . . . . . 6  |-  ( C  e.  On  ->  Ord  C )
25 ordtri3 4904 . . . . . 6  |-  ( ( Ord  B  /\  Ord  C )  ->  ( B  =  C  <->  -.  ( B  e.  C  \/  C  e.  B ) ) )
2623, 24, 25syl2an 477 . . . . 5  |-  ( ( B  e.  On  /\  C  e.  On )  ->  ( B  =  C  <->  -.  ( B  e.  C  \/  C  e.  B
) ) )
27263adant1 1015 . . . 4  |-  ( ( A  e.  On  /\  B  e.  On  /\  C  e.  On )  ->  ( B  =  C  <->  -.  ( B  e.  C  \/  C  e.  B )
) )
2827adantr 465 . . 3  |-  ( ( ( A  e.  On  /\  B  e.  On  /\  C  e.  On )  /\  (/)  e.  A )  ->  ( B  =  C  <->  -.  ( B  e.  C  \/  C  e.  B ) ) )
2912, 22, 283imtr4d 268 . 2  |-  ( ( ( A  e.  On  /\  B  e.  On  /\  C  e.  On )  /\  (/)  e.  A )  ->  ( ( A  .o  B )  =  ( A  .o  C
)  ->  B  =  C ) )
30 oveq2 6289 . 2  |-  ( B  =  C  ->  ( A  .o  B )  =  ( A  .o  C
) )
3129, 30impbid1 203 1  |-  ( ( ( A  e.  On  /\  B  e.  On  /\  C  e.  On )  /\  (/)  e.  A )  ->  ( ( A  .o  B )  =  ( A  .o  C
)  <->  B  =  C
) )
Colors of variables: wff setvar class
Syntax hints:   -. wn 3    -> wi 4    <-> wb 184    \/ wo 368    /\ wa 369    /\ w3a 974    = wceq 1383    e. wcel 1804   (/)c0 3770   Ord word 4867   Oncon0 4868  (class class class)co 6281    .o comu 7130
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1605  ax-4 1618  ax-5 1691  ax-6 1734  ax-7 1776  ax-8 1806  ax-9 1808  ax-10 1823  ax-11 1828  ax-12 1840  ax-13 1985  ax-ext 2421  ax-rep 4548  ax-sep 4558  ax-nul 4566  ax-pow 4615  ax-pr 4676  ax-un 6577
This theorem depends on definitions:  df-bi 185  df-or 370  df-an 371  df-3or 975  df-3an 976  df-tru 1386  df-ex 1600  df-nf 1604  df-sb 1727  df-eu 2272  df-mo 2273  df-clab 2429  df-cleq 2435  df-clel 2438  df-nfc 2593  df-ne 2640  df-ral 2798  df-rex 2799  df-reu 2800  df-rab 2802  df-v 3097  df-sbc 3314  df-csb 3421  df-dif 3464  df-un 3466  df-in 3468  df-ss 3475  df-pss 3477  df-nul 3771  df-if 3927  df-pw 3999  df-sn 4015  df-pr 4017  df-tp 4019  df-op 4021  df-uni 4235  df-iun 4317  df-br 4438  df-opab 4496  df-mpt 4497  df-tr 4531  df-eprel 4781  df-id 4785  df-po 4790  df-so 4791  df-fr 4828  df-we 4830  df-ord 4871  df-on 4872  df-lim 4873  df-suc 4874  df-xp 4995  df-rel 4996  df-cnv 4997  df-co 4998  df-dm 4999  df-rn 5000  df-res 5001  df-ima 5002  df-iota 5541  df-fun 5580  df-fn 5581  df-f 5582  df-f1 5583  df-fo 5584  df-f1o 5585  df-fv 5586  df-ov 6284  df-oprab 6285  df-mpt2 6286  df-om 6686  df-recs 7044  df-rdg 7078  df-oadd 7136  df-omul 7137
This theorem is referenced by:  omword  7221  fin1a2lem4  8786
  Copyright terms: Public domain W3C validator