Users' Mathboxes Mathbox for Jonathan Ben-Naim < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  bnj1441g Structured version   Visualization version   GIF version

Theorem bnj1441g 35471
Description: First-order logic and set theory. See bnj1441 35470 for a version with more disjoint variable conditions, but not requiring ax-13 2401. (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
StepHypRef Expression
1 df-rab 3413 . 2 {𝑥 ∈ 𝐴 ∣ 𝜑} = {𝑥 ∣ (𝑥 ∈ 𝐴 ∧ 𝜑)}
2 bnj1441g.1 . . . 4 (𝑥 ∈ 𝐴 → ∀𝑦 𝑥 ∈ 𝐴)
3 bnj1441g.2 . . . 4 (𝜑 → ∀𝑦𝜑)
42, 3hban 2333 . . 3 ((𝑥 ∈ 𝐴 ∧ 𝜑) → ∀𝑦(𝑥 ∈ 𝐴 ∧ 𝜑))
54hbabg 2749 . 2 (𝑧 ∈ {𝑥 ∣ (𝑥 ∈ 𝐴 ∧ 𝜑)} → ∀𝑦 𝑧 ∈ {𝑥 ∣ (𝑥 ∈ 𝐴 ∧ 𝜑)})
61, 5hbxfreq 2890 1 (𝑧 ∈ {𝑥 ∈ 𝐴 ∣ 𝜑} → ∀𝑦 𝑧 ∈ {𝑥 ∈ 𝐴 ∣ 𝜑})
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401  ∀wal 1567   ∈ wcel 2144  {cab 2738  {crab 3412
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-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-13 2401  ax-ext 2732
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-tru 1572  df-ex 1812  df-nf 1816  df-sb 2099  df-clab 2739  df-cleq 2752  df-clel 2835  df-rab 3413
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator