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 35038
Description: First-order logic and set theory. See bnj1441 35037 for a version with more disjoint variable conditions, but not requiring ax-13 2382. (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 3394 . 2 {𝑥𝐴𝜑} = {𝑥 ∣ (𝑥𝐴𝜑)}
2 bnj1441g.1 . . . 4 (𝑥𝐴 → ∀𝑦 𝑥𝐴)
3 bnj1441g.2 . . . 4 (𝜑 → ∀𝑦𝜑)
42, 3hban 2313 . . 3 ((𝑥𝐴𝜑) → ∀𝑦(𝑥𝐴𝜑))
54hbabg 2730 . 2 (𝑧 ∈ {𝑥 ∣ (𝑥𝐴𝜑)} → ∀𝑦 𝑧 ∈ {𝑥 ∣ (𝑥𝐴𝜑)})
61, 5hbxfreq 2871 1 (𝑧 ∈ {𝑥𝐴𝜑} → ∀𝑦 𝑧 ∈ {𝑥𝐴𝜑})
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 397  wal 1546  wcel 2121  {cab 2719  {crab 3393
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-11 2170  ax-12 2191  ax-13 2382  ax-ext 2713
This theorem depends on definitions:  df-bi 209  df-an 398  df-or 855  df-tru 1551  df-ex 1788  df-nf 1792  df-sb 2075  df-clab 2720  df-cleq 2733  df-clel 2816  df-rab 3394
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator