HomeHome Metamath Proof Explorer < Previous   Next >
Related theorems
Unicode version

Theorem dfif2 2367
Description: An alternate definition of the conditional operator df-if 2366 with one fewer connectives (but probably less intuitive to understand).
Assertion
Ref Expression
dfif2 |- if(ph, A, B) = {x | ((x e. B -> ph) -> (x e. A /\ ph))}
Distinct variable groups:   ph,x   x,A   x,B

Proof of Theorem dfif2
StepHypRef Expression
1 df-if 2366 . 2 |- if(ph, A, B) = {x | ((x e. A /\ ph) \/ (x e. B /\ -. ph))}
2 df-or 224 . . . 4 |- (((x e. B /\ -. ph) \/ (x e. A /\ ph)) <-> (-. (x e. B /\ -. ph) -> (x e. A /\ ph)))
3 orcom 246 . . . 4 |- (((x e. A /\ ph) \/ (x e. B /\ -. ph)) <-> ((x e. B /\ -. ph) \/ (x e. A /\ ph)))
4 iman 237 . . . . 5 |- ((x e. B -> ph) <-> -. (x e. B /\ -. ph))
54imbi1i 186 . . . 4 |- (((x e. B -> ph) -> (x e. A /\ ph)) <-> (-. (x e. B /\ -. ph) -> (x e. A /\ ph)))
62, 3, 53bitr4 183 . . 3 |- (((x e. A /\ ph) \/ (x e. B /\ -. ph)) <-> ((x e. B -> ph) -> (x e. A /\ ph)))
76abbii 1578 . 2 |- {x | ((x e. A /\ ph) \/ (x e. B /\ -. ph))} = {x | ((x e. B -> ph) -> (x e. A /\ ph))}
81, 7eqtr 1498 1 |- if(ph, A, B) = {x | ((x e. B -> ph) -> (x e. A /\ ph))}
Colors of variables: wff set class
Syntax hints:  -. wn 2   -> wi 3   \/ wo 222   /\ wa 223   = wceq 958   e. wcel 960  {cab 1466  ifcif 2365
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-7 964  ax-gen 965  ax-8 966  ax-10 968  ax-12 970  ax-17 973  ax-4 975  ax-5o 977  ax-6o 980  ax-9o 1125  ax-10o 1142  ax-16 1212  ax-11o 1220  ax-ext 1462
This theorem depends on definitions:  df-bi 147  df-or 224  df-an 225  df-ex 983  df-sb 1174  df-clab 1467  df-cleq 1472  df-clel 1475  df-if 2366
Copyright terms: Public domain