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

Theorem rb-bijust 1782
Description: Justification for rb-imdf 1783. (Contributed by Anthony Hart, 17-Aug-2011.) (Proof modification is discouraged.) (New usage is discouraged.)
Assertion
Ref Expression
rb-bijust ((𝜑 ↔ 𝜓) ↔ ¬ (¬ (¬ 𝜑 ∨ 𝜓) ∨ ¬ (¬ 𝜓 ∨ 𝜑)))

Proof of Theorem rb-bijust
StepHypRef Expression
1 dfbi1 216 . 2 ((𝜑 ↔ 𝜓) ↔ ¬ ((𝜑 → 𝜓) → ¬ (𝜓 → 𝜑)))
2 imor 867 . . . 4 ((𝜑 → 𝜓) ↔ (¬ 𝜑 ∨ 𝜓))
3 imor 867 . . . . 5 ((𝜓 → 𝜑) ↔ (¬ 𝜓 ∨ 𝜑))
43notbii 323 . . . 4 (¬ (𝜓 → 𝜑) ↔ ¬ (¬ 𝜓 ∨ 𝜑))
52, 4imbi12i 353 . . 3 (((𝜑 → 𝜓) → ¬ (𝜓 → 𝜑)) ↔ ((¬ 𝜑 ∨ 𝜓) → ¬ (¬ 𝜓 ∨ 𝜑)))
65notbii 323 . 2 (¬ ((𝜑 → 𝜓) → ¬ (𝜓 → 𝜑)) ↔ ¬ ((¬ 𝜑 ∨ 𝜓) → ¬ (¬ 𝜓 ∨ 𝜑)))
7 pm4.62 870 . . 3 (((¬ 𝜑 ∨ 𝜓) → ¬ (¬ 𝜓 ∨ 𝜑)) ↔ (¬ (¬ 𝜑 ∨ 𝜓) ∨ ¬ (¬ 𝜓 ∨ 𝜑)))
87notbii 323 . 2 (¬ ((¬ 𝜑 ∨ 𝜓) → ¬ (¬ 𝜓 ∨ 𝜑)) ↔ ¬ (¬ (¬ 𝜑 ∨ 𝜓) ∨ ¬ (¬ 𝜓 ∨ 𝜑)))
91, 6, 83bitri 300 1 ((𝜑 ↔ 𝜓) ↔ ¬ (¬ (¬ 𝜑 ∨ 𝜓) ∨ ¬ (¬ 𝜓 ∨ 𝜑)))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209   ∨ wo 861
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8
This proof depends on definitions:  df-bi 210  df-or 862
This theorem is used by:  rb-imdf  1783
  Copyright terms: Public domain W3C validator