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

Theorem oprabrexex2 8024
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 7455 . . 3 {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ∃𝑤 ∈ 𝐴 𝜑} = {𝑣 ∣ ∃𝑥∃𝑦∃𝑧(𝑣 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∧ ∃𝑤 ∈ 𝐴 𝜑)}
2 rexcom4 3293 . . . . 5 (∃𝑤 ∈ 𝐴 ∃𝑥∃𝑦∃𝑧(𝑣 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∧ 𝜑) ↔ ∃𝑥∃𝑤 ∈ 𝐴 ∃𝑦∃𝑧(𝑣 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∧ 𝜑))
3 rexcom4 3293 . . . . . . 7 (∃𝑤 ∈ 𝐴 ∃𝑦∃𝑧(𝑣 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∧ 𝜑) ↔ ∃𝑦∃𝑤 ∈ 𝐴 ∃𝑧(𝑣 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∧ 𝜑))
4 rexcom4 3293 . . . . . . . . 9 (∃𝑤 ∈ 𝐴 ∃𝑧(𝑣 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∧ 𝜑) ↔ ∃𝑧∃𝑤 ∈ 𝐴 (𝑣 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∧ 𝜑))
5 r19.42v 3198 . . . . . . . . . 10 (∃𝑤 ∈ 𝐴 (𝑣 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∧ 𝜑) ↔ (𝑣 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∧ ∃𝑤 ∈ 𝐴 𝜑))
65exbii 1881 . . . . . . . . 9 (∃𝑧∃𝑤 ∈ 𝐴 (𝑣 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∧ 𝜑) ↔ ∃𝑧(𝑣 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∧ ∃𝑤 ∈ 𝐴 𝜑))
74, 6bitri 278 . . . . . . . 8 (∃𝑤 ∈ 𝐴 ∃𝑧(𝑣 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∧ 𝜑) ↔ ∃𝑧(𝑣 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∧ ∃𝑤 ∈ 𝐴 𝜑))
87exbii 1881 . . . . . . 7 (∃𝑦∃𝑤 ∈ 𝐴 ∃𝑧(𝑣 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∧ 𝜑) ↔ ∃𝑦∃𝑧(𝑣 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∧ ∃𝑤 ∈ 𝐴 𝜑))
93, 8bitri 278 . . . . . 6 (∃𝑤 ∈ 𝐴 ∃𝑦∃𝑧(𝑣 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∧ 𝜑) ↔ ∃𝑦∃𝑧(𝑣 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∧ ∃𝑤 ∈ 𝐴 𝜑))
109exbii 1881 . . . . 5 (∃𝑥∃𝑤 ∈ 𝐴 ∃𝑦∃𝑧(𝑣 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∧ 𝜑) ↔ ∃𝑥∃𝑦∃𝑧(𝑣 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∧ ∃𝑤 ∈ 𝐴 𝜑))
112, 10bitr2i 279 . . . 4 (∃𝑥∃𝑦∃𝑧(𝑣 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∧ ∃𝑤 ∈ 𝐴 𝜑) ↔ ∃𝑤 ∈ 𝐴 ∃𝑥∃𝑦∃𝑧(𝑣 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∧ 𝜑))
1211abbii 2830 . . 3 {𝑣 ∣ ∃𝑥∃𝑦∃𝑧(𝑣 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∧ ∃𝑤 ∈ 𝐴 𝜑)} = {𝑣 ∣ ∃𝑤 ∈ 𝐴 ∃𝑥∃𝑦∃𝑧(𝑣 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∧ 𝜑)}
131, 12eqtri 2786 . 2 {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ∃𝑤 ∈ 𝐴 𝜑} = {𝑣 ∣ ∃𝑤 ∈ 𝐴 ∃𝑥∃𝑦∃𝑧(𝑣 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∧ 𝜑)}
14 oprabrexex2.1 . . 3 𝐴 ∈ V
15 df-oprab 7455 . . . 4 {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ 𝜑} = {𝑣 ∣ ∃𝑥∃𝑦∃𝑧(𝑣 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∧ 𝜑)}
16 oprabrexex2.2 . . . 4 {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ 𝜑} ∈ V
1715, 16eqeltrri 2861 . . 3 {𝑣 ∣ ∃𝑥∃𝑦∃𝑧(𝑣 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∧ 𝜑)} ∈ V
1814, 17abrexex2 8015 . 2 {𝑣 ∣ ∃𝑤 ∈ 𝐴 ∃𝑥∃𝑦∃𝑧(𝑣 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∧ 𝜑)} ∈ V
1913, 18eqeltri 2860 1 {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ∃𝑤 ∈ 𝐴 𝜑} ∈ V
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   ∧ wa 401   = wceq 1570  ∃wex 1812   ∈ wcel 2147  {cab 2741  ∃wrex 3090  Vcvv 3454  ⟨cop 4840  {coprab 7452
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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-rep 5238  ax-sep 5255  ax-un 7783
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 2102  df-mo 2567  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ral 3081  df-rex 3091  df-v 3456  df-ss 3901  df-uni 4873  df-iun 4958  df-oprab 7455
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator