MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  ndmovass Structured version   Visualization version   Unicode version

Theorem ndmovass 6822
Description: Any operation is associative outside its domain, if the domain doesn't contain the empty set. (Contributed by NM, 24-Aug-1995.)
Hypotheses
Ref Expression
ndmov.1  |-  dom  F  =  ( S  X.  S )
ndmov.5  |-  -.  (/)  e.  S
Assertion
Ref Expression
ndmovass  |-  ( -.  ( A  e.  S  /\  B  e.  S  /\  C  e.  S
)  ->  ( ( A F B ) F C )  =  ( A F ( B F C ) ) )

Proof of Theorem ndmovass
StepHypRef Expression
1 ndmov.1 . . . . . . 7  |-  dom  F  =  ( S  X.  S )
2 ndmov.5 . . . . . . 7  |-  -.  (/)  e.  S
31, 2ndmovrcl 6820 . . . . . 6  |-  ( ( A F B )  e.  S  ->  ( A  e.  S  /\  B  e.  S )
)
43anim1i 592 . . . . 5  |-  ( ( ( A F B )  e.  S  /\  C  e.  S )  ->  ( ( A  e.  S  /\  B  e.  S )  /\  C  e.  S ) )
5 df-3an 1039 . . . . 5  |-  ( ( A  e.  S  /\  B  e.  S  /\  C  e.  S )  <->  ( ( A  e.  S  /\  B  e.  S
)  /\  C  e.  S ) )
64, 5sylibr 224 . . . 4  |-  ( ( ( A F B )  e.  S  /\  C  e.  S )  ->  ( A  e.  S  /\  B  e.  S  /\  C  e.  S
) )
76con3i 150 . . 3  |-  ( -.  ( A  e.  S  /\  B  e.  S  /\  C  e.  S
)  ->  -.  (
( A F B )  e.  S  /\  C  e.  S )
)
81ndmov 6818 . . 3  |-  ( -.  ( ( A F B )  e.  S  /\  C  e.  S
)  ->  ( ( A F B ) F C )  =  (/) )
97, 8syl 17 . 2  |-  ( -.  ( A  e.  S  /\  B  e.  S  /\  C  e.  S
)  ->  ( ( A F B ) F C )  =  (/) )
101, 2ndmovrcl 6820 . . . . . 6  |-  ( ( B F C )  e.  S  ->  ( B  e.  S  /\  C  e.  S )
)
1110anim2i 593 . . . . 5  |-  ( ( A  e.  S  /\  ( B F C )  e.  S )  -> 
( A  e.  S  /\  ( B  e.  S  /\  C  e.  S
) ) )
12 3anass 1042 . . . . 5  |-  ( ( A  e.  S  /\  B  e.  S  /\  C  e.  S )  <->  ( A  e.  S  /\  ( B  e.  S  /\  C  e.  S
) ) )
1311, 12sylibr 224 . . . 4  |-  ( ( A  e.  S  /\  ( B F C )  e.  S )  -> 
( A  e.  S  /\  B  e.  S  /\  C  e.  S
) )
1413con3i 150 . . 3  |-  ( -.  ( A  e.  S  /\  B  e.  S  /\  C  e.  S
)  ->  -.  ( A  e.  S  /\  ( B F C )  e.  S ) )
151ndmov 6818 . . 3  |-  ( -.  ( A  e.  S  /\  ( B F C )  e.  S )  ->  ( A F ( B F C ) )  =  (/) )
1614, 15syl 17 . 2  |-  ( -.  ( A  e.  S  /\  B  e.  S  /\  C  e.  S
)  ->  ( A F ( B F C ) )  =  (/) )
179, 16eqtr4d 2659 1  |-  ( -.  ( A  e.  S  /\  B  e.  S  /\  C  e.  S
)  ->  ( ( A F B ) F C )  =  ( A F ( B F C ) ) )
Colors of variables: wff setvar class
Syntax hints:   -. wn 3    -> wi 4    /\ wa 384    /\ w3a 1037    = wceq 1483    e. wcel 1990   (/)c0 3915    X. cxp 5112   dom cdm 5114  (class class class)co 6650
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-8 1992  ax-9 1999  ax-10 2019  ax-11 2034  ax-12 2047  ax-13 2246  ax-ext 2602  ax-sep 4781  ax-nul 4789  ax-pow 4843  ax-pr 4906
This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3an 1039  df-tru 1486  df-ex 1705  df-nf 1710  df-sb 1881  df-eu 2474  df-mo 2475  df-clab 2609  df-cleq 2615  df-clel 2618  df-nfc 2753  df-ral 2917  df-rex 2918  df-rab 2921  df-v 3202  df-dif 3577  df-un 3579  df-in 3581  df-ss 3588  df-nul 3916  df-if 4087  df-sn 4178  df-pr 4180  df-op 4184  df-uni 4437  df-br 4654  df-opab 4713  df-xp 5120  df-dm 5124  df-iota 5851  df-fv 5896  df-ov 6653
This theorem is referenced by:  addasspi  9717  mulasspi  9719  addassnq  9780  mulassnq  9781  genpass  9831  addasssr  9909  mulasssr  9911
  Copyright terms: Public domain W3C validator