ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  bianass GIF version

Theorem bianass 466
Description: An inference to merge two lists of conjuncts. (Contributed by Giovanni Mascellani, 23-May-2019.)
Hypothesis
Ref Expression
bianass.1 (𝜑 ↔ (𝜓𝜒))
Assertion
Ref Expression
bianass ((𝜂𝜑) ↔ ((𝜂𝜓) ∧ 𝜒))

Proof of Theorem bianass
StepHypRef Expression
1 bianass.1 . . 3 (𝜑 ↔ (𝜓𝜒))
21anbi2i 454 . 2 ((𝜂𝜑) ↔ (𝜂 ∧ (𝜓𝜒)))
3 anass 399 . 2 (((𝜂𝜓) ∧ 𝜒) ↔ (𝜂 ∧ (𝜓𝜒)))
42, 3bitr4i 186 1 ((𝜂𝜑) ↔ ((𝜂𝜓) ∧ 𝜒))
Colors of variables: wff set class
Syntax hints:  wa 103  wb 104
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107
This theorem depends on definitions:  df-bi 116
This theorem is referenced by:  bianassc  467
  Copyright terms: Public domain W3C validator