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

Theorem genpassg 7806
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 7804 . 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 7805 . 2  |-  ( ( A  e.  P.  /\  B  e.  P.  /\  C  e.  P. )  ->  ( 2nd `  ( ( A F B ) F C ) )  =  ( 2nd `  ( A F ( B F C ) ) ) )
84caovcl 6187 . . . . 5  |-  ( ( A  e.  P.  /\  B  e.  P. )  ->  ( A F B )  e.  P. )
94caovcl 6187 . . . . 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 1221 . . 3  |-  ( ( A  e.  P.  /\  B  e.  P.  /\  C  e.  P. )  ->  (
( A F B ) F C )  e.  P. )
124caovcl 6187 . . . . 5  |-  ( ( B  e.  P.  /\  C  e.  P. )  ->  ( B F C )  e.  P. )
134caovcl 6187 . . . . 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 1226 . . 3  |-  ( ( A  e.  P.  /\  B  e.  P.  /\  C  e.  P. )  ->  ( A F ( B F C ) )  e. 
P. )
16 preqlu 7752 . . 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 953 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 1005    = wceq 1398    e. wcel 2202   E.wrex 2512   {crab 2515   <.cop 3676    X. cxp 4729   dom cdm 4731   ` cfv 5333  (class class class)co 6028    e. cmpo 6030   1stc1st 6310   2ndc2nd 6311   Q.cnq 7560   P.cnp 7571
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 619  ax-in2 620  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-13 2204  ax-14 2205  ax-ext 2213  ax-coll 4209  ax-sep 4212  ax-pow 4270  ax-pr 4305  ax-un 4536  ax-setind 4641  ax-iinf 4692
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2364  df-ne 2404  df-ral 2516  df-rex 2517  df-reu 2518  df-rab 2520  df-v 2805  df-sbc 3033  df-csb 3129  df-dif 3203  df-un 3205  df-in 3207  df-ss 3214  df-pw 3658  df-sn 3679  df-pr 3680  df-op 3682  df-uni 3899  df-int 3934  df-iun 3977  df-br 4094  df-opab 4156  df-mpt 4157  df-id 4396  df-iom 4695  df-xp 4737  df-rel 4738  df-cnv 4739  df-co 4740  df-dm 4741  df-rn 4742  df-res 4743  df-ima 4744  df-iota 5293  df-fun 5335  df-fn 5336  df-f 5337  df-f1 5338  df-fo 5339  df-f1o 5340  df-fv 5341  df-ov 6031  df-oprab 6032  df-mpo 6033  df-1st 6312  df-2nd 6313  df-qs 6751  df-ni 7584  df-nqqs 7628  df-inp 7746
This theorem is referenced by:  addassprg  7859  mulassprg  7861
  Copyright terms: Public domain W3C validator