Theorem bnj1232 35100

Description: First-order logic and set theory. (Contributed by Jonathan Ben-Naim, 3-Jun-2011.) (New usage is discouraged.)

Hypothesis

Ref	Expression
bnj1232.1	⊢ (𝜑 ↔ (𝜓 ∧ 𝜒 ∧ 𝜃 ∧ 𝜏))

Assertion

Ref	Expression
bnj1232	⊢ (𝜑 → 𝜓)

Proof of Theorem bnj1232

Step	Hyp	Ref	Expression
1		bnj1232.1	. 2 ⊢ (𝜑 ↔ (𝜓 ∧ 𝜒 ∧ 𝜃 ∧ 𝜏))
2		bnj642 35046	. 2 ⊢ ((𝜓 ∧ 𝜒 ∧ 𝜃 ∧ 𝜏) → 𝜓)
3	1, 2	sylbi 219	1 ⊢ (𝜑 → 𝜓)

Syntax hints:   → wi 4   ↔ wb 208   ∧ w-bnj17 34984

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 400  df-3an 1101  df-bnj17 34985

This theorem is referenced by:  bnj605  35204  bnj607  35213  bnj944  35235  bnj969  35243  bnj970  35244  bnj1001  35256  bnj1110  35279  bnj1118  35281  bnj1128  35287  bnj1145  35290  bnj1311  35321