ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  div2negap Unicode version
Theorem div2negap 9073
Description: Quotient of two negatives. (Contributed by Jim Kingdon, 27-Feb-2020.)
Assertion
Ref Expression
div2negap |- ( ( A e. CC /\ B e. CC /\ B # 0 ) -> ( -u A / -u B ) = ( A / B ) )
Proof of Theorem div2negap
StepHypRef Expression
1 negcl 8533 . . . . 5 |- ( B e. CC -> -u B e. CC )
213ad2ant2 1050 . . . 4 |- ( ( A e. CC /\ B e. CC /\ B # 0 ) -> -u B e. CC )
3 simp1 1028 . . . 4 |- ( ( A e. CC /\ B e. CC /\ B # 0 ) -> A e. CC )
4 simp2 1029 . . . 4 |- ( ( A e. CC /\ B e. CC /\ B # 0 ) -> B e. CC )
5 simp3 1030 . . . 4 |- ( ( A e. CC /\ B e. CC /\ B # 0 ) -> B # 0 )
6 div12ap 9032 . . . 4 |- ( ( -u B e. CC /\ A e. CC /\ ( B e. CC /\ B # 0 ) ) -> ( -u B x. ( A / B ) ) = ( A x. ( -u B / B ) ) )
72, 3, 4, 5, 6syl112anc 1282 . . 3 |- ( ( A e. CC /\ B e. CC /\ B # 0 ) -> ( -u B x. ( A / B ) ) = ( A x. ( -u B / B ) ) )
8 divnegap 9044 . . . . . . 7 |- ( ( B e. CC /\ B e. CC /\ B # 0 ) -> -u ( B / B ) = ( -u B / B ) )
94, 8syld3an1 1324 . . . . . 6 |- ( ( A e. CC /\ B e. CC /\ B # 0 ) -> -u ( B / B ) = ( -u B / B ) )
10 dividap 9039 . . . . . . . 8 |- ( ( B e. CC /\ B # 0 ) -> ( B / B ) = 1 )
11103adant1 1046 . . . . . . 7 |- ( ( A e. CC /\ B e. CC /\ B # 0 ) -> ( B / B ) = 1 )
1211negeqd 8528 . . . . . 6 |- ( ( A e. CC /\ B e. CC /\ B # 0 ) -> -u ( B / B ) = -u 1 )
139, 12eqtr3d 2273 . . . . 5 |- ( ( A e. CC /\ B e. CC /\ B # 0 ) -> ( -u B / B ) = -u 1 )
1413oveq2d 6104 . . . 4 |- ( ( A e. CC /\ B e. CC /\ B # 0 ) -> ( A x. ( -u B / B ) ) = ( A x. -u 1 ) )
15 ax-1cn 8278 . . . . . . . 8 |- 1 e. CC
1615negcli 8601 . . . . . . 7 |- -u 1 e. CC
17 mulcom 8314 . . . . . . 7 |- ( ( A e. CC /\ -u 1 e. CC ) -> ( A x. -u 1 ) = ( -u 1 x. A ) )
1816, 17mpan2 429 . . . . . 6 |- ( A e. CC -> ( A x. -u 1 ) = ( -u 1 x. A ) )
19 mulm1 8734 . . . . . 6 |- ( A e. CC -> ( -u 1 x. A ) = -u A )
2018, 19eqtrd 2271 . . . . 5 |- ( A e. CC -> ( A x. -u 1 ) = -u A )
21203ad2ant1 1049 . . . 4 |- ( ( A e. CC /\ B e. CC /\ B # 0 ) -> ( A x. -u 1 ) = -u A )
2214, 21eqtrd 2271 . . 3 |- ( ( A e. CC /\ B e. CC /\ B # 0 ) -> ( A x. ( -u B / B ) ) = -u A )
237, 22eqtrd 2271 . 2 |- ( ( A e. CC /\ B e. CC /\ B # 0 ) -> ( -u B x. ( A / B ) ) = -u A )
24 negcl 8533 . . . 4 |- ( A e. CC -> -u A e. CC )
25243ad2ant1 1049 . . 3 |- ( ( A e. CC /\ B e. CC /\ B # 0 ) -> -u A e. CC )
26 divclap 9016 . . 3 |- ( ( A e. CC /\ B e. CC /\ B # 0 ) -> ( A / B ) e. CC )
27 negap0 8966 . . . . 5 |- ( B e. CC -> ( B # 0 <-> -u B # 0 ) )
2827biimpa 296 . . . 4 |- ( ( B e. CC /\ B # 0 ) -> -u B # 0 )
29283adant1 1046 . . 3 |- ( ( A e. CC /\ B e. CC /\ B # 0 ) -> -u B # 0 )
30 divmulap 9013 . . 3 |- ( ( -u A e. CC /\ ( A / B ) e. CC /\ ( -u B e. CC /\ -u B # 0 ) ) -> ( ( -u A / -u B ) = ( A / B ) <-> ( -u B x. ( A / B ) ) = -u A ) )
3125, 26, 2, 29, 30syl112anc 1282 . 2 |- ( ( A e. CC /\ B e. CC /\ B # 0 ) -> ( ( -u A / -u B ) = ( A / B ) <-> ( -u B x. ( A / B ) ) = -u A ) )
3223, 31mpbird 167 1 |- ( ( A e. CC /\ B e. CC /\ B # 0 ) -> ( -u A / -u B ) = ( A / B ) )
Colors of variables:    wff set class
This proof depends on syntax axioms:   -> wi 4   <-> wb 105   /\ w3a 1009   = wceq 1402   e. wcel 2209   class class class wbr 4131  (class class class)co 6088   CCcc 8183   0cc0 8185   1c1 8186   x. cmul 8190   -ucneg 8505   # cap 8917   / cdiv 9010
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4251  ax-pow 4313  ax-pr 4348  ax-un 4580  ax-setind 4686  ax-cnex 8276  ax-resscn 8277  ax-1cn 8278  ax-1re 8279  ax-icn 8280  ax-addcl 8281  ax-addrcl 8282  ax-mulcl 8283  ax-mulrcl 8284  ax-addcom 8285  ax-mulcom 8286  ax-addass 8287  ax-mulass 8288  ax-distr 8289  ax-i2m1 8290  ax-0lt1 8291  ax-1rid 8292  ax-0id 8293  ax-rnegex 8294  ax-precex 8295  ax-cnre 8296  ax-pre-ltirr 8297  ax-pre-ltwlin 8298  ax-pre-lttrn 8299  ax-pre-apti 8300  ax-pre-ltadd 8301  ax-pre-mulgt0 8302  ax-pre-mulext 8303
This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-nel 2516  df-ral 2533  df-rex 2534  df-reu 2535  df-rmo 2536  df-rab 2537  df-v 2823  df-sbc 3052  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-br 4132  df-opab 4194  df-id 4440  df-po 4443  df-iso 4444  df-xp 4782  df-rel 4783  df-cnv 4784  df-co 4785  df-dm 4786  df-iota 5340  df-fun 5382  df-fv 5388  df-riota 6041  df-ov 6091  df-oprab 6092  df-mpo 6093  df-pnf 8368  df-mnf 8369  df-xr 8370  df-ltxr 8371  df-le 8372  df-sub 8506  df-neg 8507  df-reap 8911  df-ap 8918  df-div 9011
This theorem is used by:  divneg2ap  9074  div2negapd  9143  div2subap  9175
  Copyright terms: Public domain W3C validator