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

Theorem 3mix1 1351
Description: Introduction in triple disjunction. (Contributed by NM, 4-Apr-1995.)
Assertion
Ref Expression
3mix1 (𝜑 → (𝜑 ∨ 𝜓 ∨ 𝜒))

Proof of Theorem 3mix1
StepHypRef Expression
1 orc 881 . 2 (𝜑 → (𝜑 ∨ (𝜓 ∨ 𝜒)))
2 3orass 1107 . 2 ((𝜑 ∨ 𝜓 ∨ 𝜒) ↔ (𝜑 ∨ (𝜓 ∨ 𝜒)))
31, 2sylibr 237 1 (𝜑 → (𝜑 ∨ 𝜓 ∨ 𝜒))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∨ wo 861   ∨ w3o 1103
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  df-3or 1105
This theorem is used by:  3mix2  1352  3mix3  1353  3mix1i  1354  3mix1d  1357  tppreqb  4769  onzsl  7890  sornom  10393  fpwwe2lem12  10765  nn0le2is012  12802  hashv01gt1  14529  hash1to3  14677  cshwshashlem1  17319  zabsle1  27682  nogesgn1o  28089  ltssolem1  28091  nosep1o  28097  colinearalg  29547  frgrregorufr0  30984  frege129d  45084
  Copyright terms: Public domain W3C validator