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

Theorem ndmovdistr 7610
Description: Any operation is distributive 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 ¬ ∅ ∈ 𝑆
ndmov.6 dom 𝐺 = (𝑆 × 𝑆)
Assertion
Ref Expression
ndmovdistr (¬ (𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆 ∧ 𝐶 ∈ 𝑆) → (𝐴𝐺(𝐵𝐹𝐶)) = ((𝐴𝐺𝐵)𝐹(𝐴𝐺𝐶)))

Proof of Theorem ndmovdistr
StepHypRef Expression
1 ndmov.1 . . . . . 6 dom 𝐹 = (𝑆 × 𝑆)
2 ndmov.5 . . . . . 6 ¬ ∅ ∈ 𝑆
31, 2ndmovrcl 7607 . . . . 5 ((𝐵𝐹𝐶) ∈ 𝑆 → (𝐵 ∈ 𝑆 ∧ 𝐶 ∈ 𝑆))
43anim2i 629 . . . 4 ((𝐴 ∈ 𝑆 ∧ (𝐵𝐹𝐶) ∈ 𝑆) → (𝐴 ∈ 𝑆 ∧ (𝐵 ∈ 𝑆 ∧ 𝐶 ∈ 𝑆)))
5 3anass 1111 . . . 4 ((𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆 ∧ 𝐶 ∈ 𝑆) ↔ (𝐴 ∈ 𝑆 ∧ (𝐵 ∈ 𝑆 ∧ 𝐶 ∈ 𝑆)))
64, 5sylibr 237 . . 3 ((𝐴 ∈ 𝑆 ∧ (𝐵𝐹𝐶) ∈ 𝑆) → (𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆 ∧ 𝐶 ∈ 𝑆))
7 ndmov.6 . . . 4 dom 𝐺 = (𝑆 × 𝑆)
87ndmov 7605 . . 3 (¬ (𝐴 ∈ 𝑆 ∧ (𝐵𝐹𝐶) ∈ 𝑆) → (𝐴𝐺(𝐵𝐹𝐶)) = ∅)
96, 8nsyl5 160 . 2 (¬ (𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆 ∧ 𝐶 ∈ 𝑆) → (𝐴𝐺(𝐵𝐹𝐶)) = ∅)
107, 2ndmovrcl 7607 . . . . 5 ((𝐴𝐺𝐵) ∈ 𝑆 → (𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆))
117, 2ndmovrcl 7607 . . . . 5 ((𝐴𝐺𝐶) ∈ 𝑆 → (𝐴 ∈ 𝑆 ∧ 𝐶 ∈ 𝑆))
1210, 11anim12i 625 . . . 4 (((𝐴𝐺𝐵) ∈ 𝑆 ∧ (𝐴𝐺𝐶) ∈ 𝑆) → ((𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆) ∧ (𝐴 ∈ 𝑆 ∧ 𝐶 ∈ 𝑆)))
13 anandi3 1119 . . . 4 ((𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆 ∧ 𝐶 ∈ 𝑆) ↔ ((𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆) ∧ (𝐴 ∈ 𝑆 ∧ 𝐶 ∈ 𝑆)))
1412, 13sylibr 237 . . 3 (((𝐴𝐺𝐵) ∈ 𝑆 ∧ (𝐴𝐺𝐶) ∈ 𝑆) → (𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆 ∧ 𝐶 ∈ 𝑆))
151ndmov 7605 . . 3 (¬ ((𝐴𝐺𝐵) ∈ 𝑆 ∧ (𝐴𝐺𝐶) ∈ 𝑆) → ((𝐴𝐺𝐵)𝐹(𝐴𝐺𝐶)) = ∅)
1614, 15nsyl5 160 . 2 (¬ (𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆 ∧ 𝐶 ∈ 𝑆) → ((𝐴𝐺𝐵)𝐹(𝐴𝐺𝐶)) = ∅)
179, 16eqtr4d 2798 1 (¬ (𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆 ∧ 𝐶 ∈ 𝑆) → (𝐴𝐺(𝐵𝐹𝐶)) = ((𝐴𝐺𝐵)𝐹(𝐴𝐺𝐶)))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ∧ wa 401   ∧ w3a 1103   = wceq 1569   ∈ wcel 2144  ∅c0 4278   × cxp 5648  dom cdm 5650  (class class class)co 7420
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-ext 2732  ax-sep 5248  ax-nul 5259  ax-pr 5390
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-sb 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-ne 2956  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-ss 3896  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-sn 4584  df-pr 4586  df-op 4590  df-uni 4867  df-br 5103  df-opab 5167  df-xp 5656  df-dm 5660  df-iota 6494  df-fv 6546  df-ov 7423
This theorem is used by:  distrpi  10983  distrnq  11046  distrpr  11113  distrsr  11176
  Copyright terms: Public domain W3C validator