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

Theorem ndmovass 6008
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 6006 . . . . . 6  |-  ( ( A F B )  e.  S  ->  ( A  e.  S  /\  B  e.  S )
)
43anim1i 551 . . . . 5  |-  ( ( ( A F B )  e.  S  /\  C  e.  S )  ->  ( ( A  e.  S  /\  B  e.  S )  /\  C  e.  S ) )
5 df-3an 936 . . . . 5  |-  ( ( A  e.  S  /\  B  e.  S  /\  C  e.  S )  <->  ( ( A  e.  S  /\  B  e.  S
)  /\  C  e.  S ) )
64, 5sylibr 203 . . . 4  |-  ( ( ( A F B )  e.  S  /\  C  e.  S )  ->  ( A  e.  S  /\  B  e.  S  /\  C  e.  S
) )
76con3i 127 . . 3  |-  ( -.  ( A  e.  S  /\  B  e.  S  /\  C  e.  S
)  ->  -.  (
( A F B )  e.  S  /\  C  e.  S )
)
81ndmov 6004 . . 3  |-  ( -.  ( ( A F B )  e.  S  /\  C  e.  S
)  ->  ( ( A F B ) F C )  =  (/) )
97, 8syl 15 . 2  |-  ( -.  ( A  e.  S  /\  B  e.  S  /\  C  e.  S
)  ->  ( ( A F B ) F C )  =  (/) )
101, 2ndmovrcl 6006 . . . . . 6  |-  ( ( B F C )  e.  S  ->  ( B  e.  S  /\  C  e.  S )
)
1110anim2i 552 . . . . 5  |-  ( ( A  e.  S  /\  ( B F C )  e.  S )  -> 
( A  e.  S  /\  ( B  e.  S  /\  C  e.  S
) ) )
12 3anass 938 . . . . 5  |-  ( ( A  e.  S  /\  B  e.  S  /\  C  e.  S )  <->  ( A  e.  S  /\  ( B  e.  S  /\  C  e.  S
) ) )
1311, 12sylibr 203 . . . 4  |-  ( ( A  e.  S  /\  ( B F C )  e.  S )  -> 
( A  e.  S  /\  B  e.  S  /\  C  e.  S
) )
1413con3i 127 . . 3  |-  ( -.  ( A  e.  S  /\  B  e.  S  /\  C  e.  S
)  ->  -.  ( A  e.  S  /\  ( B F C )  e.  S ) )
151ndmov 6004 . . 3  |-  ( -.  ( A  e.  S  /\  ( B F C )  e.  S )  ->  ( A F ( B F C ) )  =  (/) )
1614, 15syl 15 . 2  |-  ( -.  ( A  e.  S  /\  B  e.  S  /\  C  e.  S
)  ->  ( A F ( B F C ) )  =  (/) )
179, 16eqtr4d 2318 1  |-  ( -.  ( A  e.  S  /\  B  e.  S  /\  C  e.  S
)  ->  ( ( A F B ) F C )  =  ( A F ( B F C ) ) )
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4    /\ wa 358    /\ w3a 934    = wceq 1623    e. wcel 1684   (/)c0 3455    X. cxp 4687   dom cdm 4689  (class class class)co 5858
This theorem is referenced by:  addasspi  8519  mulasspi  8521  addassnq  8582  mulassnq  8583  genpass  8633  addasssr  8710  mulasssr  8712
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1533  ax-5 1544  ax-17 1603  ax-9 1635  ax-8 1643  ax-13 1686  ax-14 1688  ax-6 1703  ax-7 1708  ax-11 1715  ax-12 1866  ax-ext 2264  ax-sep 4141  ax-nul 4149  ax-pow 4188  ax-pr 4214
This theorem depends on definitions:  df-bi 177  df-or 359  df-an 360  df-3an 936  df-tru 1310  df-ex 1529  df-nf 1532  df-sb 1630  df-eu 2147  df-mo 2148  df-clab 2270  df-cleq 2276  df-clel 2279  df-nfc 2408  df-ne 2448  df-ral 2548  df-rex 2549  df-rab 2552  df-v 2790  df-dif 3155  df-un 3157  df-in 3159  df-ss 3166  df-nul 3456  df-if 3566  df-sn 3646  df-pr 3647  df-op 3649  df-uni 3828  df-br 4024  df-opab 4078  df-xp 4695  df-dm 4699  df-iota 5219  df-fv 5263  df-ov 5861
  Copyright terms: Public domain W3C validator