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

Theorem dfif6 3911
Description: An alternate definition of the conditional operator df-if 3909 as a simple class abstraction. (Contributed by Mario Carneiro, 8-Sep-2013.)
Assertion
Ref Expression
dfif6 if(𝜑, 𝐴, 𝐵) = ({𝑥𝐴𝜑} ∪ {𝑥𝐵 ∣ ¬ 𝜑})
Distinct variable groups:   𝜑,𝑥   𝑥,𝐴   𝑥,𝐵

Proof of Theorem dfif6
StepHypRef Expression
1 unab 3736 . 2 ({𝑥 ∣ (𝑥𝐴𝜑)} ∪ {𝑥 ∣ (𝑥𝐵 ∧ ¬ 𝜑)}) = {𝑥 ∣ ((𝑥𝐴𝜑) ∨ (𝑥𝐵 ∧ ¬ 𝜑))}
2 df-rab 2800 . . 3 {𝑥𝐴𝜑} = {𝑥 ∣ (𝑥𝐴𝜑)}
3 df-rab 2800 . . 3 {𝑥𝐵 ∣ ¬ 𝜑} = {𝑥 ∣ (𝑥𝐵 ∧ ¬ 𝜑)}
42, 3uneq12i 3613 . 2 ({𝑥𝐴𝜑} ∪ {𝑥𝐵 ∣ ¬ 𝜑}) = ({𝑥 ∣ (𝑥𝐴𝜑)} ∪ {𝑥 ∣ (𝑥𝐵 ∧ ¬ 𝜑)})
5 df-if 3909 . 2 if(𝜑, 𝐴, 𝐵) = {𝑥 ∣ ((𝑥𝐴𝜑) ∨ (𝑥𝐵 ∧ ¬ 𝜑))}
61, 4, 53eqtr4ri 2538 1 if(𝜑, 𝐴, 𝐵) = ({𝑥𝐴𝜑} ∪ {𝑥𝐵 ∣ ¬ 𝜑})
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wo 377  wa 378   = wceq 1468  wcel 1937  {cab 2491  {crab 2795  cun 3424  ifcif 3908
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1698  ax-4 1711  ax-5 1789  ax-6 1836  ax-7 1883  ax-10 1965  ax-11 1970  ax-12 1983  ax-13 2137  ax-ext 2485
This theorem depends on definitions:  df-bi 192  df-or 379  df-an 380  df-tru 1471  df-ex 1693  df-nf 1697  df-sb 1829  df-clab 2492  df-cleq 2498  df-clel 2501  df-nfc 2635  df-rab 2800  df-v 3068  df-un 3431  df-if 3909
This theorem is referenced by:  ifeq1  3912  ifeq2  3913  dfif3  3922
  Copyright terms: Public domain W3C validator