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

Theorem irrmulap 10050
Description: The product of an irrational with a nonzero rational is irrational. By irrational we mean apart from any rational number. For a similar theorem with not rational in place of irrational, see irrmul 10049. (Contributed by Jim Kingdon, 25-Aug-2025.)
Hypotheses
Ref Expression
irrmulap.a  |-  ( ph  ->  A  e.  RR )
irrmulap.aq  |-  ( ph  ->  A. q  e.  QQ  A #  q )
irrmulap.b  |-  ( ph  ->  B  e.  QQ )
irrmulap.b0  |-  ( ph  ->  B  =/=  0 )
irrmulap.q  |-  ( ph  ->  Q  e.  QQ )
Assertion
Ref Expression
irrmulap  |-  ( ph  ->  ( A  x.  B
) #  Q )
Distinct variable groups:    A, q    B, q    Q, q
Allowed substitution hint:    ph( q)

Proof of Theorem irrmulap
StepHypRef Expression
1 breq2 4134 . . . 4  |-  ( q  =  ( Q  /  B )  ->  ( A #  q  <->  A #  ( Q  /  B ) ) )
2 irrmulap.aq . . . 4  |-  ( ph  ->  A. q  e.  QQ  A #  q )
3 irrmulap.q . . . . 5  |-  ( ph  ->  Q  e.  QQ )
4 irrmulap.b . . . . 5  |-  ( ph  ->  B  e.  QQ )
5 irrmulap.b0 . . . . 5  |-  ( ph  ->  B  =/=  0 )
6 qdivcl 10045 . . . . 5  |-  ( ( Q  e.  QQ  /\  B  e.  QQ  /\  B  =/=  0 )  ->  ( Q  /  B )  e.  QQ )
73, 4, 5, 6syl3anc 1278 . . . 4  |-  ( ph  ->  ( Q  /  B
)  e.  QQ )
81, 2, 7rspcdva 2934 . . 3  |-  ( ph  ->  A #  ( Q  /  B ) )
9 qcn 10036 . . . . 5  |-  ( ( Q  /  B )  e.  QQ  ->  ( Q  /  B )  e.  CC )
107, 9syl 14 . . . 4  |-  ( ph  ->  ( Q  /  B
)  e.  CC )
11 irrmulap.a . . . . 5  |-  ( ph  ->  A  e.  RR )
1211recnd 8354 . . . 4  |-  ( ph  ->  A  e.  CC )
13 apsym 8935 . . . 4  |-  ( ( ( Q  /  B
)  e.  CC  /\  A  e.  CC )  ->  ( ( Q  /  B ) #  A  <->  A #  ( Q  /  B ) ) )
1410, 12, 13syl2anc 415 . . 3  |-  ( ph  ->  ( ( Q  /  B ) #  A  <->  A #  ( Q  /  B ) ) )
158, 14mpbird 167 . 2  |-  ( ph  ->  ( Q  /  B
) #  A )
16 qcn 10036 . . . . 5  |-  ( Q  e.  QQ  ->  Q  e.  CC )
173, 16syl 14 . . . 4  |-  ( ph  ->  Q  e.  CC )
18 qcn 10036 . . . . 5  |-  ( B  e.  QQ  ->  B  e.  CC )
194, 18syl 14 . . . 4  |-  ( ph  ->  B  e.  CC )
20 0z 9657 . . . . . . 7  |-  0  e.  ZZ
21 zq 10028 . . . . . . 7  |-  ( 0  e.  ZZ  ->  0  e.  QQ )
2220, 21ax-mp 5 . . . . . 6  |-  0  e.  QQ
23 qapne 10041 . . . . . 6  |-  ( ( B  e.  QQ  /\  0  e.  QQ )  ->  ( B #  0  <->  B  =/=  0 ) )
244, 22, 23sylancl 417 . . . . 5  |-  ( ph  ->  ( B #  0  <->  B  =/=  0 ) )
255, 24mpbird 167 . . . 4  |-  ( ph  ->  B #  0 )
2617, 19, 12, 25apdivmuld 9144 . . 3  |-  ( ph  ->  ( ( Q  /  B ) #  A  <->  ( B  x.  A ) #  Q ) )
2719, 12mulcomd 8347 . . . 4  |-  ( ph  ->  ( B  x.  A
)  =  ( A  x.  B ) )
2827breq1d 4140 . . 3  |-  ( ph  ->  ( ( B  x.  A ) #  Q  <->  ( A  x.  B ) #  Q ) )
2926, 28bitrd 188 . 2  |-  ( ph  ->  ( ( Q  /  B ) #  A  <->  ( A  x.  B ) #  Q ) )
3015, 29mpbid 147 1  |-  ( ph  ->  ( A  x.  B
) #  Q )
Colors of variables:    wff set class
This proof depends on syntax axioms:    -> wi 4    <-> wb 105    e. wcel 2209    =/= wne 2420   A.wral 2528   class class class wbr 4130  (class class class)co 6085   CCcc 8177   RRcr 8178   0cc0 8179    x. cmul 8184   # cap 8910    / cdiv 9003   ZZcz 9646   QQcq 10021
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 4249  ax-pow 4311  ax-pr 4346  ax-un 4578  ax-setind 4684  ax-cnex 8270  ax-resscn 8271  ax-1cn 8272  ax-1re 8273  ax-icn 8274  ax-addcl 8275  ax-addrcl 8276  ax-mulcl 8277  ax-mulrcl 8278  ax-addcom 8279  ax-mulcom 8280  ax-addass 8281  ax-mulass 8282  ax-distr 8283  ax-i2m1 8284  ax-0lt1 8285  ax-1rid 8286  ax-0id 8287  ax-rnegex 8288  ax-precex 8289  ax-cnre 8290  ax-pre-ltirr 8291  ax-pre-ltwlin 8292  ax-pre-lttrn 8293  ax-pre-apti 8294  ax-pre-ltadd 8295  ax-pre-mulgt0 8296  ax-pre-mulext 8297
This proof depends on definitions:  df-bi 117  df-3or 1010  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-csb 3148  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-int 3971  df-iun 4014  df-br 4131  df-opab 4193  df-mpt 4194  df-id 4438  df-po 4441  df-iso 4442  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-res 4786  df-ima 4787  df-iota 5337  df-fun 5379  df-fn 5380  df-f 5381  df-fv 5385  df-riota 6038  df-ov 6088  df-oprab 6089  df-mpo 6090  df-1st 6374  df-2nd 6375  df-pnf 8362  df-mnf 8363  df-xr 8364  df-ltxr 8365  df-le 8366  df-sub 8499  df-neg 8500  df-reap 8904  df-ap 8911  df-div 9004  df-inn 9306  df-n0 9566  df-z 9647  df-q 10022
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator