Users' Mathboxes Mathbox for Alexander van der Vekens < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  ndmaovass Structured version   Unicode version

Theorem ndmaovass 30259
Description: Any operation is associative outside its domain. In contrast to ndmovass 6360 where it is required that the operation's domain doesn't contain the empty set ( -.  (/)  e.  S), no additional assumption is required. (Contributed by Alexander van der Vekens, 26-May-2017.)
Hypothesis
Ref Expression
ndmaov.1  |-  dom  F  =  ( S  X.  S )
Assertion
Ref Expression
ndmaovass  |-  ( -.  ( A  e.  S  /\  B  e.  S  /\  C  e.  S
)  -> (( (( A F B))  F C))  = (( A F (( B F C)) ))  )

Proof of Theorem ndmaovass
StepHypRef Expression
1 ndmaov.1 . . . . . . 7  |-  dom  F  =  ( S  X.  S )
21eleq2i 2532 . . . . . 6  |-  ( <. (( A F B))  ,  C >.  e.  dom  F  <->  <. (( A F B))  ,  C >.  e.  ( S  X.  S
) )
3 opelxp 4976 . . . . . 6  |-  ( <. (( A F B))  ,  C >.  e.  ( S  X.  S )  <->  ( (( A F B))  e.  S  /\  C  e.  S
) )
42, 3bitri 249 . . . . 5  |-  ( <. (( A F B))  ,  C >.  e.  dom  F  <->  ( (( A F B))  e.  S  /\  C  e.  S
) )
5 aovvdm 30238 . . . . . . 7  |-  ( (( A F B))  e.  S  -> 
<. A ,  B >.  e. 
dom  F )
61eleq2i 2532 . . . . . . . . 9  |-  ( <. A ,  B >.  e. 
dom  F  <->  <. A ,  B >.  e.  ( S  X.  S ) )
7 opelxp 4976 . . . . . . . . 9  |-  ( <. A ,  B >.  e.  ( S  X.  S
)  <->  ( A  e.  S  /\  B  e.  S ) )
86, 7bitri 249 . . . . . . . 8  |-  ( <. A ,  B >.  e. 
dom  F  <->  ( A  e.  S  /\  B  e.  S ) )
9 df-3an 967 . . . . . . . . 9  |-  ( ( A  e.  S  /\  B  e.  S  /\  C  e.  S )  <->  ( ( A  e.  S  /\  B  e.  S
)  /\  C  e.  S ) )
109simplbi2 625 . . . . . . . 8  |-  ( ( A  e.  S  /\  B  e.  S )  ->  ( C  e.  S  ->  ( A  e.  S  /\  B  e.  S  /\  C  e.  S
) ) )
118, 10sylbi 195 . . . . . . 7  |-  ( <. A ,  B >.  e. 
dom  F  ->  ( C  e.  S  ->  ( A  e.  S  /\  B  e.  S  /\  C  e.  S )
) )
125, 11syl 16 . . . . . 6  |-  ( (( A F B))  e.  S  ->  ( C  e.  S  ->  ( A  e.  S  /\  B  e.  S  /\  C  e.  S
) ) )
1312imp 429 . . . . 5  |-  ( ( (( A F B))  e.  S  /\  C  e.  S
)  ->  ( A  e.  S  /\  B  e.  S  /\  C  e.  S ) )
144, 13sylbi 195 . . . 4  |-  ( <. (( A F B))  ,  C >.  e.  dom  F  -> 
( A  e.  S  /\  B  e.  S  /\  C  e.  S
) )
1514con3i 135 . . 3  |-  ( -.  ( A  e.  S  /\  B  e.  S  /\  C  e.  S
)  ->  -.  <. (( A F B))  ,  C >.  e. 
dom  F )
16 ndmaov 30236 . . 3  |-  ( -. 
<. (( A F B))  ,  C >.  e.  dom  F  -> (( (( A F B))  F C))  =  _V )
1715, 16syl 16 . 2  |-  ( -.  ( A  e.  S  /\  B  e.  S  /\  C  e.  S
)  -> (( (( A F B))  F C))  =  _V )
181eleq2i 2532 . . . . . . 7  |-  ( <. A , (( B F C))  >.  e.  dom  F  <->  <. A , (( B F C))  >.  e.  ( S  X.  S ) )
19 opelxp 4976 . . . . . . 7  |-  ( <. A , (( B F C))  >.  e.  ( S  X.  S )  <->  ( A  e.  S  /\ (( B F C))  e.  S ) )
2018, 19bitri 249 . . . . . 6  |-  ( <. A , (( B F C))  >.  e.  dom  F  <->  ( A  e.  S  /\ (( B F C))  e.  S
) )
21 aovvdm 30238 . . . . . . . 8  |-  ( (( B F C))  e.  S  -> 
<. B ,  C >.  e. 
dom  F )
221eleq2i 2532 . . . . . . . . . 10  |-  ( <. B ,  C >.  e. 
dom  F  <->  <. B ,  C >.  e.  ( S  X.  S ) )
23 opelxp 4976 . . . . . . . . . 10  |-  ( <. B ,  C >.  e.  ( S  X.  S
)  <->  ( B  e.  S  /\  C  e.  S ) )
2422, 23bitri 249 . . . . . . . . 9  |-  ( <. B ,  C >.  e. 
dom  F  <->  ( B  e.  S  /\  C  e.  S ) )
25 3anass 969 . . . . . . . . . . . 12  |-  ( ( A  e.  S  /\  B  e.  S  /\  C  e.  S )  <->  ( A  e.  S  /\  ( B  e.  S  /\  C  e.  S
) ) )
2625biimpri 206 . . . . . . . . . . 11  |-  ( ( A  e.  S  /\  ( B  e.  S  /\  C  e.  S
) )  ->  ( A  e.  S  /\  B  e.  S  /\  C  e.  S )
)
2726a1d 25 . . . . . . . . . 10  |-  ( ( A  e.  S  /\  ( B  e.  S  /\  C  e.  S
) )  ->  ( <. A , (( B F C))  >.  e.  dom  F  ->  ( A  e.  S  /\  B  e.  S  /\  C  e.  S
) ) )
2827expcom 435 . . . . . . . . 9  |-  ( ( B  e.  S  /\  C  e.  S )  ->  ( A  e.  S  ->  ( <. A , (( B F C))  >.  e.  dom  F  ->  ( A  e.  S  /\  B  e.  S  /\  C  e.  S ) ) ) )
2924, 28sylbi 195 . . . . . . . 8  |-  ( <. B ,  C >.  e. 
dom  F  ->  ( A  e.  S  ->  ( <. A , (( B F C))  >.  e.  dom  F  ->  ( A  e.  S  /\  B  e.  S  /\  C  e.  S
) ) ) )
3021, 29syl 16 . . . . . . 7  |-  ( (( B F C))  e.  S  ->  ( A  e.  S  ->  ( <. A , (( B F C))  >.  e.  dom  F  ->  ( A  e.  S  /\  B  e.  S  /\  C  e.  S ) ) ) )
3130impcom 430 . . . . . 6  |-  ( ( A  e.  S  /\ (( B F C))  e.  S
)  ->  ( <. A , (( B F C)) 
>.  e.  dom  F  -> 
( A  e.  S  /\  B  e.  S  /\  C  e.  S
) ) )
3220, 31sylbi 195 . . . . 5  |-  ( <. A , (( B F C))  >.  e.  dom  F  ->  ( <. A , (( B F C))  >.  e.  dom  F  ->  ( A  e.  S  /\  B  e.  S  /\  C  e.  S ) ) )
3332pm2.43i 47 . . . 4  |-  ( <. A , (( B F C))  >.  e.  dom  F  ->  ( A  e.  S  /\  B  e.  S  /\  C  e.  S
) )
3433con3i 135 . . 3  |-  ( -.  ( A  e.  S  /\  B  e.  S  /\  C  e.  S
)  ->  -.  <. A , (( B F C))  >.  e.  dom  F )
35 ndmaov 30236 . . 3  |-  ( -. 
<. A , (( B F C))  >.  e.  dom  F  -> (( A F (( B F C)) ))  =  _V )
3634, 35syl 16 . 2  |-  ( -.  ( A  e.  S  /\  B  e.  S  /\  C  e.  S
)  -> (( A F (( B F C)) ))  =  _V )
3717, 36eqtr4d 2498 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 369    /\ w3a 965    = wceq 1370    e. wcel 1758   _Vcvv 3076   <.cop 3990    X. cxp 4945   dom cdm 4947   ((caov 30166
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1592  ax-4 1603  ax-5 1671  ax-6 1710  ax-7 1730  ax-8 1760  ax-9 1762  ax-10 1777  ax-11 1782  ax-12 1794  ax-13 1955  ax-ext 2432  ax-sep 4520  ax-nul 4528  ax-pr 4638
This theorem depends on definitions:  df-bi 185  df-or 370  df-an 371  df-3an 967  df-tru 1373  df-ex 1588  df-nf 1591  df-sb 1703  df-clab 2440  df-cleq 2446  df-clel 2449  df-nfc 2604  df-ne 2649  df-ral 2803  df-rex 2804  df-rab 2807  df-v 3078  df-dif 3438  df-un 3440  df-in 3442  df-ss 3449  df-nul 3745  df-if 3899  df-sn 3985  df-pr 3987  df-op 3991  df-opab 4458  df-xp 4953  df-fv 5533  df-dfat 30167  df-afv 30168  df-aov 30169
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator