NFE Home New Foundations Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  NFE Home  >  Th. List  >  hadbi123i GIF version

Theorem hadbi123i 1384
Description: Equality theorem for half adder. (Contributed by Mario Carneiro, 4-Sep-2016.)
Hypotheses
Ref Expression
hadbii.1 ⊢ (φ ↔ ψ)
hadbii.2 ⊢ (χ ↔ θ)
hadbii.3 ⊢ (τ ↔ η)
Assertion
Ref Expression
hadbi123i ⊢ (hadd(φ, χ, τ) ↔ hadd(ψ, θ, η))

Proof of Theorem hadbi123i
StepHypRef Expression
1 hadbii.1 . . . 4 ⊢ (φ ↔ ψ)
21a1i 10 . . 3 ⊢ ( ⊤ → (φ ↔ ψ))
3 hadbii.2 . . . 4 ⊢ (χ ↔ θ)
43a1i 10 . . 3 ⊢ ( ⊤ → (χ ↔ θ))
5 hadbii.3 . . . 4 ⊢ (τ ↔ η)
65a1i 10 . . 3 ⊢ ( ⊤ → (τ ↔ η))
72, 4, 6hadbi123d 1382 . 2 ⊢ ( ⊤ → (hadd(φ, χ, τ) ↔ hadd(ψ, θ, η)))
87trud 1323 1 ⊢ (hadd(φ, χ, τ) ↔ hadd(ψ, θ, η))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   ↔ wb 176   ⊤ wtru 1316  haddwhad 1378
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8
This proof depends on definitions:  df-bi 177  df-xor 1305  df-tru 1319  df-had 1380
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator