ndmovass - Metamath Proof Explorer

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

Theorem ndmovass 7316

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 𝐹 = (𝑆 × 𝑆)
ndmov.5	⊢ ¬ ∅ ∈ 𝑆

**Assertion**
Ref	Expression
ndmovass	⊢ (¬ (𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆 ∧ 𝐶 ∈ 𝑆) → ((𝐴𝐹𝐵)𝐹𝐶) = (𝐴𝐹(𝐵𝐹𝐶)))

**Proof of Theorem ndmovass**
Step	Hyp	Ref	Expression
1		ndmov.1	. . . . . 6 ⊢ dom 𝐹 = (𝑆 × 𝑆)
2		ndmov.5	. . . . . 6 ⊢ ¬ ∅ ∈ 𝑆
3	1, 2	ndmovrcl 7314	. . . . 5 ⊢ ((𝐴𝐹𝐵) ∈ 𝑆 → (𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆))
4	3	anim1i 617	. . . 4 ⊢ (((𝐴𝐹𝐵) ∈ 𝑆 ∧ 𝐶 ∈ 𝑆) → ((𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆) ∧ 𝐶 ∈ 𝑆))
5		df-3an 1086	. . . 4 ⊢ ((𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆 ∧ 𝐶 ∈ 𝑆) ↔ ((𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆) ∧ 𝐶 ∈ 𝑆))
6	4, 5	sylibr 237	. . 3 ⊢ (((𝐴𝐹𝐵) ∈ 𝑆 ∧ 𝐶 ∈ 𝑆) → (𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆 ∧ 𝐶 ∈ 𝑆))
7	1	ndmov 7312	. . 3 ⊢ (¬ ((𝐴𝐹𝐵) ∈ 𝑆 ∧ 𝐶 ∈ 𝑆) → ((𝐴𝐹𝐵)𝐹𝐶) = ∅)
8	6, 7	nsyl5 162	. 2 ⊢ (¬ (𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆 ∧ 𝐶 ∈ 𝑆) → ((𝐴𝐹𝐵)𝐹𝐶) = ∅)
9	1, 2	ndmovrcl 7314	. . . . 5 ⊢ ((𝐵𝐹𝐶) ∈ 𝑆 → (𝐵 ∈ 𝑆 ∧ 𝐶 ∈ 𝑆))
10	9	anim2i 619	. . . 4 ⊢ ((𝐴 ∈ 𝑆 ∧ (𝐵𝐹𝐶) ∈ 𝑆) → (𝐴 ∈ 𝑆 ∧ (𝐵 ∈ 𝑆 ∧ 𝐶 ∈ 𝑆)))
11		3anass 1092	. . . 4 ⊢ ((𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆 ∧ 𝐶 ∈ 𝑆) ↔ (𝐴 ∈ 𝑆 ∧ (𝐵 ∈ 𝑆 ∧ 𝐶 ∈ 𝑆)))
12	10, 11	sylibr 237	. . 3 ⊢ ((𝐴 ∈ 𝑆 ∧ (𝐵𝐹𝐶) ∈ 𝑆) → (𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆 ∧ 𝐶 ∈ 𝑆))
13	1	ndmov 7312	. . 3 ⊢ (¬ (𝐴 ∈ 𝑆 ∧ (𝐵𝐹𝐶) ∈ 𝑆) → (𝐴𝐹(𝐵𝐹𝐶)) = ∅)
14	12, 13	nsyl5 162	. 2 ⊢ (¬ (𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆 ∧ 𝐶 ∈ 𝑆) → (𝐴𝐹(𝐵𝐹𝐶)) = ∅)
15	8, 14	eqtr4d 2836	1 ⊢ (¬ (𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆 ∧ 𝐶 ∈ 𝑆) → ((𝐴𝐹𝐵)𝐹𝐶) = (𝐴𝐹(𝐵𝐹𝐶)))

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ∧ wa 399 ∧ w3a 1084 = wceq 1538 ∈ wcel 2111 ∅c0 4243 × cxp 5517 dom cdm 5519 (class class class)co 7135

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 1911 ax-6 1970 ax-7 2015 ax-8 2113 ax-9 2121 ax-10 2142 ax-11 2158 ax-12 2175 ax-ext 2770 ax-sep 5167 ax-nul 5174 ax-pow 5231 ax-pr 5295

This theorem depends on definitions: df-bi 210 df-an 400 df-or 845 df-3an 1086 df-tru 1541 df-ex 1782 df-nf 1786 df-sb 2070 df-mo 2598 df-eu 2629 df-clab 2777 df-cleq 2791 df-clel 2870 df-nfc 2938 df-ral 3111 df-rex 3112 df-v 3443 df-dif 3884 df-un 3886 df-in 3888 df-ss 3898 df-nul 4244 df-if 4426 df-sn 4526 df-pr 4528 df-op 4532 df-uni 4801 df-br 5031 df-opab 5093 df-xp 5525 df-dm 5529 df-iota 6283 df-fv 6332 df-ov 7138

This theorem is referenced by: addasspi 10306 mulasspi 10308 addassnq 10369 mulassnq 10370 genpass 10420 addasssr 10499 mulasssr 10501

W3C validator