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

Theorem dmaddpqlem 7339
Description: Decomposition of a positive fraction into numerator and denominator. Lemma for dmaddpq 7341. (Contributed by Jim Kingdon, 15-Sep-2019.)
Assertion
Ref Expression
dmaddpqlem  |-  ( x  e.  Q.  ->  E. w E. v  x  =  [ <. w ,  v
>. ]  ~Q  )
Distinct variable group:    w, v, x

Proof of Theorem dmaddpqlem
Dummy variable  a is distinct from all other variables.
StepHypRef Expression
1 elqsi 6565 . . 3  |-  ( x  e.  ( ( N. 
X.  N. ) /.  ~Q  )  ->  E. a  e.  ( N.  X.  N. )
x  =  [ a ]  ~Q  )
2 elxpi 4627 . . . . . . . 8  |-  ( a  e.  ( N.  X.  N. )  ->  E. w E. v ( a  = 
<. w ,  v >.  /\  ( w  e.  N.  /\  v  e.  N. )
) )
3 simpl 108 . . . . . . . . 9  |-  ( ( a  =  <. w ,  v >.  /\  (
w  e.  N.  /\  v  e.  N. )
)  ->  a  =  <. w ,  v >.
)
432eximi 1594 . . . . . . . 8  |-  ( E. w E. v ( a  =  <. w ,  v >.  /\  (
w  e.  N.  /\  v  e.  N. )
)  ->  E. w E. v  a  =  <. w ,  v >.
)
52, 4syl 14 . . . . . . 7  |-  ( a  e.  ( N.  X.  N. )  ->  E. w E. v  a  =  <. w ,  v >.
)
65anim1i 338 . . . . . 6  |-  ( ( a  e.  ( N. 
X.  N. )  /\  x  =  [ a ]  ~Q  )  ->  ( E. w E. v  a  =  <. w ,  v >.  /\  x  =  [
a ]  ~Q  )
)
7 19.41vv 1896 . . . . . 6  |-  ( E. w E. v ( a  =  <. w ,  v >.  /\  x  =  [ a ]  ~Q  ) 
<->  ( E. w E. v  a  =  <. w ,  v >.  /\  x  =  [ a ]  ~Q  ) )
86, 7sylibr 133 . . . . 5  |-  ( ( a  e.  ( N. 
X.  N. )  /\  x  =  [ a ]  ~Q  )  ->  E. w E. v
( a  =  <. w ,  v >.  /\  x  =  [ a ]  ~Q  ) )
9 simpr 109 . . . . . . 7  |-  ( ( a  =  <. w ,  v >.  /\  x  =  [ a ]  ~Q  )  ->  x  =  [
a ]  ~Q  )
10 eceq1 6548 . . . . . . . 8  |-  ( a  =  <. w ,  v
>.  ->  [ a ]  ~Q  =  [ <. w ,  v >. ]  ~Q  )
1110adantr 274 . . . . . . 7  |-  ( ( a  =  <. w ,  v >.  /\  x  =  [ a ]  ~Q  )  ->  [ a ]  ~Q  =  [ <. w ,  v >. ]  ~Q  )
129, 11eqtrd 2203 . . . . . 6  |-  ( ( a  =  <. w ,  v >.  /\  x  =  [ a ]  ~Q  )  ->  x  =  [ <. w ,  v >. ]  ~Q  )
13122eximi 1594 . . . . 5  |-  ( E. w E. v ( a  =  <. w ,  v >.  /\  x  =  [ a ]  ~Q  )  ->  E. w E. v  x  =  [ <. w ,  v >. ]  ~Q  )
148, 13syl 14 . . . 4  |-  ( ( a  e.  ( N. 
X.  N. )  /\  x  =  [ a ]  ~Q  )  ->  E. w E. v  x  =  [ <. w ,  v >. ]  ~Q  )
1514rexlimiva 2582 . . 3  |-  ( E. a  e.  ( N. 
X.  N. ) x  =  [ a ]  ~Q  ->  E. w E. v  x  =  [ <. w ,  v >. ]  ~Q  )
161, 15syl 14 . 2  |-  ( x  e.  ( ( N. 
X.  N. ) /.  ~Q  )  ->  E. w E. v  x  =  [ <. w ,  v >. ]  ~Q  )
17 df-nqqs 7310 . 2  |-  Q.  =  ( ( N.  X.  N. ) /.  ~Q  )
1816, 17eleq2s 2265 1  |-  ( x  e.  Q.  ->  E. w E. v  x  =  [ <. w ,  v
>. ]  ~Q  )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 103    = wceq 1348   E.wex 1485    e. wcel 2141   E.wrex 2449   <.cop 3586    X. cxp 4609   [cec 6511   /.cqs 6512   N.cnpi 7234    ~Q ceq 7241   Q.cnq 7242
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-io 704  ax-5 1440  ax-7 1441  ax-gen 1442  ax-ie1 1486  ax-ie2 1487  ax-8 1497  ax-10 1498  ax-11 1499  ax-i12 1500  ax-bndl 1502  ax-4 1503  ax-17 1519  ax-i9 1523  ax-ial 1527  ax-i5r 1528  ax-ext 2152
This theorem depends on definitions:  df-bi 116  df-3an 975  df-tru 1351  df-nf 1454  df-sb 1756  df-clab 2157  df-cleq 2163  df-clel 2166  df-nfc 2301  df-ral 2453  df-rex 2454  df-v 2732  df-un 3125  df-in 3127  df-ss 3134  df-sn 3589  df-pr 3590  df-op 3592  df-br 3990  df-opab 4051  df-xp 4617  df-cnv 4619  df-dm 4621  df-rn 4622  df-res 4623  df-ima 4624  df-ec 6515  df-qs 6519  df-nqqs 7310
This theorem is referenced by:  dmaddpq  7341  dmmulpq  7342
  Copyright terms: Public domain W3C validator