Theorem bnj1441g 35138

Description: First-order logic and set theory. See bnj1441 35137 for a version with more disjoint variable conditions, but not requiring ax-13 2405. (Contributed by Jonathan Ben-Naim, 3-Jun-2011.) (New usage is discouraged.)

Hypotheses

Ref	Expression
bnj1441g.1	⊢ (𝑥 ∈ 𝐴 → ∀𝑦 𝑥 ∈ 𝐴)
bnj1441g.2	⊢ (𝜑 → ∀𝑦𝜑)

Assertion

Ref	Expression
bnj1441g	⊢ (𝑧 ∈ {𝑥 ∈ 𝐴 ∣ 𝜑} → ∀𝑦 𝑧 ∈ {𝑥 ∈ 𝐴 ∣ 𝜑})

Distinct variable group:   𝑦,𝑧

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

Proof of Theorem bnj1441g

Step	Hyp	Ref	Expression
1		df-rab 3417	. 2 ⊢ {𝑥 ∈ 𝐴 ∣ 𝜑} = {𝑥 ∣ (𝑥 ∈ 𝐴 ∧ 𝜑)}
2		bnj1441g.1	. . . 4 ⊢ (𝑥 ∈ 𝐴 → ∀𝑦 𝑥 ∈ 𝐴)
3		bnj1441g.2	. . . 4 ⊢ (𝜑 → ∀𝑦𝜑)
4	2, 3	hban 2336	. . 3 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝜑) → ∀𝑦(𝑥 ∈ 𝐴 ∧ 𝜑))
5	4	hbabg 2753	. 2 ⊢ (𝑧 ∈ {𝑥 ∣ (𝑥 ∈ 𝐴 ∧ 𝜑)} → ∀𝑦 𝑧 ∈ {𝑥 ∣ (𝑥 ∈ 𝐴 ∧ 𝜑)})
6	1, 5	hbxfreq 2894	1 ⊢ (𝑧 ∈ {𝑥 ∈ 𝐴 ∣ 𝜑} → ∀𝑦 𝑧 ∈ {𝑥 ∈ 𝐴 ∣ 𝜑})

Syntax hints:   → wi 4   ∧ wa 399  ∀wal 1560   ∈ wcel 2144  {cab 2742  {crab 3416

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1817  ax-4 1831  ax-5 1932  ax-6 1989  ax-7 2030  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2214  ax-13 2405  ax-ext 2736

This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-tru 1565  df-ex 1802  df-nf 1806  df-sb 2093  df-clab 2743  df-cleq 2756  df-clel 2839  df-rab 3417

This theorem is referenced by: (None)