Theorem ndmoprass 3062

Description: Any operation is associative outside its domain, if the domain doesn't contain the empty set.

Hypotheses

Ref	Expression
ndmopr.1	|- B e. V
ndmopr.2	|- dom F = (S X. S)
ndmopr.4	|- C e. V
ndmopr.5	|- -. (/) e. S

Assertion

Ref	Expression
ndmoprass	|- (-. (A e. S /\ B e. S /\ C e. S) -> ((AFB)FC) = (AF(BFC)))

Proof of Theorem ndmoprass

Step	Hyp	Ref	Expression
1		ndmopr.1	. . . . . . 7 |- B e. V
2		ndmopr.2	. . . . . . 7 |- dom F = (S X. S)
3		ndmopr.5	. . . . . . 7 |- -. (/) e. S
4	1, 2, 3	ndmoprrcl 3060	. . . . . 6 |- ((AFB) e. S -> (A e. S /\ B e. S))
5	4	anim1i 269	. . . . 5 |- (((AFB) e. S /\ C e. S) -> ((A e. S /\ B e. S) /\ C e. S))
6		df-3an 583	. . . . 5 |- ((A e. S /\ B e. S /\ C e. S) <-> ((A e. S /\ B e. S) /\ C e. S))
7	5, 6	sylibr 175	. . . 4 |- (((AFB) e. S /\ C e. S) -> (A e. S /\ B e. S /\ C e. S))
8	7	con3i 90	. . 3 |- (-. (A e. S /\ B e. S /\ C e. S) -> -. ((AFB) e. S /\ C e. S))
9		ndmopr.4	. . . 4 |- C e. V
10	9, 2	ndmopr 3059	. . 3 |- (-. ((AFB) e. S /\ C e. S) -> ((AFB)FC) = (/))
11	8, 10	syl 12	. 2 |- (-. (A e. S /\ B e. S /\ C e. S) -> ((AFB)FC) = (/))
12	9, 2, 3	ndmoprrcl 3060	. . . . . 6 |- ((BFC) e. S -> (B e. S /\ C e. S))
13	12	anim2i 270	. . . . 5 |- ((A e. S /\ (BFC) e. S) -> (A e. S /\ (B e. S /\ C e. S)))
14		3anass 585	. . . . 5 |- ((A e. S /\ B e. S /\ C e. S) <-> (A e. S /\ (B e. S /\ C e. S)))
15	13, 14	sylibr 175	. . . 4 |- ((A e. S /\ (BFC) e. S) -> (A e. S /\ B e. S /\ C e. S))
16	15	con3i 90	. . 3 |- (-. (A e. S /\ B e. S /\ C e. S) -> -. (A e. S /\ (BFC) e. S))
17		oprex 3018	. . . 4 |- (BFC) e. V
18	17, 2	ndmopr 3059	. . 3 |- (-. (A e. S /\ (BFC) e. S) -> (AF(BFC)) = (/))
19	16, 18	syl 12	. 2 |- (-. (A e. S /\ B e. S /\ C e. S) -> (AF(BFC)) = (/))
20	11, 19	eqtr4d 1131	1 |- (-. (A e. S /\ B e. S /\ C e. S) -> ((AFB)FC) = (AF(BFC)))

Syntax hints:  -. wn 1   -> wi 2   /\ wa 196   /\ w3a 581   = wceq 1091   e. wcel 1092  Vcvv 1348  (/)c0 1707   X. cxp 2408  dom cdm 2410  (class class class)co 3001

This theorem is referenced by:  addasspi 3817  mulasspi 3819  addasspq 3857  mulasspq 3859  genpass 3906  addasssr 3991  mulasssr 3993

This theorem was proved from axioms:  ax-1 3  ax-2 4  ax-3 5  ax-mp 6  ax-4 673  ax-5 674  ax-6 675  ax-7 676  ax-gen 677  ax-8 798  ax-9 799  ax-10 800  ax-11 801  ax-12 802  ax-13 804  ax-14 805  ax-16 922  ax-17 925  ax-ext 1074  ax-rep 1075  ax-un 1076  ax-pow 1077

This theorem depends on definitions:  df-bi 128  df-or 197  df-an 198  df-3an 583  df-ex 679  df-sb 853  df-eu 1009  df-mo 1010  df-clab 1093  df-cleq 1097  df-clel 1099  df-rex 1206  df-v 1349  df-dif 1489  df-un 1490  df-in 1491  df-ss 1492  df-nul 1708  df-pw 1799  df-sn 1811  df-pr 1812  df-op 1815  df-uni 1920  df-br 2063  df-opab 2098  df-xp 2424  df-cnv 2426  df-dm 2428  df-rn 2429  df-res 2430  df-ima 2431  df-fv 2438  df-opr 3003

metamath.org