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

Theorem oprabrexex2 6182
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 5922 . . 3 {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ∃𝑤𝐴 𝜑} = {𝑣 ∣ ∃𝑥𝑦𝑧(𝑣 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∧ ∃𝑤𝐴 𝜑)}
2 rexcom4 2783 . . . . 5 (∃𝑤𝐴𝑥𝑦𝑧(𝑣 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∧ 𝜑) ↔ ∃𝑥𝑤𝐴𝑦𝑧(𝑣 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∧ 𝜑))
3 rexcom4 2783 . . . . . . 7 (∃𝑤𝐴𝑦𝑧(𝑣 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∧ 𝜑) ↔ ∃𝑦𝑤𝐴𝑧(𝑣 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∧ 𝜑))
4 rexcom4 2783 . . . . . . . . 9 (∃𝑤𝐴𝑧(𝑣 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∧ 𝜑) ↔ ∃𝑧𝑤𝐴 (𝑣 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∧ 𝜑))
5 r19.42v 2651 . . . . . . . . . 10 (∃𝑤𝐴 (𝑣 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∧ 𝜑) ↔ (𝑣 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∧ ∃𝑤𝐴 𝜑))
65exbii 1616 . . . . . . . . 9 (∃𝑧𝑤𝐴 (𝑣 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∧ 𝜑) ↔ ∃𝑧(𝑣 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∧ ∃𝑤𝐴 𝜑))
74, 6bitri 184 . . . . . . . 8 (∃𝑤𝐴𝑧(𝑣 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∧ 𝜑) ↔ ∃𝑧(𝑣 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∧ ∃𝑤𝐴 𝜑))
87exbii 1616 . . . . . . 7 (∃𝑦𝑤𝐴𝑧(𝑣 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∧ 𝜑) ↔ ∃𝑦𝑧(𝑣 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∧ ∃𝑤𝐴 𝜑))
93, 8bitri 184 . . . . . 6 (∃𝑤𝐴𝑦𝑧(𝑣 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∧ 𝜑) ↔ ∃𝑦𝑧(𝑣 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∧ ∃𝑤𝐴 𝜑))
109exbii 1616 . . . . 5 (∃𝑥𝑤𝐴𝑦𝑧(𝑣 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∧ 𝜑) ↔ ∃𝑥𝑦𝑧(𝑣 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∧ ∃𝑤𝐴 𝜑))
112, 10bitr2i 185 . . . 4 (∃𝑥𝑦𝑧(𝑣 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∧ ∃𝑤𝐴 𝜑) ↔ ∃𝑤𝐴𝑥𝑦𝑧(𝑣 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∧ 𝜑))
1211abbii 2309 . . 3 {𝑣 ∣ ∃𝑥𝑦𝑧(𝑣 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∧ ∃𝑤𝐴 𝜑)} = {𝑣 ∣ ∃𝑤𝐴𝑥𝑦𝑧(𝑣 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∧ 𝜑)}
131, 12eqtri 2214 . 2 {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ∃𝑤𝐴 𝜑} = {𝑣 ∣ ∃𝑤𝐴𝑥𝑦𝑧(𝑣 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∧ 𝜑)}
14 oprabrexex2.1 . . 3 𝐴 ∈ V
15 df-oprab 5922 . . . 4 {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ 𝜑} = {𝑣 ∣ ∃𝑥𝑦𝑧(𝑣 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∧ 𝜑)}
16 oprabrexex2.2 . . . 4 {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ 𝜑} ∈ V
1715, 16eqeltrri 2267 . . 3 {𝑣 ∣ ∃𝑥𝑦𝑧(𝑣 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∧ 𝜑)} ∈ V
1814, 17abrexex2 6176 . 2 {𝑣 ∣ ∃𝑤𝐴𝑥𝑦𝑧(𝑣 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∧ 𝜑)} ∈ V
1913, 18eqeltri 2266 1 {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ∃𝑤𝐴 𝜑} ∈ V
Colors of variables: wff set class
Syntax hints:  wa 104   = wceq 1364  wex 1503  wcel 2164  {cab 2179  wrex 2473  Vcvv 2760  cop 3621  {coprab 5919
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 710  ax-5 1458  ax-7 1459  ax-gen 1460  ax-ie1 1504  ax-ie2 1505  ax-8 1515  ax-10 1516  ax-11 1517  ax-i12 1518  ax-bndl 1520  ax-4 1521  ax-17 1537  ax-i9 1541  ax-ial 1545  ax-i5r 1546  ax-13 2166  ax-14 2167  ax-ext 2175  ax-coll 4144  ax-sep 4147  ax-pow 4203  ax-pr 4238  ax-un 4464
This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1367  df-nf 1472  df-sb 1774  df-eu 2045  df-mo 2046  df-clab 2180  df-cleq 2186  df-clel 2189  df-nfc 2325  df-ral 2477  df-rex 2478  df-reu 2479  df-rab 2481  df-v 2762  df-sbc 2986  df-csb 3081  df-un 3157  df-in 3159  df-ss 3166  df-pw 3603  df-sn 3624  df-pr 3625  df-op 3627  df-uni 3836  df-iun 3914  df-br 4030  df-opab 4091  df-mpt 4092  df-id 4324  df-xp 4665  df-rel 4666  df-cnv 4667  df-co 4668  df-dm 4669  df-rn 4670  df-res 4671  df-ima 4672  df-iota 5215  df-fun 5256  df-fn 5257  df-f 5258  df-f1 5259  df-fo 5260  df-f1o 5261  df-fv 5262  df-oprab 5922
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator