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

Theorem omcan 7210
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 7207 . . . . . . . . 9  |-  ( ( ( C  e.  On  /\  A  e.  On )  /\  (/)  e.  A )  ->  ( B  e.  C  ->  ( A  .o  B )  e.  ( A  .o  C ) ) )
21ex 432 . . . . . . . 8  |-  ( ( C  e.  On  /\  A  e.  On )  ->  ( (/)  e.  A  ->  ( B  e.  C  ->  ( A  .o  B
)  e.  ( A  .o  C ) ) ) )
32ancoms 451 . . . . . . 7  |-  ( ( A  e.  On  /\  C  e.  On )  ->  ( (/)  e.  A  ->  ( B  e.  C  ->  ( A  .o  B
)  e.  ( A  .o  C ) ) ) )
433adant2 1013 . . . . . 6  |-  ( ( A  e.  On  /\  B  e.  On  /\  C  e.  On )  ->  ( (/) 
e.  A  ->  ( B  e.  C  ->  ( A  .o  B )  e.  ( A  .o  C ) ) ) )
54imp 427 . . . . 5  |-  ( ( ( A  e.  On  /\  B  e.  On  /\  C  e.  On )  /\  (/)  e.  A )  ->  ( B  e.  C  ->  ( A  .o  B )  e.  ( A  .o  C ) ) )
6 omordi 7207 . . . . . . . . 9  |-  ( ( ( B  e.  On  /\  A  e.  On )  /\  (/)  e.  A )  ->  ( C  e.  B  ->  ( A  .o  C )  e.  ( A  .o  B ) ) )
76ex 432 . . . . . . . 8  |-  ( ( B  e.  On  /\  A  e.  On )  ->  ( (/)  e.  A  ->  ( C  e.  B  ->  ( A  .o  C
)  e.  ( A  .o  B ) ) ) )
87ancoms 451 . . . . . . 7  |-  ( ( A  e.  On  /\  B  e.  On )  ->  ( (/)  e.  A  ->  ( C  e.  B  ->  ( A  .o  C
)  e.  ( A  .o  B ) ) ) )
983adant3 1014 . . . . . 6  |-  ( ( A  e.  On  /\  B  e.  On  /\  C  e.  On )  ->  ( (/) 
e.  A  ->  ( C  e.  B  ->  ( A  .o  C )  e.  ( A  .o  B ) ) ) )
109imp 427 . . . . 5  |-  ( ( ( A  e.  On  /\  B  e.  On  /\  C  e.  On )  /\  (/)  e.  A )  ->  ( C  e.  B  ->  ( A  .o  C )  e.  ( A  .o  B ) ) )
115, 10orim12d 836 . . . 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 7178 . . . . . . 7  |-  ( ( A  e.  On  /\  B  e.  On )  ->  ( A  .o  B
)  e.  On )
14 eloni 4877 . . . . . . 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 7178 . . . . . . 7  |-  ( ( A  e.  On  /\  C  e.  On )  ->  ( A  .o  C
)  e.  On )
17 eloni 4877 . . . . . . 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 4903 . . . . . 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 475 . . . . 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 1281 . . . 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 463 . . 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 4877 . . . . . 6  |-  ( B  e.  On  ->  Ord  B )
24 eloni 4877 . . . . . 6  |-  ( C  e.  On  ->  Ord  C )
25 ordtri3 4903 . . . . . 6  |-  ( ( Ord  B  /\  Ord  C )  ->  ( B  =  C  <->  -.  ( B  e.  C  \/  C  e.  B ) ) )
2623, 24, 25syl2an 475 . . . . 5  |-  ( ( B  e.  On  /\  C  e.  On )  ->  ( B  =  C  <->  -.  ( B  e.  C  \/  C  e.  B
) ) )
27263adant1 1012 . . . 4  |-  ( ( A  e.  On  /\  B  e.  On  /\  C  e.  On )  ->  ( B  =  C  <->  -.  ( B  e.  C  \/  C  e.  B )
) )
2827adantr 463 . . 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 6278 . 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 366    /\ wa 367    /\ w3a 971    = wceq 1398    e. wcel 1823   (/)c0 3783   Ord word 4866   Oncon0 4867  (class class class)co 6270    .o comu 7120
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1623  ax-4 1636  ax-5 1709  ax-6 1752  ax-7 1795  ax-8 1825  ax-9 1827  ax-10 1842  ax-11 1847  ax-12 1859  ax-13 2004  ax-ext 2432  ax-rep 4550  ax-sep 4560  ax-nul 4568  ax-pow 4615  ax-pr 4676  ax-un 6565
This theorem depends on definitions:  df-bi 185  df-or 368  df-an 369  df-3or 972  df-3an 973  df-tru 1401  df-ex 1618  df-nf 1622  df-sb 1745  df-eu 2288  df-mo 2289  df-clab 2440  df-cleq 2446  df-clel 2449  df-nfc 2604  df-ne 2651  df-ral 2809  df-rex 2810  df-reu 2811  df-rab 2813  df-v 3108  df-sbc 3325  df-csb 3421  df-dif 3464  df-un 3466  df-in 3468  df-ss 3475  df-pss 3477  df-nul 3784  df-if 3930  df-pw 4001  df-sn 4017  df-pr 4019  df-tp 4021  df-op 4023  df-uni 4236  df-iun 4317  df-br 4440  df-opab 4498  df-mpt 4499  df-tr 4533  df-eprel 4780  df-id 4784  df-po 4789  df-so 4790  df-fr 4827  df-we 4829  df-ord 4870  df-on 4871  df-lim 4872  df-suc 4873  df-xp 4994  df-rel 4995  df-cnv 4996  df-co 4997  df-dm 4998  df-rn 4999  df-res 5000  df-ima 5001  df-iota 5534  df-fun 5572  df-fn 5573  df-f 5574  df-f1 5575  df-fo 5576  df-f1o 5577  df-fv 5578  df-ov 6273  df-oprab 6274  df-mpt2 6275  df-om 6674  df-recs 7034  df-rdg 7068  df-oadd 7126  df-omul 7127
This theorem is referenced by:  omword  7211  fin1a2lem4  8774
  Copyright terms: Public domain W3C validator