Theorem bnj1254 32689

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

Hypothesis

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

Assertion

Ref	Expression
bnj1254	⊢ (𝜑 → 𝜏)

Proof of Theorem bnj1254

Step	Hyp	Ref	Expression
1		bnj1254.1	. 2 ⊢ (𝜑 ↔ (𝜓 ∧ 𝜒 ∧ 𝜃 ∧ 𝜏))
2		id 22	. . 3 ⊢ (𝜏 → 𝜏)
3	2	bnj708 32636	. 2 ⊢ ((𝜓 ∧ 𝜒 ∧ 𝜃 ∧ 𝜏) → 𝜏)
4	1, 3	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-bnj17 32566

This theorem is referenced by:  bnj554  32779  bnj557  32781  bnj967  32825  bnj999  32838  bnj907  32847  bnj1118  32864  bnj1128  32870  bnj1253  32897  bnj1450  32930