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

Theorem opabex3d 5827
Description: Existence of an ordered pair abstraction, deduction version. (Contributed by Alexander van der Vekens, 19-Oct-2017.)
Hypotheses
Ref Expression
opabex3d.1 (𝜑𝐴 ∈ V)
opabex3d.2 ((𝜑𝑥𝐴) → {𝑦𝜓} ∈ V)
Assertion
Ref Expression
opabex3d (𝜑 → {⟨𝑥, 𝑦⟩ ∣ (𝑥𝐴𝜓)} ∈ V)
Distinct variable groups:   𝑥,𝐴,𝑦   𝜑,𝑥
Allowed substitution hints:   𝜑(𝑦)   𝜓(𝑥,𝑦)

Proof of Theorem opabex3d
Dummy variables 𝑣 𝑤 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 19.42v 1829 . . . . . 6 (∃𝑦(𝑥𝐴 ∧ (𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜓)) ↔ (𝑥𝐴 ∧ ∃𝑦(𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜓)))
2 an12 526 . . . . . . 7 ((𝑧 = ⟨𝑥, 𝑦⟩ ∧ (𝑥𝐴𝜓)) ↔ (𝑥𝐴 ∧ (𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜓)))
32exbii 1537 . . . . . 6 (∃𝑦(𝑧 = ⟨𝑥, 𝑦⟩ ∧ (𝑥𝐴𝜓)) ↔ ∃𝑦(𝑥𝐴 ∧ (𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜓)))
4 elxp 4418 . . . . . . . 8 (𝑧 ∈ ({𝑥} × {𝑦𝜓}) ↔ ∃𝑣𝑤(𝑧 = ⟨𝑣, 𝑤⟩ ∧ (𝑣 ∈ {𝑥} ∧ 𝑤 ∈ {𝑦𝜓})))
5 excom 1595 . . . . . . . . 9 (∃𝑣𝑤(𝑧 = ⟨𝑣, 𝑤⟩ ∧ (𝑣 ∈ {𝑥} ∧ 𝑤 ∈ {𝑦𝜓})) ↔ ∃𝑤𝑣(𝑧 = ⟨𝑣, 𝑤⟩ ∧ (𝑣 ∈ {𝑥} ∧ 𝑤 ∈ {𝑦𝜓})))
6 an12 526 . . . . . . . . . . . . 13 ((𝑧 = ⟨𝑣, 𝑤⟩ ∧ (𝑣 ∈ {𝑥} ∧ 𝑤 ∈ {𝑦𝜓})) ↔ (𝑣 ∈ {𝑥} ∧ (𝑧 = ⟨𝑣, 𝑤⟩ ∧ 𝑤 ∈ {𝑦𝜓})))
7 velsn 3439 . . . . . . . . . . . . . 14 (𝑣 ∈ {𝑥} ↔ 𝑣 = 𝑥)
87anbi1i 446 . . . . . . . . . . . . 13 ((𝑣 ∈ {𝑥} ∧ (𝑧 = ⟨𝑣, 𝑤⟩ ∧ 𝑤 ∈ {𝑦𝜓})) ↔ (𝑣 = 𝑥 ∧ (𝑧 = ⟨𝑣, 𝑤⟩ ∧ 𝑤 ∈ {𝑦𝜓})))
96, 8bitri 182 . . . . . . . . . . . 12 ((𝑧 = ⟨𝑣, 𝑤⟩ ∧ (𝑣 ∈ {𝑥} ∧ 𝑤 ∈ {𝑦𝜓})) ↔ (𝑣 = 𝑥 ∧ (𝑧 = ⟨𝑣, 𝑤⟩ ∧ 𝑤 ∈ {𝑦𝜓})))
109exbii 1537 . . . . . . . . . . 11 (∃𝑣(𝑧 = ⟨𝑣, 𝑤⟩ ∧ (𝑣 ∈ {𝑥} ∧ 𝑤 ∈ {𝑦𝜓})) ↔ ∃𝑣(𝑣 = 𝑥 ∧ (𝑧 = ⟨𝑣, 𝑤⟩ ∧ 𝑤 ∈ {𝑦𝜓})))
11 vex 2615 . . . . . . . . . . . 12 𝑥 ∈ V
12 opeq1 3596 . . . . . . . . . . . . . 14 (𝑣 = 𝑥 → ⟨𝑣, 𝑤⟩ = ⟨𝑥, 𝑤⟩)
1312eqeq2d 2094 . . . . . . . . . . . . 13 (𝑣 = 𝑥 → (𝑧 = ⟨𝑣, 𝑤⟩ ↔ 𝑧 = ⟨𝑥, 𝑤⟩))
1413anbi1d 453 . . . . . . . . . . . 12 (𝑣 = 𝑥 → ((𝑧 = ⟨𝑣, 𝑤⟩ ∧ 𝑤 ∈ {𝑦𝜓}) ↔ (𝑧 = ⟨𝑥, 𝑤⟩ ∧ 𝑤 ∈ {𝑦𝜓})))
1511, 14ceqsexv 2649 . . . . . . . . . . 11 (∃𝑣(𝑣 = 𝑥 ∧ (𝑧 = ⟨𝑣, 𝑤⟩ ∧ 𝑤 ∈ {𝑦𝜓})) ↔ (𝑧 = ⟨𝑥, 𝑤⟩ ∧ 𝑤 ∈ {𝑦𝜓}))
1610, 15bitri 182 . . . . . . . . . 10 (∃𝑣(𝑧 = ⟨𝑣, 𝑤⟩ ∧ (𝑣 ∈ {𝑥} ∧ 𝑤 ∈ {𝑦𝜓})) ↔ (𝑧 = ⟨𝑥, 𝑤⟩ ∧ 𝑤 ∈ {𝑦𝜓}))
1716exbii 1537 . . . . . . . . 9 (∃𝑤𝑣(𝑧 = ⟨𝑣, 𝑤⟩ ∧ (𝑣 ∈ {𝑥} ∧ 𝑤 ∈ {𝑦𝜓})) ↔ ∃𝑤(𝑧 = ⟨𝑥, 𝑤⟩ ∧ 𝑤 ∈ {𝑦𝜓}))
185, 17bitri 182 . . . . . . . 8 (∃𝑣𝑤(𝑧 = ⟨𝑣, 𝑤⟩ ∧ (𝑣 ∈ {𝑥} ∧ 𝑤 ∈ {𝑦𝜓})) ↔ ∃𝑤(𝑧 = ⟨𝑥, 𝑤⟩ ∧ 𝑤 ∈ {𝑦𝜓}))
19 nfv 1462 . . . . . . . . . 10 𝑦 𝑧 = ⟨𝑥, 𝑤
20 nfsab1 2073 . . . . . . . . . 10 𝑦 𝑤 ∈ {𝑦𝜓}
2119, 20nfan 1498 . . . . . . . . 9 𝑦(𝑧 = ⟨𝑥, 𝑤⟩ ∧ 𝑤 ∈ {𝑦𝜓})
22 nfv 1462 . . . . . . . . 9 𝑤(𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜓)
23 opeq2 3597 . . . . . . . . . . 11 (𝑤 = 𝑦 → ⟨𝑥, 𝑤⟩ = ⟨𝑥, 𝑦⟩)
2423eqeq2d 2094 . . . . . . . . . 10 (𝑤 = 𝑦 → (𝑧 = ⟨𝑥, 𝑤⟩ ↔ 𝑧 = ⟨𝑥, 𝑦⟩))
25 sbequ12 1696 . . . . . . . . . . . 12 (𝑦 = 𝑤 → (𝜓 ↔ [𝑤 / 𝑦]𝜓))
2625equcoms 1636 . . . . . . . . . . 11 (𝑤 = 𝑦 → (𝜓 ↔ [𝑤 / 𝑦]𝜓))
27 df-clab 2070 . . . . . . . . . . 11 (𝑤 ∈ {𝑦𝜓} ↔ [𝑤 / 𝑦]𝜓)
2826, 27syl6rbbr 197 . . . . . . . . . 10 (𝑤 = 𝑦 → (𝑤 ∈ {𝑦𝜓} ↔ 𝜓))
2924, 28anbi12d 457 . . . . . . . . 9 (𝑤 = 𝑦 → ((𝑧 = ⟨𝑥, 𝑤⟩ ∧ 𝑤 ∈ {𝑦𝜓}) ↔ (𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜓)))
3021, 22, 29cbvex 1681 . . . . . . . 8 (∃𝑤(𝑧 = ⟨𝑥, 𝑤⟩ ∧ 𝑤 ∈ {𝑦𝜓}) ↔ ∃𝑦(𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜓))
314, 18, 303bitri 204 . . . . . . 7 (𝑧 ∈ ({𝑥} × {𝑦𝜓}) ↔ ∃𝑦(𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜓))
3231anbi2i 445 . . . . . 6 ((𝑥𝐴𝑧 ∈ ({𝑥} × {𝑦𝜓})) ↔ (𝑥𝐴 ∧ ∃𝑦(𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜓)))
331, 3, 323bitr4ri 211 . . . . 5 ((𝑥𝐴𝑧 ∈ ({𝑥} × {𝑦𝜓})) ↔ ∃𝑦(𝑧 = ⟨𝑥, 𝑦⟩ ∧ (𝑥𝐴𝜓)))
3433exbii 1537 . . . 4 (∃𝑥(𝑥𝐴𝑧 ∈ ({𝑥} × {𝑦𝜓})) ↔ ∃𝑥𝑦(𝑧 = ⟨𝑥, 𝑦⟩ ∧ (𝑥𝐴𝜓)))
35 eliun 3708 . . . . 5 (𝑧 𝑥𝐴 ({𝑥} × {𝑦𝜓}) ↔ ∃𝑥𝐴 𝑧 ∈ ({𝑥} × {𝑦𝜓}))
36 df-rex 2359 . . . . 5 (∃𝑥𝐴 𝑧 ∈ ({𝑥} × {𝑦𝜓}) ↔ ∃𝑥(𝑥𝐴𝑧 ∈ ({𝑥} × {𝑦𝜓})))
3735, 36bitri 182 . . . 4 (𝑧 𝑥𝐴 ({𝑥} × {𝑦𝜓}) ↔ ∃𝑥(𝑥𝐴𝑧 ∈ ({𝑥} × {𝑦𝜓})))
38 elopab 4049 . . . 4 (𝑧 ∈ {⟨𝑥, 𝑦⟩ ∣ (𝑥𝐴𝜓)} ↔ ∃𝑥𝑦(𝑧 = ⟨𝑥, 𝑦⟩ ∧ (𝑥𝐴𝜓)))
3934, 37, 383bitr4i 210 . . 3 (𝑧 𝑥𝐴 ({𝑥} × {𝑦𝜓}) ↔ 𝑧 ∈ {⟨𝑥, 𝑦⟩ ∣ (𝑥𝐴𝜓)})
4039eqriv 2080 . 2 𝑥𝐴 ({𝑥} × {𝑦𝜓}) = {⟨𝑥, 𝑦⟩ ∣ (𝑥𝐴𝜓)}
41 opabex3d.1 . . 3 (𝜑𝐴 ∈ V)
42 snexg 3983 . . . . . 6 (𝑥 ∈ V → {𝑥} ∈ V)
4311, 42ax-mp 7 . . . . 5 {𝑥} ∈ V
44 opabex3d.2 . . . . 5 ((𝜑𝑥𝐴) → {𝑦𝜓} ∈ V)
45 xpexg 4510 . . . . 5 (({𝑥} ∈ V ∧ {𝑦𝜓} ∈ V) → ({𝑥} × {𝑦𝜓}) ∈ V)
4643, 44, 45sylancr 405 . . . 4 ((𝜑𝑥𝐴) → ({𝑥} × {𝑦𝜓}) ∈ V)
4746ralrimiva 2440 . . 3 (𝜑 → ∀𝑥𝐴 ({𝑥} × {𝑦𝜓}) ∈ V)
48 iunexg 5825 . . 3 ((𝐴 ∈ V ∧ ∀𝑥𝐴 ({𝑥} × {𝑦𝜓}) ∈ V) → 𝑥𝐴 ({𝑥} × {𝑦𝜓}) ∈ V)
4941, 47, 48syl2anc 403 . 2 (𝜑 𝑥𝐴 ({𝑥} × {𝑦𝜓}) ∈ V)
5040, 49syl5eqelr 2170 1 (𝜑 → {⟨𝑥, 𝑦⟩ ∣ (𝑥𝐴𝜓)} ∈ V)
Colors of variables: wff set class
Syntax hints:  wi 4  wa 102  wb 103   = wceq 1285  wex 1422  wcel 1434  [wsb 1687  {cab 2069  wral 2353  wrex 2354  Vcvv 2612  {csn 3422  cop 3425   ciun 3704  {copab 3864   × cxp 4399
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 104  ax-ia2 105  ax-ia3 106  ax-io 663  ax-5 1377  ax-7 1378  ax-gen 1379  ax-ie1 1423  ax-ie2 1424  ax-8 1436  ax-10 1437  ax-11 1438  ax-i12 1439  ax-bndl 1440  ax-4 1441  ax-13 1445  ax-14 1446  ax-17 1460  ax-i9 1464  ax-ial 1468  ax-i5r 1469  ax-ext 2065  ax-coll 3919  ax-sep 3922  ax-pow 3974  ax-pr 4000  ax-un 4224
This theorem depends on definitions:  df-bi 115  df-3an 922  df-tru 1288  df-nf 1391  df-sb 1688  df-eu 1946  df-mo 1947  df-clab 2070  df-cleq 2076  df-clel 2079  df-nfc 2212  df-ral 2358  df-rex 2359  df-reu 2360  df-rab 2362  df-v 2614  df-sbc 2827  df-csb 2920  df-un 2988  df-in 2990  df-ss 2997  df-pw 3408  df-sn 3428  df-pr 3429  df-op 3431  df-uni 3628  df-iun 3706  df-br 3812  df-opab 3866  df-mpt 3867  df-id 4084  df-xp 4407  df-rel 4408  df-cnv 4409  df-co 4410  df-dm 4411  df-rn 4412  df-res 4413  df-ima 4414  df-iota 4934  df-fun 4971  df-fn 4972  df-f 4973  df-f1 4974  df-fo 4975  df-f1o 4976  df-fv 4977
This theorem is referenced by:  ovshftex  10081
  Copyright terms: Public domain W3C validator