MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  abexex Structured version   Visualization version   GIF version

Theorem abexex 7970
Description: A condition where a class abstraction continues to exist after its wff is existentially quantified. (Contributed by NM, 4-Mar-2007.)
Hypotheses
Ref Expression
abexex.1 𝐴 ∈ V
abexex.2 (𝜑𝑥𝐴)
abexex.3 {𝑦𝜑} ∈ V
Assertion
Ref Expression
abexex {𝑦 ∣ ∃𝑥𝜑} ∈ V
Distinct variable group:   𝑥,𝑦,𝐴
Allowed substitution hints:   𝜑(𝑥, 𝑦)

Proof of Theorem abexex
StepHypRef Expression
1 df-rex 3092 . . . 4 (∃𝑥𝐴 𝜑 ↔ ∃𝑥(𝑥𝐴𝜑))
2 abexex.2 . . . . . 6 (𝜑𝑥𝐴)
32pm4.71ri 570 . . . . 5 (𝜑 ↔ (𝑥𝐴𝜑))
43exbii 1881 . . . 4 (∃𝑥𝜑 ↔ ∃𝑥(𝑥𝐴𝜑))
51, 4bitr4i 281 . . 3 (∃𝑥𝐴 𝜑 ↔ ∃𝑥𝜑)
65abbii 2832 . 2 {𝑦 ∣ ∃𝑥𝐴 𝜑} = {𝑦 ∣ ∃𝑥𝜑}
7 abexex.1 . . 3 𝐴 ∈ V
8 abexex.3 . . 3 {𝑦𝜑} ∈ V
97, 8abrexex2 7968 . 2 {𝑦 ∣ ∃𝑥𝐴 𝜑} ∈ V
106, 9eqeltrri 2862 1 {𝑦 ∣ ∃𝑥𝜑} ∈ V
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wi 4  wa 401  wex 1812  wcel 2146  {cab 2743  wrex 3091  Vcvv 3457
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 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2737  ax-rep 5240  ax-sep 5259  ax-un 7738
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-tru 1573  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2569  df-clab 2744  df-cleq 2757  df-clel 2840  df-nfc 2914  df-ral 3082  df-rex 3092  df-v 3459  df-ss 3923  df-uni 4875  df-iun 4960
This theorem is used by:  brdom7disj  10526  brdom6disj  10527
  Copyright terms: Public domain W3C validator