Theorem ndmaovdistr 47655

Description: Any operation is distributive outside its domain. In contrast to ndmovdistr 7556 where it is required that the operation's domain doesn't contain the empty set (¬ ∅ ∈ 𝑆), no additional assumption is required. (Contributed by Alexander van der Vekens, 26-May-2017.)

Hypotheses

Ref	Expression
ndmaov.1	⊢ dom 𝐹 = (𝑆 × 𝑆)
ndmaov.6	⊢ dom 𝐺 = (𝑆 × 𝑆)

Assertion

Ref	Expression
ndmaovdistr	⊢ (¬ (𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆 ∧ 𝐶 ∈ 𝑆) → ((𝐴𝐺 ((𝐵𝐹𝐶)) )) = (( ((𝐴𝐺𝐵)) 𝐹 ((𝐴𝐺𝐶)) )) )

Proof of Theorem ndmaovdistr

Step	Hyp	Ref	Expression
1		ndmaov.6	. . . . . 6 ⊢ dom 𝐺 = (𝑆 × 𝑆)
2	1	eleq2i 2828	. . . . 5 ⊢ (⟨𝐴, ((𝐵𝐹𝐶)) ⟩ ∈ dom 𝐺 ↔ ⟨𝐴, ((𝐵𝐹𝐶)) ⟩ ∈ (𝑆 × 𝑆))
3		opelxp 5667	. . . . 5 ⊢ (⟨𝐴, ((𝐵𝐹𝐶)) ⟩ ∈ (𝑆 × 𝑆) ↔ (𝐴 ∈ 𝑆 ∧ ((𝐵𝐹𝐶)) ∈ 𝑆))
4	2, 3	bitri 275	. . . 4 ⊢ (⟨𝐴, ((𝐵𝐹𝐶)) ⟩ ∈ dom 𝐺 ↔ (𝐴 ∈ 𝑆 ∧ ((𝐵𝐹𝐶)) ∈ 𝑆))
5		aovvdm 47633	. . . . . 6 ⊢ ( ((𝐵𝐹𝐶)) ∈ 𝑆 → ⟨𝐵, 𝐶⟩ ∈ dom 𝐹)
6		ndmaov.1	. . . . . . . . 9 ⊢ dom 𝐹 = (𝑆 × 𝑆)
7	6	eleq2i 2828	. . . . . . . 8 ⊢ (⟨𝐵, 𝐶⟩ ∈ dom 𝐹 ↔ ⟨𝐵, 𝐶⟩ ∈ (𝑆 × 𝑆))
8		opelxp 5667	. . . . . . . 8 ⊢ (⟨𝐵, 𝐶⟩ ∈ (𝑆 × 𝑆) ↔ (𝐵 ∈ 𝑆 ∧ 𝐶 ∈ 𝑆))
9	7, 8	bitri 275	. . . . . . 7 ⊢ (⟨𝐵, 𝐶⟩ ∈ dom 𝐹 ↔ (𝐵 ∈ 𝑆 ∧ 𝐶 ∈ 𝑆))
10		3anass 1095	. . . . . . . 8 ⊢ ((𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆 ∧ 𝐶 ∈ 𝑆) ↔ (𝐴 ∈ 𝑆 ∧ (𝐵 ∈ 𝑆 ∧ 𝐶 ∈ 𝑆)))
11	10	simplbi2com 502	. . . . . . 7 ⊢ ((𝐵 ∈ 𝑆 ∧ 𝐶 ∈ 𝑆) → (𝐴 ∈ 𝑆 → (𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆 ∧ 𝐶 ∈ 𝑆)))
12	9, 11	sylbi 217	. . . . . 6 ⊢ (⟨𝐵, 𝐶⟩ ∈ dom 𝐹 → (𝐴 ∈ 𝑆 → (𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆 ∧ 𝐶 ∈ 𝑆)))
13	5, 12	syl 17	. . . . 5 ⊢ ( ((𝐵𝐹𝐶)) ∈ 𝑆 → (𝐴 ∈ 𝑆 → (𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆 ∧ 𝐶 ∈ 𝑆)))
14	13	impcom 407	. . . 4 ⊢ ((𝐴 ∈ 𝑆 ∧ ((𝐵𝐹𝐶)) ∈ 𝑆) → (𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆 ∧ 𝐶 ∈ 𝑆))
15	4, 14	sylbi 217	. . 3 ⊢ (⟨𝐴, ((𝐵𝐹𝐶)) ⟩ ∈ dom 𝐺 → (𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆 ∧ 𝐶 ∈ 𝑆))
16		ndmaov 47631	. . 3 ⊢ (¬ ⟨𝐴, ((𝐵𝐹𝐶)) ⟩ ∈ dom 𝐺 → ((𝐴𝐺 ((𝐵𝐹𝐶)) )) = V)
17	15, 16	nsyl5 159	. 2 ⊢ (¬ (𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆 ∧ 𝐶 ∈ 𝑆) → ((𝐴𝐺 ((𝐵𝐹𝐶)) )) = V)
18	6	eleq2i 2828	. . . . 5 ⊢ (⟨ ((𝐴𝐺𝐵)) , ((𝐴𝐺𝐶)) ⟩ ∈ dom 𝐹 ↔ ⟨ ((𝐴𝐺𝐵)) , ((𝐴𝐺𝐶)) ⟩ ∈ (𝑆 × 𝑆))
19		opelxp 5667	. . . . 5 ⊢ (⟨ ((𝐴𝐺𝐵)) , ((𝐴𝐺𝐶)) ⟩ ∈ (𝑆 × 𝑆) ↔ ( ((𝐴𝐺𝐵)) ∈ 𝑆 ∧ ((𝐴𝐺𝐶)) ∈ 𝑆))
20	18, 19	bitri 275	. . . 4 ⊢ (⟨ ((𝐴𝐺𝐵)) , ((𝐴𝐺𝐶)) ⟩ ∈ dom 𝐹 ↔ ( ((𝐴𝐺𝐵)) ∈ 𝑆 ∧ ((𝐴𝐺𝐶)) ∈ 𝑆))
21		aovvdm 47633	. . . . . 6 ⊢ ( ((𝐴𝐺𝐵)) ∈ 𝑆 → ⟨𝐴, 𝐵⟩ ∈ dom 𝐺)
22	1	eleq2i 2828	. . . . . . . 8 ⊢ (⟨𝐴, 𝐵⟩ ∈ dom 𝐺 ↔ ⟨𝐴, 𝐵⟩ ∈ (𝑆 × 𝑆))
23		opelxp 5667	. . . . . . . 8 ⊢ (⟨𝐴, 𝐵⟩ ∈ (𝑆 × 𝑆) ↔ (𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆))
24	22, 23	bitri 275	. . . . . . 7 ⊢ (⟨𝐴, 𝐵⟩ ∈ dom 𝐺 ↔ (𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆))
25	1	eleq2i 2828	. . . . . . . . . 10 ⊢ (⟨𝐴, 𝐶⟩ ∈ dom 𝐺 ↔ ⟨𝐴, 𝐶⟩ ∈ (𝑆 × 𝑆))
26		opelxp 5667	. . . . . . . . . 10 ⊢ (⟨𝐴, 𝐶⟩ ∈ (𝑆 × 𝑆) ↔ (𝐴 ∈ 𝑆 ∧ 𝐶 ∈ 𝑆))
27	25, 26	bitri 275	. . . . . . . . 9 ⊢ (⟨𝐴, 𝐶⟩ ∈ dom 𝐺 ↔ (𝐴 ∈ 𝑆 ∧ 𝐶 ∈ 𝑆))
28		simpll 767	. . . . . . . . . . 11 ⊢ (((𝐴 ∈ 𝑆 ∧ 𝐶 ∈ 𝑆) ∧ (𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆)) → 𝐴 ∈ 𝑆)
29		simprr 773	. . . . . . . . . . 11 ⊢ (((𝐴 ∈ 𝑆 ∧ 𝐶 ∈ 𝑆) ∧ (𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆)) → 𝐵 ∈ 𝑆)
30		simplr 769	. . . . . . . . . . 11 ⊢ (((𝐴 ∈ 𝑆 ∧ 𝐶 ∈ 𝑆) ∧ (𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆)) → 𝐶 ∈ 𝑆)
31	28, 29, 30	3jca 1129	. . . . . . . . . 10 ⊢ (((𝐴 ∈ 𝑆 ∧ 𝐶 ∈ 𝑆) ∧ (𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆)) → (𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆 ∧ 𝐶 ∈ 𝑆))
32	31	ex 412	. . . . . . . . 9 ⊢ ((𝐴 ∈ 𝑆 ∧ 𝐶 ∈ 𝑆) → ((𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆) → (𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆 ∧ 𝐶 ∈ 𝑆)))
33	27, 32	sylbi 217	. . . . . . . 8 ⊢ (⟨𝐴, 𝐶⟩ ∈ dom 𝐺 → ((𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆) → (𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆 ∧ 𝐶 ∈ 𝑆)))
34		aovvdm 47633	. . . . . . . 8 ⊢ ( ((𝐴𝐺𝐶)) ∈ 𝑆 → ⟨𝐴, 𝐶⟩ ∈ dom 𝐺)
35	33, 34	syl11 33	. . . . . . 7 ⊢ ((𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆) → ( ((𝐴𝐺𝐶)) ∈ 𝑆 → (𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆 ∧ 𝐶 ∈ 𝑆)))
36	24, 35	sylbi 217	. . . . . 6 ⊢ (⟨𝐴, 𝐵⟩ ∈ dom 𝐺 → ( ((𝐴𝐺𝐶)) ∈ 𝑆 → (𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆 ∧ 𝐶 ∈ 𝑆)))
37	21, 36	syl 17	. . . . 5 ⊢ ( ((𝐴𝐺𝐵)) ∈ 𝑆 → ( ((𝐴𝐺𝐶)) ∈ 𝑆 → (𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆 ∧ 𝐶 ∈ 𝑆)))
38	37	imp 406	. . . 4 ⊢ (( ((𝐴𝐺𝐵)) ∈ 𝑆 ∧ ((𝐴𝐺𝐶)) ∈ 𝑆) → (𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆 ∧ 𝐶 ∈ 𝑆))
39	20, 38	sylbi 217	. . 3 ⊢ (⟨ ((𝐴𝐺𝐵)) , ((𝐴𝐺𝐶)) ⟩ ∈ dom 𝐹 → (𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆 ∧ 𝐶 ∈ 𝑆))
40		ndmaov 47631	. . 3 ⊢ (¬ ⟨ ((𝐴𝐺𝐵)) , ((𝐴𝐺𝐶)) ⟩ ∈ dom 𝐹 → (( ((𝐴𝐺𝐵)) 𝐹 ((𝐴𝐺𝐶)) )) = V)
41	39, 40	nsyl5 159	. 2 ⊢ (¬ (𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆 ∧ 𝐶 ∈ 𝑆) → (( ((𝐴𝐺𝐵)) 𝐹 ((𝐴𝐺𝐶)) )) = V)
42	17, 41	eqtr4d 2774	1 ⊢ (¬ (𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆 ∧ 𝐶 ∈ 𝑆) → ((𝐴𝐺 ((𝐵𝐹𝐶)) )) = (( ((𝐴𝐺𝐵)) 𝐹 ((𝐴𝐺𝐶)) )) )

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 395   ∧ w3a 1087   = wceq 1542   ∈ wcel 2114  Vcvv 3429  ⟨cop 4573   × cxp 5629  dom cdm 5631   ((caov 47566

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2708  ax-sep 5231  ax-nul 5241  ax-pr 5375

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2539  df-eu 2569  df-clab 2715  df-cleq 2728  df-clel 2811  df-nfc 2885  df-ne 2933  df-ral 3052  df-rex 3062  df-rab 3390  df-v 3431  df-sbc 3729  df-csb 3838  df-dif 3892  df-un 3894  df-in 3896  df-ss 3906  df-nul 4274  df-if 4467  df-sn 4568  df-pr 4570  df-op 4574  df-uni 4851  df-int 4890  df-br 5086  df-opab 5148  df-id 5526  df-xp 5637  df-rel 5638  df-cnv 5639  df-co 5640  df-dm 5641  df-res 5643  df-iota 6454  df-fun 6500  df-fv 6506  df-aiota 47533  df-dfat 47567  df-afv 47568  df-aov 47569

This theorem is referenced by: (None)