Intuitionistic Logic Explorer < Previous   Next > Nearby theorems Mirrors  >  Home  >  ILE Home  >  Th. List  >  oprabrexex2 GIF version

Theorem oprabrexex2 5784
 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 5543 . . 3 {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ∃𝑤𝐴 𝜑} = {𝑣 ∣ ∃𝑥𝑦𝑧(𝑣 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∧ ∃𝑤𝐴 𝜑)}
2 rexcom4 2594 . . . . 5 (∃𝑤𝐴𝑥𝑦𝑧(𝑣 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∧ 𝜑) ↔ ∃𝑥𝑤𝐴𝑦𝑧(𝑣 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∧ 𝜑))
3 rexcom4 2594 . . . . . . 7 (∃𝑤𝐴𝑦𝑧(𝑣 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∧ 𝜑) ↔ ∃𝑦𝑤𝐴𝑧(𝑣 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∧ 𝜑))
4 rexcom4 2594 . . . . . . . . 9 (∃𝑤𝐴𝑧(𝑣 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∧ 𝜑) ↔ ∃𝑧𝑤𝐴 (𝑣 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∧ 𝜑))
5 r19.42v 2484 . . . . . . . . . 10 (∃𝑤𝐴 (𝑣 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∧ 𝜑) ↔ (𝑣 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∧ ∃𝑤𝐴 𝜑))
65exbii 1512 . . . . . . . . 9 (∃𝑧𝑤𝐴 (𝑣 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∧ 𝜑) ↔ ∃𝑧(𝑣 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∧ ∃𝑤𝐴 𝜑))
74, 6bitri 177 . . . . . . . 8 (∃𝑤𝐴𝑧(𝑣 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∧ 𝜑) ↔ ∃𝑧(𝑣 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∧ ∃𝑤𝐴 𝜑))
87exbii 1512 . . . . . . 7 (∃𝑦𝑤𝐴𝑧(𝑣 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∧ 𝜑) ↔ ∃𝑦𝑧(𝑣 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∧ ∃𝑤𝐴 𝜑))
93, 8bitri 177 . . . . . 6 (∃𝑤𝐴𝑦𝑧(𝑣 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∧ 𝜑) ↔ ∃𝑦𝑧(𝑣 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∧ ∃𝑤𝐴 𝜑))
109exbii 1512 . . . . 5 (∃𝑥𝑤𝐴𝑦𝑧(𝑣 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∧ 𝜑) ↔ ∃𝑥𝑦𝑧(𝑣 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∧ ∃𝑤𝐴 𝜑))
112, 10bitr2i 178 . . . 4 (∃𝑥𝑦𝑧(𝑣 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∧ ∃𝑤𝐴 𝜑) ↔ ∃𝑤𝐴𝑥𝑦𝑧(𝑣 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∧ 𝜑))
1211abbii 2169 . . 3 {𝑣 ∣ ∃𝑥𝑦𝑧(𝑣 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∧ ∃𝑤𝐴 𝜑)} = {𝑣 ∣ ∃𝑤𝐴𝑥𝑦𝑧(𝑣 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∧ 𝜑)}
131, 12eqtri 2076 . 2 {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ∃𝑤𝐴 𝜑} = {𝑣 ∣ ∃𝑤𝐴𝑥𝑦𝑧(𝑣 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∧ 𝜑)}
14 oprabrexex2.1 . . 3 𝐴 ∈ V
15 df-oprab 5543 . . . 4 {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ 𝜑} = {𝑣 ∣ ∃𝑥𝑦𝑧(𝑣 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∧ 𝜑)}
16 oprabrexex2.2 . . . 4 {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ 𝜑} ∈ V
1715, 16eqeltrri 2127 . . 3 {𝑣 ∣ ∃𝑥𝑦𝑧(𝑣 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∧ 𝜑)} ∈ V
1814, 17abrexex2 5778 . 2 {𝑣 ∣ ∃𝑤𝐴𝑥𝑦𝑧(𝑣 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∧ 𝜑)} ∈ V
1913, 18eqeltri 2126 1 {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ∃𝑤𝐴 𝜑} ∈ V
 Colors of variables: wff set class Syntax hints:   ∧ wa 101   = wceq 1259  ∃wex 1397   ∈ wcel 1409  {cab 2042  ∃wrex 2324  Vcvv 2574  ⟨cop 3405  {coprab 5540 This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 103  ax-ia2 104  ax-ia3 105  ax-io 640  ax-5 1352  ax-7 1353  ax-gen 1354  ax-ie1 1398  ax-ie2 1399  ax-8 1411  ax-10 1412  ax-11 1413  ax-i12 1414  ax-bndl 1415  ax-4 1416  ax-13 1420  ax-14 1421  ax-17 1435  ax-i9 1439  ax-ial 1443  ax-i5r 1444  ax-ext 2038  ax-coll 3899  ax-sep 3902  ax-pow 3954  ax-pr 3971  ax-un 4197 This theorem depends on definitions:  df-bi 114  df-3an 898  df-tru 1262  df-nf 1366  df-sb 1662  df-eu 1919  df-mo 1920  df-clab 2043  df-cleq 2049  df-clel 2052  df-nfc 2183  df-ral 2328  df-rex 2329  df-reu 2330  df-rab 2332  df-v 2576  df-sbc 2787  df-csb 2880  df-un 2949  df-in 2951  df-ss 2958  df-pw 3388  df-sn 3408  df-pr 3409  df-op 3411  df-uni 3608  df-iun 3686  df-br 3792  df-opab 3846  df-mpt 3847  df-id 4057  df-xp 4378  df-rel 4379  df-cnv 4380  df-co 4381  df-dm 4382  df-rn 4383  df-res 4384  df-ima 4385  df-iota 4894  df-fun 4931  df-fn 4932  df-f 4933  df-f1 4934  df-fo 4935  df-f1o 4936  df-fv 4937  df-oprab 5543 This theorem is referenced by: (None)
 Copyright terms: Public domain W3C validator