ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  mulap0r Unicode version

Theorem mulap0r 8634
Description: A product apart from zero. Lemma 2.13 of [Geuvers], p. 6. (Contributed by Jim Kingdon, 24-Feb-2020.)
Assertion
Ref Expression
mulap0r  |-  ( ( A  e.  CC  /\  B  e.  CC  /\  ( A  x.  B ) #  0 )  ->  ( A #  0  /\  B #  0 ) )

Proof of Theorem mulap0r
StepHypRef Expression
1 simp3 1001 . . . . . 6  |-  ( ( A  e.  CC  /\  B  e.  CC  /\  ( A  x.  B ) #  0 )  ->  ( A  x.  B ) #  0 )
2 simp2 1000 . . . . . . 7  |-  ( ( A  e.  CC  /\  B  e.  CC  /\  ( A  x.  B ) #  0 )  ->  B  e.  CC )
32mul02d 8411 . . . . . 6  |-  ( ( A  e.  CC  /\  B  e.  CC  /\  ( A  x.  B ) #  0 )  ->  (
0  x.  B )  =  0 )
41, 3breqtrrd 4057 . . . . 5  |-  ( ( A  e.  CC  /\  B  e.  CC  /\  ( A  x.  B ) #  0 )  ->  ( A  x.  B ) #  ( 0  x.  B
) )
5 simp1 999 . . . . . 6  |-  ( ( A  e.  CC  /\  B  e.  CC  /\  ( A  x.  B ) #  0 )  ->  A  e.  CC )
6 0cnd 8012 . . . . . 6  |-  ( ( A  e.  CC  /\  B  e.  CC  /\  ( A  x.  B ) #  0 )  ->  0  e.  CC )
7 mulext 8633 . . . . . 6  |-  ( ( ( A  e.  CC  /\  B  e.  CC )  /\  ( 0  e.  CC  /\  B  e.  CC ) )  -> 
( ( A  x.  B ) #  ( 0  x.  B )  -> 
( A #  0  \/  B #  B ) ) )
85, 2, 6, 2, 7syl22anc 1250 . . . . 5  |-  ( ( A  e.  CC  /\  B  e.  CC  /\  ( A  x.  B ) #  0 )  ->  (
( A  x.  B
) #  ( 0  x.  B )  ->  ( A #  0  \/  B #  B ) ) )
94, 8mpd 13 . . . 4  |-  ( ( A  e.  CC  /\  B  e.  CC  /\  ( A  x.  B ) #  0 )  ->  ( A #  0  \/  B #  B ) )
109orcomd 730 . . 3  |-  ( ( A  e.  CC  /\  B  e.  CC  /\  ( A  x.  B ) #  0 )  ->  ( B #  B  \/  A #  0 ) )
11 apirr 8624 . . . 4  |-  ( B  e.  CC  ->  -.  B #  B )
12 biorf 745 . . . 4  |-  ( -.  B #  B  ->  ( A #  0  <->  ( B #  B  \/  A #  0 )
) )
132, 11, 123syl 17 . . 3  |-  ( ( A  e.  CC  /\  B  e.  CC  /\  ( A  x.  B ) #  0 )  ->  ( A #  0  <->  ( B #  B  \/  A #  0 )
) )
1410, 13mpbird 167 . 2  |-  ( ( A  e.  CC  /\  B  e.  CC  /\  ( A  x.  B ) #  0 )  ->  A #  0 )
155mul01d 8412 . . . . 5  |-  ( ( A  e.  CC  /\  B  e.  CC  /\  ( A  x.  B ) #  0 )  ->  ( A  x.  0 )  =  0 )
161, 15breqtrrd 4057 . . . 4  |-  ( ( A  e.  CC  /\  B  e.  CC  /\  ( A  x.  B ) #  0 )  ->  ( A  x.  B ) #  ( A  x.  0
) )
17 mulext 8633 . . . . 5  |-  ( ( ( A  e.  CC  /\  B  e.  CC )  /\  ( A  e.  CC  /\  0  e.  CC ) )  -> 
( ( A  x.  B ) #  ( A  x.  0 )  ->  ( A #  A  \/  B #  0 ) ) )
185, 2, 5, 6, 17syl22anc 1250 . . . 4  |-  ( ( A  e.  CC  /\  B  e.  CC  /\  ( A  x.  B ) #  0 )  ->  (
( A  x.  B
) #  ( A  x.  0 )  ->  ( A #  A  \/  B #  0 ) ) )
1916, 18mpd 13 . . 3  |-  ( ( A  e.  CC  /\  B  e.  CC  /\  ( A  x.  B ) #  0 )  ->  ( A #  A  \/  B #  0 ) )
20 apirr 8624 . . . 4  |-  ( A  e.  CC  ->  -.  A #  A )
21 biorf 745 . . . 4  |-  ( -.  A #  A  ->  ( B #  0  <->  ( A #  A  \/  B #  0 )
) )
225, 20, 213syl 17 . . 3  |-  ( ( A  e.  CC  /\  B  e.  CC  /\  ( A  x.  B ) #  0 )  ->  ( B #  0  <->  ( A #  A  \/  B #  0 )
) )
2319, 22mpbird 167 . 2  |-  ( ( A  e.  CC  /\  B  e.  CC  /\  ( A  x.  B ) #  0 )  ->  B #  0 )
2414, 23jca 306 1  |-  ( ( A  e.  CC  /\  B  e.  CC  /\  ( A  x.  B ) #  0 )  ->  ( A #  0  /\  B #  0 ) )
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4    /\ wa 104    <-> wb 105    \/ wo 709    /\ w3a 980    e. wcel 2164   class class class wbr 4029  (class class class)co 5918   CCcc 7870   0cc0 7872    x. cmul 7877   # cap 8600
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 615  ax-in2 616  ax-io 710  ax-5 1458  ax-7 1459  ax-gen 1460  ax-ie1 1504  ax-ie2 1505  ax-8 1515  ax-10 1516  ax-11 1517  ax-i12 1518  ax-bndl 1520  ax-4 1521  ax-17 1537  ax-i9 1541  ax-ial 1545  ax-i5r 1546  ax-13 2166  ax-14 2167  ax-ext 2175  ax-sep 4147  ax-pow 4203  ax-pr 4238  ax-un 4464  ax-setind 4569  ax-cnex 7963  ax-resscn 7964  ax-1cn 7965  ax-1re 7966  ax-icn 7967  ax-addcl 7968  ax-addrcl 7969  ax-mulcl 7970  ax-mulrcl 7971  ax-addcom 7972  ax-mulcom 7973  ax-addass 7974  ax-mulass 7975  ax-distr 7976  ax-i2m1 7977  ax-0lt1 7978  ax-1rid 7979  ax-0id 7980  ax-rnegex 7981  ax-precex 7982  ax-cnre 7983  ax-pre-ltirr 7984  ax-pre-ltwlin 7985  ax-pre-lttrn 7986  ax-pre-apti 7987  ax-pre-ltadd 7988  ax-pre-mulgt0 7989  ax-pre-mulext 7990
This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1367  df-fal 1370  df-nf 1472  df-sb 1774  df-eu 2045  df-mo 2046  df-clab 2180  df-cleq 2186  df-clel 2189  df-nfc 2325  df-ne 2365  df-nel 2460  df-ral 2477  df-rex 2478  df-reu 2479  df-rab 2481  df-v 2762  df-sbc 2986  df-dif 3155  df-un 3157  df-in 3159  df-ss 3166  df-pw 3603  df-sn 3624  df-pr 3625  df-op 3627  df-uni 3836  df-br 4030  df-opab 4091  df-id 4324  df-xp 4665  df-rel 4666  df-cnv 4667  df-co 4668  df-dm 4669  df-iota 5215  df-fun 5256  df-fv 5262  df-riota 5873  df-ov 5921  df-oprab 5922  df-mpo 5923  df-pnf 8056  df-mnf 8057  df-ltxr 8059  df-sub 8192  df-neg 8193  df-reap 8594  df-ap 8601
This theorem is referenced by:  msqge0  8635  mulge0  8638  mulap0b  8674
  Copyright terms: Public domain W3C validator