Theorem dfif6 4467

Description: An alternate definition of the conditional operator df-if 4465 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.

Step	Hyp	Ref	Expression
1		eleq1w 2822	. . . 4 ⊢ (𝑥 = 𝑦 → (𝑥 ∈ 𝐴 ↔ 𝑦 ∈ 𝐴))
2	1	anbi1d 629	. . 3 ⊢ (𝑥 = 𝑦 → ((𝑥 ∈ 𝐴 ∧ 𝜑) ↔ (𝑦 ∈ 𝐴 ∧ 𝜑)))
3		eleq1w 2822	. . . 4 ⊢ (𝑥 = 𝑦 → (𝑥 ∈ 𝐵 ↔ 𝑦 ∈ 𝐵))
4	3	anbi1d 629	. . 3 ⊢ (𝑥 = 𝑦 → ((𝑥 ∈ 𝐵 ∧ ¬ 𝜑) ↔ (𝑦 ∈ 𝐵 ∧ ¬ 𝜑)))
5	2, 4	unabw 4236	. 2 ⊢ ({𝑥 ∣ (𝑥 ∈ 𝐴 ∧ 𝜑)} ∪ {𝑥 ∣ (𝑥 ∈ 𝐵 ∧ ¬ 𝜑)}) = {𝑦 ∣ ((𝑦 ∈ 𝐴 ∧ 𝜑) ∨ (𝑦 ∈ 𝐵 ∧ ¬ 𝜑))}
6		df-rab 3074	. . 3 ⊢ {𝑥 ∈ 𝐴 ∣ 𝜑} = {𝑥 ∣ (𝑥 ∈ 𝐴 ∧ 𝜑)}
7		df-rab 3074	. . 3 ⊢ {𝑥 ∈ 𝐵 ∣ ¬ 𝜑} = {𝑥 ∣ (𝑥 ∈ 𝐵 ∧ ¬ 𝜑)}
8	6, 7	uneq12i 4099	. 2 ⊢ ({𝑥 ∈ 𝐴 ∣ 𝜑} ∪ {𝑥 ∈ 𝐵 ∣ ¬ 𝜑}) = ({𝑥 ∣ (𝑥 ∈ 𝐴 ∧ 𝜑)} ∪ {𝑥 ∣ (𝑥 ∈ 𝐵 ∧ ¬ 𝜑)})
9		df-if 4465	. 2 ⊢ if(𝜑, 𝐴, 𝐵) = {𝑦 ∣ ((𝑦 ∈ 𝐴 ∧ 𝜑) ∨ (𝑦 ∈ 𝐵 ∧ ¬ 𝜑))}
10	5, 8, 9	3eqtr4ri 2778	1 ⊢ if(𝜑, 𝐴, 𝐵) = ({𝑥 ∈ 𝐴 ∣ 𝜑} ∪ {𝑥 ∈ 𝐵 ∣ ¬ 𝜑})

Syntax hints:  ¬ wn 3   ∧ wa 395   ∨ wo 843   = wceq 1541   ∈ wcel 2109  {cab 2716  {crab 3069   ∪ cun 3889  ifcif 4464

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1801  ax-4 1815  ax-5 1916  ax-6 1974  ax-7 2014  ax-8 2111  ax-9 2119  ax-ext 2710

This theorem depends on definitions:  df-bi 206  df-an 396  df-or 844  df-tru 1544  df-ex 1786  df-sb 2071  df-clab 2717  df-cleq 2731  df-clel 2817  df-rab 3074  df-v 3432  df-un 3896  df-if 4465

This theorem is referenced by:  ifeq1  4468  ifeq2  4469  dfif3  4478