Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > dfif6 | Structured version Visualization version GIF version |
Description: An alternate definition of the conditional operator df-if 4464 as a simple class abstraction. (Contributed by Mario Carneiro, 8-Sep-2013.) |
Ref | Expression |
---|---|
dfif6 | ⊢ if(𝜑, 𝐴, 𝐵) = ({𝑥 ∈ 𝐴 ∣ 𝜑} ∪ {𝑥 ∈ 𝐵 ∣ ¬ 𝜑}) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | unab 4267 | . 2 ⊢ ({𝑥 ∣ (𝑥 ∈ 𝐴 ∧ 𝜑)} ∪ {𝑥 ∣ (𝑥 ∈ 𝐵 ∧ ¬ 𝜑)}) = {𝑥 ∣ ((𝑥 ∈ 𝐴 ∧ 𝜑) ∨ (𝑥 ∈ 𝐵 ∧ ¬ 𝜑))} | |
2 | df-rab 3144 | . . 3 ⊢ {𝑥 ∈ 𝐴 ∣ 𝜑} = {𝑥 ∣ (𝑥 ∈ 𝐴 ∧ 𝜑)} | |
3 | df-rab 3144 | . . 3 ⊢ {𝑥 ∈ 𝐵 ∣ ¬ 𝜑} = {𝑥 ∣ (𝑥 ∈ 𝐵 ∧ ¬ 𝜑)} | |
4 | 2, 3 | uneq12i 4134 | . 2 ⊢ ({𝑥 ∈ 𝐴 ∣ 𝜑} ∪ {𝑥 ∈ 𝐵 ∣ ¬ 𝜑}) = ({𝑥 ∣ (𝑥 ∈ 𝐴 ∧ 𝜑)} ∪ {𝑥 ∣ (𝑥 ∈ 𝐵 ∧ ¬ 𝜑)}) |
5 | df-if 4464 | . 2 ⊢ if(𝜑, 𝐴, 𝐵) = {𝑥 ∣ ((𝑥 ∈ 𝐴 ∧ 𝜑) ∨ (𝑥 ∈ 𝐵 ∧ ¬ 𝜑))} | |
6 | 1, 4, 5 | 3eqtr4ri 2852 | 1 ⊢ if(𝜑, 𝐴, 𝐵) = ({𝑥 ∈ 𝐴 ∣ 𝜑} ∪ {𝑥 ∈ 𝐵 ∣ ¬ 𝜑}) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 ∧ wa 396 ∨ wo 841 = wceq 1528 ∈ wcel 2105 {cab 2796 {crab 3139 ∪ cun 3931 ifcif 4463 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1787 ax-4 1801 ax-5 1902 ax-6 1961 ax-7 2006 ax-8 2107 ax-9 2115 ax-10 2136 ax-11 2151 ax-12 2167 ax-ext 2790 |
This theorem depends on definitions: df-bi 208 df-an 397 df-or 842 df-tru 1531 df-ex 1772 df-nf 1776 df-sb 2061 df-clab 2797 df-cleq 2811 df-clel 2890 df-nfc 2960 df-rab 3144 df-v 3494 df-un 3938 df-if 4464 |
This theorem is referenced by: ifeq1 4467 ifeq2 4468 dfif3 4477 |
Copyright terms: Public domain | W3C validator |