Users' Mathboxes Mathbox for Richard Penner < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  ifpid2 Structured version   Visualization version   GIF version

Theorem ifpid2 39843
Description: Restate wff as conditional logic operator. (Contributed by RP, 20-Apr-2020.)
Assertion
Ref Expression
ifpid2 (𝜑 ↔ if-(𝜑, ⊤, ⊥))

Proof of Theorem ifpid2
StepHypRef Expression
1 tru 1541 . . . 4
21olci 862 . . 3 𝜑 ∨ ⊤)
32biantrur 533 . 2 ((𝜑 ∨ ⊥) ↔ ((¬ 𝜑 ∨ ⊤) ∧ (𝜑 ∨ ⊥)))
4 fal 1551 . . 3 ¬ ⊥
54biorfi 935 . 2 (𝜑 ↔ (𝜑 ∨ ⊥))
6 dfifp4 1061 . 2 (if-(𝜑, ⊤, ⊥) ↔ ((¬ 𝜑 ∨ ⊤) ∧ (𝜑 ∨ ⊥)))
73, 5, 63bitr4i 305 1 (𝜑 ↔ if-(𝜑, ⊤, ⊥))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wb 208  wa 398  wo 843  if-wif 1057  wtru 1538  wfal 1549
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-ifp 1058  df-tru 1540  df-fal 1550
This theorem is referenced by:  frege52aid  40211
  Copyright terms: Public domain W3C validator