Theorem bnj1095 32661

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

Hypothesis

Ref	Expression
bnj1095.1	⊢ (𝜑 ↔ ∀𝑥 ∈ 𝐴 𝜓)

Assertion

Ref	Expression
bnj1095	⊢ (𝜑 → ∀𝑥𝜑)

Proof of Theorem bnj1095

Step	Hyp	Ref	Expression
1		bnj1095.1	. 2 ⊢ (𝜑 ↔ ∀𝑥 ∈ 𝐴 𝜓)
2		hbra1 3143	. 2 ⊢ (∀𝑥 ∈ 𝐴 𝜓 → ∀𝑥∀𝑥 ∈ 𝐴 𝜓)
3	1, 2	hbxfrbi 1828	1 ⊢ (𝜑 → ∀𝑥𝜑)

Syntax hints:   → wi 4   ↔ wb 205  ∀wal 1537  ∀wral 3063

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1799  ax-4 1813  ax-5 1914  ax-6 1972  ax-7 2012  ax-10 2139  ax-12 2173

This theorem depends on definitions:  df-bi 206  df-or 844  df-ex 1784  df-nf 1788  df-ral 3068

This theorem is referenced by:  bnj1379  32710  bnj605  32787  bnj594  32792  bnj607  32796  bnj911  32812  bnj964  32823  bnj983  32831  bnj1093  32860  bnj1123  32866  bnj1145  32873  bnj1417  32921