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

Theorem th3qcor 6617
Description: Corollary of Theorem 3Q of [Enderton] p. 60. (Contributed by NM, 12-Nov-1995.) (Revised by David Abernethy, 4-Jun-2013.)
Hypotheses
Ref Expression
th3q.1  |-  .~  e.  _V
th3q.2  |-  .~  Er  ( S  X.  S
)
th3q.4  |-  ( ( ( ( w  e.  S  /\  v  e.  S )  /\  (
u  e.  S  /\  t  e.  S )
)  /\  ( (
s  e.  S  /\  f  e.  S )  /\  ( g  e.  S  /\  h  e.  S
) ) )  -> 
( ( <. w ,  v >.  .~  <. u ,  t >.  /\  <. s ,  f >.  .~  <. g ,  h >. )  ->  ( <. w ,  v
>.  .+  <. s ,  f
>. )  .~  ( <. u ,  t >.  .+  <. g ,  h >. ) ) )
th3q.5  |-  G  =  { <. <. x ,  y
>. ,  z >.  |  ( ( x  e.  ( ( S  X.  S ) /.  .~  )  /\  y  e.  ( ( S  X.  S
) /.  .~  )
)  /\  E. w E. v E. u E. t ( ( x  =  [ <. w ,  v >. ]  .~  /\  y  =  [ <. u ,  t >. ]  .~  )  /\  z  =  [
( <. w ,  v
>.  .+  <. u ,  t
>. ) ]  .~  )
) }
Assertion
Ref Expression
th3qcor  |-  Fun  G
Distinct variable groups:    x, y, z, w, v, u, t, s, f, g, h, 
.~    x, S, y, z, w, v, u, t, s, f, g, h   
x,  .+ , y, z, w, v, u, t, s, f, g, h
Allowed substitution hints:    G( x, y, z, w, v, u, t, f, g, h, s)

Proof of Theorem th3qcor
StepHypRef Expression
1 th3q.1 . . . . 5  |-  .~  e.  _V
2 th3q.2 . . . . 5  |-  .~  Er  ( S  X.  S
)
3 th3q.4 . . . . 5  |-  ( ( ( ( w  e.  S  /\  v  e.  S )  /\  (
u  e.  S  /\  t  e.  S )
)  /\  ( (
s  e.  S  /\  f  e.  S )  /\  ( g  e.  S  /\  h  e.  S
) ) )  -> 
( ( <. w ,  v >.  .~  <. u ,  t >.  /\  <. s ,  f >.  .~  <. g ,  h >. )  ->  ( <. w ,  v
>.  .+  <. s ,  f
>. )  .~  ( <. u ,  t >.  .+  <. g ,  h >. ) ) )
41, 2, 3th3qlem2 6616 . . . 4  |-  ( ( x  e.  ( ( S  X.  S ) /.  .~  )  /\  y  e.  ( ( S  X.  S ) /.  .~  ) )  ->  E* z E. w E. v E. u E. t ( ( x  =  [ <. w ,  v >. ]  .~  /\  y  =  [ <. u ,  t
>. ]  .~  )  /\  z  =  [ ( <. w ,  v >.  .+  <. u ,  t
>. ) ]  .~  )
)
5 moanimv 2094 . . . 4  |-  ( E* z ( ( x  e.  ( ( S  X.  S ) /.  .~  )  /\  y  e.  ( ( S  X.  S ) /.  .~  ) )  /\  E. w E. v E. u E. t ( ( x  =  [ <. w ,  v >. ]  .~  /\  y  =  [ <. u ,  t >. ]  .~  )  /\  z  =  [
( <. w ,  v
>.  .+  <. u ,  t
>. ) ]  .~  )
)  <->  ( ( x  e.  ( ( S  X.  S ) /.  .~  )  /\  y  e.  ( ( S  X.  S ) /.  .~  ) )  ->  E* z E. w E. v E. u E. t ( ( x  =  [ <. w ,  v >. ]  .~  /\  y  =  [ <. u ,  t
>. ]  .~  )  /\  z  =  [ ( <. w ,  v >.  .+  <. u ,  t
>. ) ]  .~  )
) )
64, 5mpbir 145 . . 3  |-  E* z
( ( x  e.  ( ( S  X.  S ) /.  .~  )  /\  y  e.  ( ( S  X.  S
) /.  .~  )
)  /\  E. w E. v E. u E. t ( ( x  =  [ <. w ,  v >. ]  .~  /\  y  =  [ <. u ,  t >. ]  .~  )  /\  z  =  [
( <. w ,  v
>.  .+  <. u ,  t
>. ) ]  .~  )
)
76funoprab 5953 . 2  |-  Fun  { <. <. x ,  y
>. ,  z >.  |  ( ( x  e.  ( ( S  X.  S ) /.  .~  )  /\  y  e.  ( ( S  X.  S
) /.  .~  )
)  /\  E. w E. v E. u E. t ( ( x  =  [ <. w ,  v >. ]  .~  /\  y  =  [ <. u ,  t >. ]  .~  )  /\  z  =  [
( <. w ,  v
>.  .+  <. u ,  t
>. ) ]  .~  )
) }
8 th3q.5 . . 3  |-  G  =  { <. <. x ,  y
>. ,  z >.  |  ( ( x  e.  ( ( S  X.  S ) /.  .~  )  /\  y  e.  ( ( S  X.  S
) /.  .~  )
)  /\  E. w E. v E. u E. t ( ( x  =  [ <. w ,  v >. ]  .~  /\  y  =  [ <. u ,  t >. ]  .~  )  /\  z  =  [
( <. w ,  v
>.  .+  <. u ,  t
>. ) ]  .~  )
) }
98funeqi 5219 . 2  |-  ( Fun 
G  <->  Fun  { <. <. x ,  y >. ,  z
>.  |  ( (
x  e.  ( ( S  X.  S ) /.  .~  )  /\  y  e.  ( ( S  X.  S ) /.  .~  ) )  /\  E. w E. v E. u E. t ( ( x  =  [ <. w ,  v >. ]  .~  /\  y  =  [ <. u ,  t >. ]  .~  )  /\  z  =  [
( <. w ,  v
>.  .+  <. u ,  t
>. ) ]  .~  )
) } )
107, 9mpbir 145 1  |-  Fun  G
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 103    = wceq 1348   E.wex 1485   E*wmo 2020    e. wcel 2141   _Vcvv 2730   <.cop 3586   class class class wbr 3989    X. cxp 4609   Fun wfun 5192  (class class class)co 5853   {coprab 5854    Er wer 6510   [cec 6511   /.cqs 6512
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-14 2144  ax-ext 2152  ax-sep 4107  ax-pow 4160  ax-pr 4194
This theorem depends on definitions:  df-bi 116  df-3an 975  df-tru 1351  df-nf 1454  df-sb 1756  df-eu 2022  df-mo 2023  df-clab 2157  df-cleq 2163  df-clel 2166  df-nfc 2301  df-ral 2453  df-rex 2454  df-v 2732  df-sbc 2956  df-un 3125  df-in 3127  df-ss 3134  df-pw 3568  df-sn 3589  df-pr 3590  df-op 3592  df-uni 3797  df-br 3990  df-opab 4051  df-id 4278  df-xp 4617  df-rel 4618  df-cnv 4619  df-co 4620  df-dm 4621  df-rn 4622  df-res 4623  df-ima 4624  df-iota 5160  df-fun 5200  df-fv 5206  df-ov 5856  df-oprab 5857  df-er 6513  df-ec 6515  df-qs 6519
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator