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

Theorem unrab 4259
 Description: Union of two restricted class abstractions. (Contributed by NM, 25-Mar-2004.)
Assertion
Ref Expression
unrab ({𝑥𝐴𝜑} ∪ {𝑥𝐴𝜓}) = {𝑥𝐴 ∣ (𝜑𝜓)}

Proof of Theorem unrab
StepHypRef Expression
1 df-rab 3142 . . 3 {𝑥𝐴𝜑} = {𝑥 ∣ (𝑥𝐴𝜑)}
2 df-rab 3142 . . 3 {𝑥𝐴𝜓} = {𝑥 ∣ (𝑥𝐴𝜓)}
31, 2uneq12i 4123 . 2 ({𝑥𝐴𝜑} ∪ {𝑥𝐴𝜓}) = ({𝑥 ∣ (𝑥𝐴𝜑)} ∪ {𝑥 ∣ (𝑥𝐴𝜓)})
4 df-rab 3142 . . 3 {𝑥𝐴 ∣ (𝜑𝜓)} = {𝑥 ∣ (𝑥𝐴 ∧ (𝜑𝜓))}
5 unab 4255 . . . 4 ({𝑥 ∣ (𝑥𝐴𝜑)} ∪ {𝑥 ∣ (𝑥𝐴𝜓)}) = {𝑥 ∣ ((𝑥𝐴𝜑) ∨ (𝑥𝐴𝜓))}
6 andi 1005 . . . . 5 ((𝑥𝐴 ∧ (𝜑𝜓)) ↔ ((𝑥𝐴𝜑) ∨ (𝑥𝐴𝜓)))
76abbii 2889 . . . 4 {𝑥 ∣ (𝑥𝐴 ∧ (𝜑𝜓))} = {𝑥 ∣ ((𝑥𝐴𝜑) ∨ (𝑥𝐴𝜓))}
85, 7eqtr4i 2850 . . 3 ({𝑥 ∣ (𝑥𝐴𝜑)} ∪ {𝑥 ∣ (𝑥𝐴𝜓)}) = {𝑥 ∣ (𝑥𝐴 ∧ (𝜑𝜓))}
94, 8eqtr4i 2850 . 2 {𝑥𝐴 ∣ (𝜑𝜓)} = ({𝑥 ∣ (𝑥𝐴𝜑)} ∪ {𝑥 ∣ (𝑥𝐴𝜓)})
103, 9eqtr4i 2850 1 ({𝑥𝐴𝜑} ∪ {𝑥𝐴𝜓}) = {𝑥𝐴 ∣ (𝜑𝜓)}
 Colors of variables: wff setvar class Syntax hints:   ∧ wa 399   ∨ wo 844   = wceq 1538   ∈ wcel 2115  {cab 2802  {crab 3137   ∪ cun 3917 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 1971  ax-7 2016  ax-8 2117  ax-9 2125  ax-10 2146  ax-12 2179  ax-ext 2796 This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-ex 1782  df-nf 1786  df-sb 2071  df-clab 2803  df-cleq 2817  df-clel 2896  df-rab 3142  df-v 3482  df-un 3924 This theorem is referenced by:  rabxm  4323  kmlem3  9576  hashbclem  13815  phiprmpw  16111  efgsfo  18865  dsmmacl  20885  rrxmvallem  24011  mumul  25769  ppiub  25791  lgsquadlem2  25968  edglnl  26939  numclwwlk3lem2lem  28171  hasheuni  31401  measvuni  31530  aean  31560  subfacp1lem6  32489  lineunray  33665  cnambfre  35050  itg2addnclem2  35054  iblabsnclem  35065  orrabdioph  39638  sqrtcvallem1  40247  undisjrab  40930  mndpsuppss  44699
 Copyright terms: Public domain W3C validator