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

Theorem genpassg 7883
Description: Associativity of an operation on reals. (Contributed by Jim Kingdon, 11-Dec-2019.)
Hypotheses
Ref Expression
genpelvl.1  |-  F  =  ( w  e.  P. ,  v  e.  P.  |->  <. { x  e.  Q.  |  E. y  e.  Q.  E. z  e.  Q.  (
y  e.  ( 1st `  w )  /\  z  e.  ( 1st `  v
)  /\  x  =  ( y G z ) ) } ,  { x  e.  Q.  |  E. y  e.  Q.  E. z  e.  Q.  (
y  e.  ( 2nd `  w )  /\  z  e.  ( 2nd `  v
)  /\  x  =  ( y G z ) ) } >. )
genpelvl.2  |-  ( ( y  e.  Q.  /\  z  e.  Q. )  ->  ( y G z )  e.  Q. )
genpassg.4  |-  dom  F  =  ( P.  X.  P. )
genpassg.5  |-  ( ( f  e.  P.  /\  g  e.  P. )  ->  ( f F g )  e.  P. )
genpassg.6  |-  ( ( f  e.  Q.  /\  g  e.  Q.  /\  h  e.  Q. )  ->  (
( f G g ) G h )  =  ( f G ( g G h ) ) )
Assertion
Ref Expression
genpassg  |-  ( ( A  e.  P.  /\  B  e.  P.  /\  C  e.  P. )  ->  (
( A F B ) F C )  =  ( A F ( B F C ) ) )
Distinct variable groups:    x, y, z, f, g, h, w, v, A    x, B, y, z, f, g, h, w, v    x, G, y, z, f, g, h, w, v    f, F, g    C, f, g, h, v, w, x, y, z    h, F, v, w, x, y, z

Proof of Theorem genpassg
StepHypRef Expression
1 genpelvl.1 . . 3  |-  F  =  ( w  e.  P. ,  v  e.  P.  |->  <. { x  e.  Q.  |  E. y  e.  Q.  E. z  e.  Q.  (
y  e.  ( 1st `  w )  /\  z  e.  ( 1st `  v
)  /\  x  =  ( y G z ) ) } ,  { x  e.  Q.  |  E. y  e.  Q.  E. z  e.  Q.  (
y  e.  ( 2nd `  w )  /\  z  e.  ( 2nd `  v
)  /\  x  =  ( y G z ) ) } >. )
2 genpelvl.2 . . 3  |-  ( ( y  e.  Q.  /\  z  e.  Q. )  ->  ( y G z )  e.  Q. )
3 genpassg.4 . . 3  |-  dom  F  =  ( P.  X.  P. )
4 genpassg.5 . . 3  |-  ( ( f  e.  P.  /\  g  e.  P. )  ->  ( f F g )  e.  P. )
5 genpassg.6 . . 3  |-  ( ( f  e.  Q.  /\  g  e.  Q.  /\  h  e.  Q. )  ->  (
( f G g ) G h )  =  ( f G ( g G h ) ) )
61, 2, 3, 4, 5genpassl 7881 . 2  |-  ( ( A  e.  P.  /\  B  e.  P.  /\  C  e.  P. )  ->  ( 1st `  ( ( A F B ) F C ) )  =  ( 1st `  ( A F ( B F C ) ) ) )
71, 2, 3, 4, 5genpassu 7882 . 2  |-  ( ( A  e.  P.  /\  B  e.  P.  /\  C  e.  P. )  ->  ( 2nd `  ( ( A F B ) F C ) )  =  ( 2nd `  ( A F ( B F C ) ) ) )
84caovcl 6234 . . . . 5  |-  ( ( A  e.  P.  /\  B  e.  P. )  ->  ( A F B )  e.  P. )
94caovcl 6234 . . . . 5  |-  ( ( ( A F B )  e.  P.  /\  C  e.  P. )  ->  ( ( A F B ) F C )  e.  P. )
108, 9sylan 283 . . . 4  |-  ( ( ( A  e.  P.  /\  B  e.  P. )  /\  C  e.  P. )  ->  ( ( A F B ) F C )  e.  P. )
11103impa 1225 . . 3  |-  ( ( A  e.  P.  /\  B  e.  P.  /\  C  e.  P. )  ->  (
( A F B ) F C )  e.  P. )
124caovcl 6234 . . . . 5  |-  ( ( B  e.  P.  /\  C  e.  P. )  ->  ( B F C )  e.  P. )
134caovcl 6234 . . . . 5  |-  ( ( A  e.  P.  /\  ( B F C )  e.  P. )  -> 
( A F ( B F C ) )  e.  P. )
1412, 13sylan2 286 . . . 4  |-  ( ( A  e.  P.  /\  ( B  e.  P.  /\  C  e.  P. )
)  ->  ( A F ( B F C ) )  e. 
P. )
15143impb 1230 . . 3  |-  ( ( A  e.  P.  /\  B  e.  P.  /\  C  e.  P. )  ->  ( A F ( B F C ) )  e. 
P. )
16 preqlu 7829 . . 3  |-  ( ( ( ( A F B ) F C )  e.  P.  /\  ( A F ( B F C ) )  e.  P. )  -> 
( ( ( A F B ) F C )  =  ( A F ( B F C ) )  <-> 
( ( 1st `  (
( A F B ) F C ) )  =  ( 1st `  ( A F ( B F C ) ) )  /\  ( 2nd `  ( ( A F B ) F C ) )  =  ( 2nd `  ( A F ( B F C ) ) ) ) ) )
1711, 15, 16syl2anc 415 . 2  |-  ( ( A  e.  P.  /\  B  e.  P.  /\  C  e.  P. )  ->  (
( ( A F B ) F C )  =  ( A F ( B F C ) )  <->  ( ( 1st `  ( ( A F B ) F C ) )  =  ( 1st `  ( A F ( B F C ) ) )  /\  ( 2nd `  (
( A F B ) F C ) )  =  ( 2nd `  ( A F ( B F C ) ) ) ) ) )
186, 7, 17mpbir2and 957 1  |-  ( ( A  e.  P.  /\  B  e.  P.  /\  C  e.  P. )  ->  (
( A F B ) F C )  =  ( A F ( B F C ) ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    <-> wb 105    /\ w3a 1009    = wceq 1402    e. wcel 2209   E.wrex 2529   {crab 2532   <.cop 3708    X. cxp 4767   dom cdm 4769   ` cfv 5372  (class class class)co 6075    e. cmpo 6077   1stc1st 6362   2ndc2nd 6363   Q.cnq 7637   P.cnp 7648
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-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-coll 4241  ax-sep 4244  ax-pow 4306  ax-pr 4341  ax-un 4573  ax-setind 4679  ax-iinf 4730
This theorem depends on definitions:  df-bi 117  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-ral 2533  df-rex 2534  df-reu 2535  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 3687  df-sn 3711  df-pr 3712  df-op 3714  df-uni 3931  df-int 3966  df-iun 4009  df-br 4126  df-opab 4188  df-mpt 4189  df-id 4433  df-iom 4733  df-xp 4775  df-rel 4776  df-cnv 4777  df-co 4778  df-dm 4779  df-rn 4780  df-res 4781  df-ima 4782  df-iota 5332  df-fun 5374  df-fn 5375  df-f 5376  df-f1 5377  df-fo 5378  df-f1o 5379  df-fv 5380  df-ov 6078  df-oprab 6079  df-mpo 6080  df-1st 6364  df-2nd 6365  df-qs 6803  df-ni 7661  df-nqqs 7705  df-inp 7823
This theorem is referenced by:  addassprg  7936  mulassprg  7938
  Copyright terms: Public domain W3C validator