Theorem bnj1317 35018

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 2728	. 2 ⊢ (𝑦 ∈ {𝑥 ∣ 𝜑} → ∀𝑥 𝑦 ∈ {𝑥 ∣ 𝜑})
3	1, 2	hbxfreq 2871	1 ⊢ (𝑦 ∈ 𝐴 → ∀𝑥 𝑦 ∈ 𝐴)

Syntax hints:   → wi 4  ∀wal 1546   = wceq 1548   ∈ wcel 2121  {cab 2719

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1803  ax-4 1817  ax-5 1918  ax-6 1975  ax-7 2016  ax-8 2123  ax-9 2131  ax-10 2154  ax-12 2191  ax-ext 2713

This theorem depends on definitions:  df-bi 209  df-an 398  df-or 855  df-ex 1788  df-nf 1792  df-sb 2075  df-clab 2720  df-cleq 2733  df-clel 2816

This theorem is referenced by:  bnj1014  35158  bnj1145  35190  bnj1384  35229  bnj1398  35231  bnj1448  35244  bnj1450  35247  bnj1466  35250  bnj1463  35252  bnj1491  35254  bnj1497  35257  bnj1498  35258  bnj1520  35263  bnj1501  35264