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

Theorem dmaddpqlem 7657
Description: Decomposition of a positive fraction into numerator and denominator. Lemma for dmaddpq 7659. (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 6799 . . 3  |-  ( x  e.  ( ( N. 
X.  N. ) /.  ~Q  )  ->  E. a  e.  ( N.  X.  N. )
x  =  [ a ]  ~Q  )
2 elxpi 4747 . . . . . . . 8  |-  ( a  e.  ( N.  X.  N. )  ->  E. w E. v ( a  = 
<. w ,  v >.  /\  ( w  e.  N.  /\  v  e.  N. )
) )
3 simpl 109 . . . . . . . . 9  |-  ( ( a  =  <. w ,  v >.  /\  (
w  e.  N.  /\  v  e.  N. )
)  ->  a  =  <. w ,  v >.
)
432eximi 1650 . . . . . . . 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 340 . . . . . 6  |-  ( ( a  e.  ( N. 
X.  N. )  /\  x  =  [ a ]  ~Q  )  ->  ( E. w E. v  a  =  <. w ,  v >.  /\  x  =  [
a ]  ~Q  )
)
7 19.41vv 1952 . . . . . 6  |-  ( E. w E. v ( a  =  <. w ,  v >.  /\  x  =  [ a ]  ~Q  ) 
<->  ( E. w E. v  a  =  <. w ,  v >.  /\  x  =  [ a ]  ~Q  ) )
86, 7sylibr 134 . . . . 5  |-  ( ( a  e.  ( N. 
X.  N. )  /\  x  =  [ a ]  ~Q  )  ->  E. w E. v
( a  =  <. w ,  v >.  /\  x  =  [ a ]  ~Q  ) )
9 simpr 110 . . . . . . 7  |-  ( ( a  =  <. w ,  v >.  /\  x  =  [ a ]  ~Q  )  ->  x  =  [
a ]  ~Q  )
10 eceq1 6780 . . . . . . . 8  |-  ( a  =  <. w ,  v
>.  ->  [ a ]  ~Q  =  [ <. w ,  v >. ]  ~Q  )
1110adantr 276 . . . . . . 7  |-  ( ( a  =  <. w ,  v >.  /\  x  =  [ a ]  ~Q  )  ->  [ a ]  ~Q  =  [ <. w ,  v >. ]  ~Q  )
129, 11eqtrd 2264 . . . . . 6  |-  ( ( a  =  <. w ,  v >.  /\  x  =  [ a ]  ~Q  )  ->  x  =  [ <. w ,  v >. ]  ~Q  )
13122eximi 1650 . . . . 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 2646 . . 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 7628 . 2  |-  Q.  =  ( ( N.  X.  N. ) /.  ~Q  )
1816, 17eleq2s 2326 1  |-  ( x  e.  Q.  ->  E. w E. v  x  =  [ <. w ,  v
>. ]  ~Q  )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    = wceq 1398   E.wex 1541    e. wcel 2202   E.wrex 2512   <.cop 3676    X. cxp 4729   [cec 6743   /.cqs 6744   N.cnpi 7552    ~Q ceq 7559   Q.cnq 7560
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-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-ext 2213
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-nf 1510  df-sb 1811  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2364  df-ral 2516  df-rex 2517  df-v 2805  df-un 3205  df-in 3207  df-ss 3214  df-sn 3679  df-pr 3680  df-op 3682  df-br 4094  df-opab 4156  df-xp 4737  df-cnv 4739  df-dm 4741  df-rn 4742  df-res 4743  df-ima 4744  df-ec 6747  df-qs 6751  df-nqqs 7628
This theorem is referenced by:  dmaddpq  7659  dmmulpq  7660
  Copyright terms: Public domain W3C validator