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

Theorem oprabrexex2 5757
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 5516 . . 3 {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ∃𝑤𝐴 𝜑} = {𝑣 ∣ ∃𝑥𝑦𝑧(𝑣 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∧ ∃𝑤𝐴 𝜑)}
2 rexcom4 2577 . . . . 5 (∃𝑤𝐴𝑥𝑦𝑧(𝑣 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∧ 𝜑) ↔ ∃𝑥𝑤𝐴𝑦𝑧(𝑣 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∧ 𝜑))
3 rexcom4 2577 . . . . . . 7 (∃𝑤𝐴𝑦𝑧(𝑣 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∧ 𝜑) ↔ ∃𝑦𝑤𝐴𝑧(𝑣 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∧ 𝜑))
4 rexcom4 2577 . . . . . . . . 9 (∃𝑤𝐴𝑧(𝑣 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∧ 𝜑) ↔ ∃𝑧𝑤𝐴 (𝑣 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∧ 𝜑))
5 r19.42v 2467 . . . . . . . . . 10 (∃𝑤𝐴 (𝑣 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∧ 𝜑) ↔ (𝑣 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∧ ∃𝑤𝐴 𝜑))
65exbii 1496 . . . . . . . . 9 (∃𝑧𝑤𝐴 (𝑣 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∧ 𝜑) ↔ ∃𝑧(𝑣 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∧ ∃𝑤𝐴 𝜑))
74, 6bitri 173 . . . . . . . 8 (∃𝑤𝐴𝑧(𝑣 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∧ 𝜑) ↔ ∃𝑧(𝑣 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∧ ∃𝑤𝐴 𝜑))
87exbii 1496 . . . . . . 7 (∃𝑦𝑤𝐴𝑧(𝑣 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∧ 𝜑) ↔ ∃𝑦𝑧(𝑣 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∧ ∃𝑤𝐴 𝜑))
93, 8bitri 173 . . . . . 6 (∃𝑤𝐴𝑦𝑧(𝑣 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∧ 𝜑) ↔ ∃𝑦𝑧(𝑣 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∧ ∃𝑤𝐴 𝜑))
109exbii 1496 . . . . 5 (∃𝑥𝑤𝐴𝑦𝑧(𝑣 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∧ 𝜑) ↔ ∃𝑥𝑦𝑧(𝑣 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∧ ∃𝑤𝐴 𝜑))
112, 10bitr2i 174 . . . 4 (∃𝑥𝑦𝑧(𝑣 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∧ ∃𝑤𝐴 𝜑) ↔ ∃𝑤𝐴𝑥𝑦𝑧(𝑣 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∧ 𝜑))
1211abbii 2153 . . 3 {𝑣 ∣ ∃𝑥𝑦𝑧(𝑣 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∧ ∃𝑤𝐴 𝜑)} = {𝑣 ∣ ∃𝑤𝐴𝑥𝑦𝑧(𝑣 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∧ 𝜑)}
131, 12eqtri 2060 . 2 {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ∃𝑤𝐴 𝜑} = {𝑣 ∣ ∃𝑤𝐴𝑥𝑦𝑧(𝑣 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∧ 𝜑)}
14 oprabrexex2.1 . . 3 𝐴 ∈ V
15 df-oprab 5516 . . . 4 {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ 𝜑} = {𝑣 ∣ ∃𝑥𝑦𝑧(𝑣 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∧ 𝜑)}
16 oprabrexex2.2 . . . 4 {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ 𝜑} ∈ V
1715, 16eqeltrri 2111 . . 3 {𝑣 ∣ ∃𝑥𝑦𝑧(𝑣 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∧ 𝜑)} ∈ V
1814, 17abrexex2 5751 . 2 {𝑣 ∣ ∃𝑤𝐴𝑥𝑦𝑧(𝑣 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∧ 𝜑)} ∈ V
1913, 18eqeltri 2110 1 {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ∃𝑤𝐴 𝜑} ∈ V
Colors of variables: wff set class
Syntax hints:  wa 97   = wceq 1243  wex 1381  wcel 1393  {cab 2026  wrex 2307  Vcvv 2557  cop 3378  {coprab 5513
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 99  ax-ia2 100  ax-ia3 101  ax-io 630  ax-5 1336  ax-7 1337  ax-gen 1338  ax-ie1 1382  ax-ie2 1383  ax-8 1395  ax-10 1396  ax-11 1397  ax-i12 1398  ax-bndl 1399  ax-4 1400  ax-13 1404  ax-14 1405  ax-17 1419  ax-i9 1423  ax-ial 1427  ax-i5r 1428  ax-ext 2022  ax-coll 3872  ax-sep 3875  ax-pow 3927  ax-pr 3944  ax-un 4170
This theorem depends on definitions:  df-bi 110  df-3an 887  df-tru 1246  df-nf 1350  df-sb 1646  df-eu 1903  df-mo 1904  df-clab 2027  df-cleq 2033  df-clel 2036  df-nfc 2167  df-ral 2311  df-rex 2312  df-reu 2313  df-rab 2315  df-v 2559  df-sbc 2765  df-csb 2853  df-un 2922  df-in 2924  df-ss 2931  df-pw 3361  df-sn 3381  df-pr 3382  df-op 3384  df-uni 3581  df-iun 3659  df-br 3765  df-opab 3819  df-mpt 3820  df-id 4030  df-xp 4351  df-rel 4352  df-cnv 4353  df-co 4354  df-dm 4355  df-rn 4356  df-res 4357  df-ima 4358  df-iota 4867  df-fun 4904  df-fn 4905  df-f 4906  df-f1 4907  df-fo 4908  df-f1o 4909  df-fv 4910  df-oprab 5516
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator