Users' Mathboxes Mathbox for Jonathan Ben-Naim < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  bnj1235 Structured version   Visualization version   GIF version

Theorem bnj1235 35546
Description: First-order logic and set theory. (Contributed by Jonathan Ben-Naim, 3-Jun-2011.) (New usage is discouraged.)
Hypothesis
Ref Expression
bnj1235.1 (𝜑 ↔ (𝜓 ∧ 𝜒 ∧ 𝜃 ∧ 𝜏))
Assertion
Ref Expression
bnj1235 (𝜑 → 𝜒)

Proof of Theorem bnj1235
StepHypRef Expression
1 bnj1235.1 . 2 (𝜑 ↔ (𝜓 ∧ 𝜒 ∧ 𝜃 ∧ 𝜏))
2 id 23 . 2 (𝜒 → 𝜒)
31, 2bnj770 35506 1 (𝜑 → 𝜒)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ w-bnj17 35429
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-an 402  df-3an 1106  df-bnj17 35430
This theorem is used by:  bnj966  35686  bnj967  35687  bnj910  35690  bnj1006  35702  bnj1018g  35705  bnj1018  35706  bnj1110  35724  bnj1121  35727  bnj1311  35766
  Copyright terms: Public domain W3C validator