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

Theorem dfif6 4469
Description: An alternate definition of the conditional operator df-if 4467 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 4269 . 2 ({𝑥 ∣ (𝑥𝐴𝜑)} ∪ {𝑥 ∣ (𝑥𝐵 ∧ ¬ 𝜑)}) = {𝑥 ∣ ((𝑥𝐴𝜑) ∨ (𝑥𝐵 ∧ ¬ 𝜑))}
2 df-rab 3147 . . 3 {𝑥𝐴𝜑} = {𝑥 ∣ (𝑥𝐴𝜑)}
3 df-rab 3147 . . 3 {𝑥𝐵 ∣ ¬ 𝜑} = {𝑥 ∣ (𝑥𝐵 ∧ ¬ 𝜑)}
42, 3uneq12i 4136 . 2 ({𝑥𝐴𝜑} ∪ {𝑥𝐵 ∣ ¬ 𝜑}) = ({𝑥 ∣ (𝑥𝐴𝜑)} ∪ {𝑥 ∣ (𝑥𝐵 ∧ ¬ 𝜑)})
5 df-if 4467 . 2 if(𝜑, 𝐴, 𝐵) = {𝑥 ∣ ((𝑥𝐴𝜑) ∨ (𝑥𝐵 ∧ ¬ 𝜑))}
61, 4, 53eqtr4ri 2855 1 if(𝜑, 𝐴, 𝐵) = ({𝑥𝐴𝜑} ∪ {𝑥𝐵 ∣ ¬ 𝜑})
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wa 398  wo 843   = wceq 1533  wcel 2110  {cab 2799  {crab 3142  cun 3933  ifcif 4466
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1792  ax-4 1806  ax-5 1907  ax-6 1966  ax-7 2011  ax-8 2112  ax-9 2120  ax-10 2141  ax-11 2157  ax-12 2173  ax-ext 2793
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-tru 1536  df-ex 1777  df-nf 1781  df-sb 2066  df-clab 2800  df-cleq 2814  df-clel 2893  df-nfc 2963  df-rab 3147  df-v 3496  df-un 3940  df-if 4467
This theorem is referenced by:  ifeq1  4470  ifeq2  4471  dfif3  4480
  Copyright terms: Public domain W3C validator