Theorem bnj1232 32683

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 32628	. 2 ⊢ ((𝜓 ∧ 𝜒 ∧ 𝜃 ∧ 𝜏) → 𝜓)
3	1, 2	sylbi 216	1 ⊢ (𝜑 → 𝜓)

Syntax hints:   → wi 4   ↔ wb 205   ∧ w-bnj17 32565

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 206  df-an 396  df-3an 1087  df-bnj17 32566

This theorem is referenced by:  bnj605  32787  bnj607  32796  bnj944  32818  bnj969  32826  bnj970  32827  bnj1001  32839  bnj1110  32862  bnj1118  32864  bnj1128  32870  bnj1145  32873  bnj1311  32904