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

Theorem eroprf2 6903
Description: Functionality of an operation defined on equivalence classes. (Contributed by Jeff Madsen, 10-Jun-2010.)
Hypotheses
Ref Expression
eropr2.1  |-  J  =  ( A /.  .~  )
eropr2.2  |-  .+^  =  { <. <. x ,  y
>. ,  z >.  |  E. p  e.  A  E. q  e.  A  ( ( x  =  [ p ]  .~  /\  y  =  [ q ]  .~  )  /\  z  =  [ (
p  .+  q ) ]  .~  ) }
eropr2.3  |-  ( ph  ->  .~  e.  X )
eropr2.4  |-  ( ph  ->  .~  Er  U )
eropr2.5  |-  ( ph  ->  A  C_  U )
eropr2.6  |-  ( ph  ->  .+  : ( A  X.  A ) --> A )
eropr2.7  |-  ( (
ph  /\  ( (
r  e.  A  /\  s  e.  A )  /\  ( t  e.  A  /\  u  e.  A
) ) )  -> 
( ( r  .~  s  /\  t  .~  u
)  ->  ( r  .+  t )  .~  (
s  .+  u )
) )
Assertion
Ref Expression
eroprf2  |-  ( ph  -> 
.+^  : ( J  X.  J ) --> J )
Distinct variable groups:    q, p, r, s, t, u, x, y, z, A    X, p, q, r, s, t, u, z    .+ , p, q, r, s, t, u, x, y, z    .~ , p, q, r, s, t, u, x, y, z    J, p, q, x, y, z    ph, p, q, r, s, t, u, x, y, z
Allowed substitution hints:    .+^ ( x,  y,  z,  u,  t,  s,  r,  q,  p)    U( x,  y,  z,  u,  t,  s,  r,  q,  p)    J( u,  t,  s,  r)    X( x,  y)

Proof of Theorem eroprf2
StepHypRef Expression
1 eropr2.1 . 2  |-  J  =  ( A /.  .~  )
2 eropr2.3 . 2  |-  ( ph  ->  .~  e.  X )
3 eropr2.4 . 2  |-  ( ph  ->  .~  Er  U )
4 eropr2.5 . 2  |-  ( ph  ->  A  C_  U )
5 eropr2.6 . 2  |-  ( ph  ->  .+  : ( A  X.  A ) --> A )
6 eropr2.7 . 2  |-  ( (
ph  /\  ( (
r  e.  A  /\  s  e.  A )  /\  ( t  e.  A  /\  u  e.  A
) ) )  -> 
( ( r  .~  s  /\  t  .~  u
)  ->  ( r  .+  t )  .~  (
s  .+  u )
) )
7 eropr2.2 . 2  |-  .+^  =  { <. <. x ,  y
>. ,  z >.  |  E. p  e.  A  E. q  e.  A  ( ( x  =  [ p ]  .~  /\  y  =  [ q ]  .~  )  /\  z  =  [ (
p  .+  q ) ]  .~  ) }
81, 1, 2, 3, 3, 3, 4, 4, 4, 5, 6, 7, 2, 2, 1eroprf 6902 1  |-  ( ph  -> 
.+^  : ( J  X.  J ) --> J )
Colors of variables:    wff set class
This proof depends on syntax axioms:    -> wi 4    /\ wa 104    = wceq 1402    e. wcel 2209   E.wrex 2529    C_ wss 3220   class class class wbr 4130    X. cxp 4772   -->wf 5373  (class class class)co 6085   {coprab 6086    Er wer 6804   [cec 6805   /.cqs 6806
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  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
This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  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-ral 2533  df-rex 2534  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  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-iun 4014  df-br 4131  df-opab 4193  df-mpt 4194  df-id 4438  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-ov 6088  df-oprab 6089  df-mpo 6090  df-1st 6374  df-2nd 6375  df-er 6807  df-ec 6809  df-qs 6813
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator