Theorem bnj1317 35371

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

Hypothesis

Ref	Expression
bnj1317.1	⊢ 𝐴 = {𝑥 ∣ 𝜑}

Assertion

Ref	Expression
bnj1317	⊢ (𝑦 ∈ 𝐴 → ∀𝑥 𝑦 ∈ 𝐴)

Distinct variable group:   𝑥,𝑦

Allowed substitution hints:   𝜑(𝑥, 𝑦)   𝐴(𝑥, 𝑦)

Proof of Theorem bnj1317

Step	Hyp	Ref	Expression
1		bnj1317.1	. 2 ⊢ 𝐴 = {𝑥 ∣ 𝜑}
2		hbab1 2747	. 2 ⊢ (𝑦 ∈ {𝑥 ∣ 𝜑} → ∀𝑥 𝑦 ∈ {𝑥 ∣ 𝜑})
3	1, 2	hbxfreq 2890	1 ⊢ (𝑦 ∈ 𝐴 → ∀𝑥 𝑦 ∈ 𝐴)

This proof depends on syntax axioms:   → wi 4  ∀wal 1568   = wceq 1570   ∈ wcel 2145  {cab 2738

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-12 2213  ax-ext 2732

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-ex 1813  df-nf 1817  df-sb 2100  df-clab 2739  df-cleq 2752  df-clel 2835

This theorem is used by:  bnj1014  35511  bnj1145  35543  bnj1384  35582  bnj1398  35584  bnj1448  35597  bnj1450  35600  bnj1466  35603  bnj1463  35605  bnj1491  35607  bnj1497  35610  bnj1498  35611  bnj1520  35616  bnj1501  35617