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

Theorem genpassg 7522
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 7520 . 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 7521 . 2  |-  ( ( A  e.  P.  /\  B  e.  P.  /\  C  e.  P. )  ->  ( 2nd `  ( ( A F B ) F C ) )  =  ( 2nd `  ( A F ( B F C ) ) ) )
84caovcl 6026 . . . . 5  |-  ( ( A  e.  P.  /\  B  e.  P. )  ->  ( A F B )  e.  P. )
94caovcl 6026 . . . . 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 1194 . . 3  |-  ( ( A  e.  P.  /\  B  e.  P.  /\  C  e.  P. )  ->  (
( A F B ) F C )  e.  P. )
124caovcl 6026 . . . . 5  |-  ( ( B  e.  P.  /\  C  e.  P. )  ->  ( B F C )  e.  P. )
134caovcl 6026 . . . . 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 1199 . . 3  |-  ( ( A  e.  P.  /\  B  e.  P.  /\  C  e.  P. )  ->  ( A F ( B F C ) )  e. 
P. )
16 preqlu 7468 . . 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 411 . 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 944 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 978    = wceq 1353    e. wcel 2148   E.wrex 2456   {crab 2459   <.cop 3595    X. cxp 4623   dom cdm 4625   ` cfv 5215  (class class class)co 5872    e. cmpo 5874   1stc1st 6136   2ndc2nd 6137   Q.cnq 7276   P.cnp 7287
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 614  ax-in2 615  ax-io 709  ax-5 1447  ax-7 1448  ax-gen 1449  ax-ie1 1493  ax-ie2 1494  ax-8 1504  ax-10 1505  ax-11 1506  ax-i12 1507  ax-bndl 1509  ax-4 1510  ax-17 1526  ax-i9 1530  ax-ial 1534  ax-i5r 1535  ax-13 2150  ax-14 2151  ax-ext 2159  ax-coll 4117  ax-sep 4120  ax-pow 4173  ax-pr 4208  ax-un 4432  ax-setind 4535  ax-iinf 4586
This theorem depends on definitions:  df-bi 117  df-3an 980  df-tru 1356  df-fal 1359  df-nf 1461  df-sb 1763  df-eu 2029  df-mo 2030  df-clab 2164  df-cleq 2170  df-clel 2173  df-nfc 2308  df-ne 2348  df-ral 2460  df-rex 2461  df-reu 2462  df-rab 2464  df-v 2739  df-sbc 2963  df-csb 3058  df-dif 3131  df-un 3133  df-in 3135  df-ss 3142  df-pw 3577  df-sn 3598  df-pr 3599  df-op 3601  df-uni 3810  df-int 3845  df-iun 3888  df-br 4003  df-opab 4064  df-mpt 4065  df-id 4292  df-iom 4589  df-xp 4631  df-rel 4632  df-cnv 4633  df-co 4634  df-dm 4635  df-rn 4636  df-res 4637  df-ima 4638  df-iota 5177  df-fun 5217  df-fn 5218  df-f 5219  df-f1 5220  df-fo 5221  df-f1o 5222  df-fv 5223  df-ov 5875  df-oprab 5876  df-mpo 5877  df-1st 6138  df-2nd 6139  df-qs 6538  df-ni 7300  df-nqqs 7344  df-inp 7462
This theorem is referenced by:  addassprg  7575  mulassprg  7577
  Copyright terms: Public domain W3C validator