NFE Home New Foundations Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  NFE Home  >  Th. List  >  coundi GIF version

Theorem coundi 5083
Description: Class composition distributes over union. (The proof was shortened by Andrew Salmon, 27-Aug-2011.) (Contributed by set.mm contributors, 21-Dec-2008.) (Revised by set.mm contributors, 27-Aug-2011.)
Assertion
Ref Expression
coundi ⊢ (A ∘ (B ∪ C)) = ((A ∘ B) ∪ (A ∘ C))

Proof of Theorem coundi
Dummy variables x y z are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 unopab 4639 . . 3 ⊢ ({⟨x, y⟩ ∣ ∃z(xBz ∧ zAy)} ∪ {⟨x, y⟩ ∣ ∃z(xCz ∧ zAy)}) = {⟨x, y⟩ ∣ (∃z(xBz ∧ zAy) ∨ ∃z(xCz ∧ zAy))}
2 brun 4693 . . . . . . . 8 ⊢ (x(B ∪ C)z ↔ (xBz ∨ xCz))
32anbi1i 676 . . . . . . 7 ⊢ ((x(B ∪ C)z ∧ zAy) ↔ ((xBz ∨ xCz) ∧ zAy))
4 andir 838 . . . . . . 7 ⊢ (((xBz ∨ xCz) ∧ zAy) ↔ ((xBz ∧ zAy) ∨ (xCz ∧ zAy)))
53, 4bitri 240 . . . . . 6 ⊢ ((x(B ∪ C)z ∧ zAy) ↔ ((xBz ∧ zAy) ∨ (xCz ∧ zAy)))
65exbii 1582 . . . . 5 ⊢ (∃z(x(B ∪ C)z ∧ zAy) ↔ ∃z((xBz ∧ zAy) ∨ (xCz ∧ zAy)))
7 19.43 1605 . . . . 5 ⊢ (∃z((xBz ∧ zAy) ∨ (xCz ∧ zAy)) ↔ (∃z(xBz ∧ zAy) ∨ ∃z(xCz ∧ zAy)))
86, 7bitr2i 241 . . . 4 ⊢ ((∃z(xBz ∧ zAy) ∨ ∃z(xCz ∧ zAy)) ↔ ∃z(x(B ∪ C)z ∧ zAy))
98opabbii 4627 . . 3 ⊢ {⟨x, y⟩ ∣ (∃z(xBz ∧ zAy) ∨ ∃z(xCz ∧ zAy))} = {⟨x, y⟩ ∣ ∃z(x(B ∪ C)z ∧ zAy)}
101, 9eqtri 2373 . 2 ⊢ ({⟨x, y⟩ ∣ ∃z(xBz ∧ zAy)} ∪ {⟨x, y⟩ ∣ ∃z(xCz ∧ zAy)}) = {⟨x, y⟩ ∣ ∃z(x(B ∪ C)z ∧ zAy)}
11 df-co 4727 . . 3 ⊢ (A ∘ B) = {⟨x, y⟩ ∣ ∃z(xBz ∧ zAy)}
12 df-co 4727 . . 3 ⊢ (A ∘ C) = {⟨x, y⟩ ∣ ∃z(xCz ∧ zAy)}
1311, 12uneq12i 3417 . 2 ⊢ ((A ∘ B) ∪ (A ∘ C)) = ({⟨x, y⟩ ∣ ∃z(xBz ∧ zAy)} ∪ {⟨x, y⟩ ∣ ∃z(xCz ∧ zAy)})
14 df-co 4727 . 2 ⊢ (A ∘ (B ∪ C)) = {⟨x, y⟩ ∣ ∃z(x(B ∪ C)z ∧ zAy)}
1510, 13, 143eqtr4ri 2384 1 ⊢ (A ∘ (B ∪ C)) = ((A ∘ B) ∪ (A ∘ C))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   ∨ wo 357   ∧ wa 358  ∃wex 1541   = wceq 1642   ∪ cun 3208  {copab 4623   class class class wbr 4640   ∘ ccom 4722
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1546  ax-5 1557  ax-17 1616  ax-9 1654  ax-8 1675  ax-6 1729  ax-7 1734  ax-11 1746  ax-12 1925  ax-ext 2334
This proof depends on definitions:  df-bi 177  df-or 359  df-an 360  df-nan 1288  df-tru 1319  df-ex 1542  df-nf 1545  df-sb 1649  df-clab 2340  df-cleq 2346  df-clel 2349  df-nfc 2479  df-v 2862  df-nin 3212  df-compl 3213  df-un 3215  df-opab 4624  df-br 4641  df-co 4727
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator