Theorem bnj1095 35412

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

This proof depends on syntax axioms:   → wi 4   ↔ wb 209  ∀wal 1567  ∀wral 3076

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-10 2177  ax-12 2212

This proof depends on definitions:  df-bi 210  df-or 862  df-ex 1812  df-nf 1816  df-ral 3077

This theorem is used by:  bnj1379  35460  bnj605  35537  bnj594  35542  bnj607  35546  bnj911  35562  bnj964  35573  bnj983  35581  bnj1093  35610  bnj1123  35616  bnj1145  35623  bnj1417  35671