Theorem bnj1095 35115

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 3308	. 2 ⊢ (∀𝑥 ∈ 𝐴 𝜓 → ∀𝑥∀𝑥 ∈ 𝐴 𝜓)
3	1, 2	hbxfrbi 1852	1 ⊢ (𝜑 → ∀𝑥𝜑)

Syntax hints:   → wi 4   ↔ wb 209  ∀wal 1565  ∀wral 3085

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1822  ax-4 1836  ax-5 1937  ax-6 1994  ax-7 2035  ax-10 2182  ax-12 2219

This theorem depends on definitions:  df-bi 210  df-or 861  df-ex 1807  df-nf 1811  df-ral 3086

This theorem is referenced by:  bnj1379  35163  bnj605  35240  bnj594  35245  bnj607  35249  bnj911  35265  bnj964  35276  bnj983  35284  bnj1093  35313  bnj1123  35319  bnj1145  35326  bnj1417  35374