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

Theorem oprabrexex2 7991
Description: Existence of an existentially restricted operation abstraction. (Contributed by Jeff Madsen, 11-Jun-2010.)
Hypotheses
Ref Expression
oprabrexex2.1 𝐴 ∈ V
oprabrexex2.2 {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ 𝜑} ∈ V
Assertion
Ref Expression
oprabrexex2 {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ∃𝑤 ∈ 𝐴 𝜑} ∈ V
Distinct variable group:   𝑥,𝐴,𝑦,𝑧,𝑤
Allowed substitution hints:   𝜑(𝑥, 𝑦, 𝑧, 𝑤)

Proof of Theorem oprabrexex2
Dummy variable 𝑣 is distinct from all other variables.
StepHypRef Expression
1 df-oprab 7425 . . 3 {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ∃𝑤 ∈ 𝐴 𝜑} = {𝑣 ∣ ∃𝑥∃𝑦∃𝑧(𝑣 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∧ ∃𝑤 ∈ 𝐴 𝜑)}
2 rexcom4 3289 . . . . 5 (∃𝑤 ∈ 𝐴 ∃𝑥∃𝑦∃𝑧(𝑣 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∧ 𝜑) ↔ ∃𝑥∃𝑤 ∈ 𝐴 ∃𝑦∃𝑧(𝑣 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∧ 𝜑))
3 rexcom4 3289 . . . . . . 7 (∃𝑤 ∈ 𝐴 ∃𝑦∃𝑧(𝑣 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∧ 𝜑) ↔ ∃𝑦∃𝑤 ∈ 𝐴 ∃𝑧(𝑣 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∧ 𝜑))
4 rexcom4 3289 . . . . . . . . 9 (∃𝑤 ∈ 𝐴 ∃𝑧(𝑣 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∧ 𝜑) ↔ ∃𝑧∃𝑤 ∈ 𝐴 (𝑣 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∧ 𝜑))
5 r19.42v 3194 . . . . . . . . . 10 (∃𝑤 ∈ 𝐴 (𝑣 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∧ 𝜑) ↔ (𝑣 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∧ ∃𝑤 ∈ 𝐴 𝜑))
65exbii 1880 . . . . . . . . 9 (∃𝑧∃𝑤 ∈ 𝐴 (𝑣 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∧ 𝜑) ↔ ∃𝑧(𝑣 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∧ ∃𝑤 ∈ 𝐴 𝜑))
74, 6bitri 278 . . . . . . . 8 (∃𝑤 ∈ 𝐴 ∃𝑧(𝑣 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∧ 𝜑) ↔ ∃𝑧(𝑣 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∧ ∃𝑤 ∈ 𝐴 𝜑))
87exbii 1880 . . . . . . 7 (∃𝑦∃𝑤 ∈ 𝐴 ∃𝑧(𝑣 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∧ 𝜑) ↔ ∃𝑦∃𝑧(𝑣 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∧ ∃𝑤 ∈ 𝐴 𝜑))
93, 8bitri 278 . . . . . 6 (∃𝑤 ∈ 𝐴 ∃𝑦∃𝑧(𝑣 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∧ 𝜑) ↔ ∃𝑦∃𝑧(𝑣 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∧ ∃𝑤 ∈ 𝐴 𝜑))
109exbii 1880 . . . . 5 (∃𝑥∃𝑤 ∈ 𝐴 ∃𝑦∃𝑧(𝑣 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∧ 𝜑) ↔ ∃𝑥∃𝑦∃𝑧(𝑣 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∧ ∃𝑤 ∈ 𝐴 𝜑))
112, 10bitr2i 279 . . . 4 (∃𝑥∃𝑦∃𝑧(𝑣 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∧ ∃𝑤 ∈ 𝐴 𝜑) ↔ ∃𝑤 ∈ 𝐴 ∃𝑥∃𝑦∃𝑧(𝑣 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∧ 𝜑))
1211abbii 2827 . . 3 {𝑣 ∣ ∃𝑥∃𝑦∃𝑧(𝑣 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∧ ∃𝑤 ∈ 𝐴 𝜑)} = {𝑣 ∣ ∃𝑤 ∈ 𝐴 ∃𝑥∃𝑦∃𝑧(𝑣 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∧ 𝜑)}
131, 12eqtri 2783 . 2 {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ∃𝑤 ∈ 𝐴 𝜑} = {𝑣 ∣ ∃𝑤 ∈ 𝐴 ∃𝑥∃𝑦∃𝑧(𝑣 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∧ 𝜑)}
14 oprabrexex2.1 . . 3 𝐴 ∈ V
15 df-oprab 7425 . . . 4 {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ 𝜑} = {𝑣 ∣ ∃𝑥∃𝑦∃𝑧(𝑣 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∧ 𝜑)}
16 oprabrexex2.2 . . . 4 {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ 𝜑} ∈ V
1715, 16eqeltrri 2857 . . 3 {𝑣 ∣ ∃𝑥∃𝑦∃𝑧(𝑣 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∧ 𝜑)} ∈ V
1814, 17abrexex2 7982 . 2 {𝑣 ∣ ∃𝑤 ∈ 𝐴 ∃𝑥∃𝑦∃𝑧(𝑣 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∧ 𝜑)} ∈ V
1913, 18eqeltri 2856 1 {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ∃𝑤 ∈ 𝐴 𝜑} ∈ V
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   ∧ wa 401   = wceq 1569  ∃wex 1811   ∈ wcel 2144  {cab 2738  ∃wrex 3086  Vcvv 3450  ⟨cop 4834  {coprab 7422
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-ext 2732  ax-rep 5231  ax-sep 5248  ax-un 7752
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-mo 2564  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ral 3077  df-rex 3087  df-v 3452  df-ss 3896  df-uni 4867  df-iun 4952  df-oprab 7425
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator