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

Theorem cador 1602
Description: The adder carry in disjunctive normal form. (Contributed by Mario Carneiro, 4-Sep-2016.) (Proof shortened by Wolf Lammen, 11-Jul-2020.)
Assertion
Ref Expression
cador (cadd(𝜑, 𝜓, 𝜒) ↔ ((𝜑𝜓) ∨ (𝜑𝜒) ∨ (𝜓𝜒)))

Proof of Theorem cador
StepHypRef Expression
1 xor2 1503 . . . . . . 7 ((𝜑𝜓) ↔ ((𝜑𝜓) ∧ ¬ (𝜑𝜓)))
21rbaib 541 . . . . . 6 (¬ (𝜑𝜓) → ((𝜑𝜓) ↔ (𝜑𝜓)))
32anbi1d 631 . . . . 5 (¬ (𝜑𝜓) → (((𝜑𝜓) ∧ 𝜒) ↔ ((𝜑𝜓) ∧ 𝜒)))
4 ancom 463 . . . . 5 (((𝜑𝜓) ∧ 𝜒) ↔ (𝜒 ∧ (𝜑𝜓)))
5 andir 1004 . . . . 5 (((𝜑𝜓) ∧ 𝜒) ↔ ((𝜑𝜒) ∨ (𝜓𝜒)))
63, 4, 53bitr3g 315 . . . 4 (¬ (𝜑𝜓) → ((𝜒 ∧ (𝜑𝜓)) ↔ ((𝜑𝜒) ∨ (𝜓𝜒))))
76pm5.74i 273 . . 3 ((¬ (𝜑𝜓) → (𝜒 ∧ (𝜑𝜓))) ↔ (¬ (𝜑𝜓) → ((𝜑𝜒) ∨ (𝜓𝜒))))
8 df-or 844 . . 3 (((𝜑𝜓) ∨ (𝜒 ∧ (𝜑𝜓))) ↔ (¬ (𝜑𝜓) → (𝜒 ∧ (𝜑𝜓))))
9 df-or 844 . . 3 (((𝜑𝜓) ∨ ((𝜑𝜒) ∨ (𝜓𝜒))) ↔ (¬ (𝜑𝜓) → ((𝜑𝜒) ∨ (𝜓𝜒))))
107, 8, 93bitr4i 305 . 2 (((𝜑𝜓) ∨ (𝜒 ∧ (𝜑𝜓))) ↔ ((𝜑𝜓) ∨ ((𝜑𝜒) ∨ (𝜓𝜒))))
11 df-cad 1601 . 2 (cadd(𝜑, 𝜓, 𝜒) ↔ ((𝜑𝜓) ∨ (𝜒 ∧ (𝜑𝜓))))
12 3orass 1084 . 2 (((𝜑𝜓) ∨ (𝜑𝜒) ∨ (𝜓𝜒)) ↔ ((𝜑𝜓) ∨ ((𝜑𝜒) ∨ (𝜓𝜒))))
1310, 11, 123bitr4i 305 1 (cadd(𝜑, 𝜓, 𝜒) ↔ ((𝜑𝜓) ∨ (𝜑𝜒) ∨ (𝜓𝜒)))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 208  wa 398  wo 843  w3o 1080  wxo 1497  caddwcad 1600
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-3or 1082  df-xor 1498  df-cad 1601
This theorem is referenced by:  cadan  1603  cadnot  1609
  Copyright terms: Public domain W3C validator