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

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

Proof of Theorem dfif6
Dummy variable 𝑦 is distinct from all other variables.
StepHypRef Expression
1 eleq1w 2843 . . . 4 (𝑥 = 𝑦 → (𝑥 ∈ 𝐴 ↔ 𝑦 ∈ 𝐴))
21anbi1d 643 . . 3 (𝑥 = 𝑦 → ((𝑥 ∈ 𝐴 ∧ 𝜑) ↔ (𝑦 ∈ 𝐴 ∧ 𝜑)))
3 eleq1w 2843 . . . 4 (𝑥 = 𝑦 → (𝑥 ∈ 𝐵 ↔ 𝑦 ∈ 𝐵))
43anbi1d 643 . . 3 (𝑥 = 𝑦 → ((𝑥 ∈ 𝐵 ∧ ¬ 𝜑) ↔ (𝑦 ∈ 𝐵 ∧ ¬ 𝜑)))
52, 4unabw 4252 . 2 ({𝑥 ∣ (𝑥 ∈ 𝐴 ∧ 𝜑)} ∪ {𝑥 ∣ (𝑥 ∈ 𝐵 ∧ ¬ 𝜑)}) = {𝑦 ∣ ((𝑦 ∈ 𝐴 ∧ 𝜑) ∨ (𝑦 ∈ 𝐵 ∧ ¬ 𝜑))}
6 df-rab 3413 . . 3 {𝑥 ∈ 𝐴 ∣ 𝜑} = {𝑥 ∣ (𝑥 ∈ 𝐴 ∧ 𝜑)}
7 df-rab 3413 . . 3 {𝑥 ∈ 𝐵 ∣ ¬ 𝜑} = {𝑥 ∣ (𝑥 ∈ 𝐵 ∧ ¬ 𝜑)}
86, 7uneq12i 4165 . 2 ({𝑥 ∈ 𝐴 ∣ 𝜑} ∪ {𝑥 ∈ 𝐵 ∣ ¬ 𝜑}) = ({𝑥 ∣ (𝑥 ∈ 𝐴 ∧ 𝜑)} ∪ {𝑥 ∣ (𝑥 ∈ 𝐵 ∧ ¬ 𝜑)})
9 df-if 4482 . 2 if(𝜑, 𝐴, 𝐵) = {𝑦 ∣ ((𝑦 ∈ 𝐴 ∧ 𝜑) ∨ (𝑦 ∈ 𝐵 ∧ ¬ 𝜑))}
105, 8, 93eqtr4ri 2794 1 if(𝜑, 𝐴, 𝐵) = ({𝑥 ∈ 𝐴 ∣ 𝜑} ∪ {𝑥 ∈ 𝐵 ∣ ¬ 𝜑})
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3   ∧ wa 401   ∨ wo 861   = wceq 1569   ∈ wcel 2144  {cab 2738  {crab 3412   ∪ cun 4149  ifcif 4481
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
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-tru 1572  df-ex 1812  df-sb 2099  df-clab 2739  df-cleq 2752  df-clel 2835  df-rab 3413  df-v 3452  df-un 4151  df-if 4482
This theorem is used by:  ifeq1  4485  ifeq2  4486  dfif3  4496
  Copyright terms: Public domain W3C validator