Theorem bnj1235 35001

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

Step	Hyp	Ref	Expression
1		bnj1235.1	. 2 ⊢ (𝜑 ↔ (𝜓 ∧ 𝜒 ∧ 𝜃 ∧ 𝜏))
2		id 22	. 2 ⊢ (𝜒 → 𝜒)
3	1, 2	bnj770 34961	1 ⊢ (𝜑 → 𝜒)

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

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 398  df-3an 1095  df-bnj17 34885

This theorem is referenced by:  bnj966  35141  bnj967  35142  bnj910  35145  bnj1006  35157  bnj1018g  35160  bnj1018  35161  bnj1110  35179  bnj1121  35182  bnj1311  35221