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

Theorem opabex3d 7098
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 1915 . . . . . 6 (∃𝑦(𝑥𝐴 ∧ (𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜓)) ↔ (𝑥𝐴 ∧ ∃𝑦(𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜓)))
2 an12 837 . . . . . . 7 ((𝑧 = ⟨𝑥, 𝑦⟩ ∧ (𝑥𝐴𝜓)) ↔ (𝑥𝐴 ∧ (𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜓)))
32exbii 1771 . . . . . 6 (∃𝑦(𝑧 = ⟨𝑥, 𝑦⟩ ∧ (𝑥𝐴𝜓)) ↔ ∃𝑦(𝑥𝐴 ∧ (𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜓)))
4 elxp 5096 . . . . . . . 8 (𝑧 ∈ ({𝑥} × {𝑦𝜓}) ↔ ∃𝑣𝑤(𝑧 = ⟨𝑣, 𝑤⟩ ∧ (𝑣 ∈ {𝑥} ∧ 𝑤 ∈ {𝑦𝜓})))
5 excom 2039 . . . . . . . . 9 (∃𝑣𝑤(𝑧 = ⟨𝑣, 𝑤⟩ ∧ (𝑣 ∈ {𝑥} ∧ 𝑤 ∈ {𝑦𝜓})) ↔ ∃𝑤𝑣(𝑧 = ⟨𝑣, 𝑤⟩ ∧ (𝑣 ∈ {𝑥} ∧ 𝑤 ∈ {𝑦𝜓})))
6 an12 837 . . . . . . . . . . . . 13 ((𝑧 = ⟨𝑣, 𝑤⟩ ∧ (𝑣 ∈ {𝑥} ∧ 𝑤 ∈ {𝑦𝜓})) ↔ (𝑣 ∈ {𝑥} ∧ (𝑧 = ⟨𝑣, 𝑤⟩ ∧ 𝑤 ∈ {𝑦𝜓})))
7 velsn 4169 . . . . . . . . . . . . . 14 (𝑣 ∈ {𝑥} ↔ 𝑣 = 𝑥)
87anbi1i 730 . . . . . . . . . . . . 13 ((𝑣 ∈ {𝑥} ∧ (𝑧 = ⟨𝑣, 𝑤⟩ ∧ 𝑤 ∈ {𝑦𝜓})) ↔ (𝑣 = 𝑥 ∧ (𝑧 = ⟨𝑣, 𝑤⟩ ∧ 𝑤 ∈ {𝑦𝜓})))
96, 8bitri 264 . . . . . . . . . . . 12 ((𝑧 = ⟨𝑣, 𝑤⟩ ∧ (𝑣 ∈ {𝑥} ∧ 𝑤 ∈ {𝑦𝜓})) ↔ (𝑣 = 𝑥 ∧ (𝑧 = ⟨𝑣, 𝑤⟩ ∧ 𝑤 ∈ {𝑦𝜓})))
109exbii 1771 . . . . . . . . . . 11 (∃𝑣(𝑧 = ⟨𝑣, 𝑤⟩ ∧ (𝑣 ∈ {𝑥} ∧ 𝑤 ∈ {𝑦𝜓})) ↔ ∃𝑣(𝑣 = 𝑥 ∧ (𝑧 = ⟨𝑣, 𝑤⟩ ∧ 𝑤 ∈ {𝑦𝜓})))
11 vex 3192 . . . . . . . . . . . 12 𝑥 ∈ V
12 opeq1 4375 . . . . . . . . . . . . . 14 (𝑣 = 𝑥 → ⟨𝑣, 𝑤⟩ = ⟨𝑥, 𝑤⟩)
1312eqeq2d 2631 . . . . . . . . . . . . 13 (𝑣 = 𝑥 → (𝑧 = ⟨𝑣, 𝑤⟩ ↔ 𝑧 = ⟨𝑥, 𝑤⟩))
1413anbi1d 740 . . . . . . . . . . . 12 (𝑣 = 𝑥 → ((𝑧 = ⟨𝑣, 𝑤⟩ ∧ 𝑤 ∈ {𝑦𝜓}) ↔ (𝑧 = ⟨𝑥, 𝑤⟩ ∧ 𝑤 ∈ {𝑦𝜓})))
1511, 14ceqsexv 3231 . . . . . . . . . . 11 (∃𝑣(𝑣 = 𝑥 ∧ (𝑧 = ⟨𝑣, 𝑤⟩ ∧ 𝑤 ∈ {𝑦𝜓})) ↔ (𝑧 = ⟨𝑥, 𝑤⟩ ∧ 𝑤 ∈ {𝑦𝜓}))
1610, 15bitri 264 . . . . . . . . . 10 (∃𝑣(𝑧 = ⟨𝑣, 𝑤⟩ ∧ (𝑣 ∈ {𝑥} ∧ 𝑤 ∈ {𝑦𝜓})) ↔ (𝑧 = ⟨𝑥, 𝑤⟩ ∧ 𝑤 ∈ {𝑦𝜓}))
1716exbii 1771 . . . . . . . . 9 (∃𝑤𝑣(𝑧 = ⟨𝑣, 𝑤⟩ ∧ (𝑣 ∈ {𝑥} ∧ 𝑤 ∈ {𝑦𝜓})) ↔ ∃𝑤(𝑧 = ⟨𝑥, 𝑤⟩ ∧ 𝑤 ∈ {𝑦𝜓}))
185, 17bitri 264 . . . . . . . 8 (∃𝑣𝑤(𝑧 = ⟨𝑣, 𝑤⟩ ∧ (𝑣 ∈ {𝑥} ∧ 𝑤 ∈ {𝑦𝜓})) ↔ ∃𝑤(𝑧 = ⟨𝑥, 𝑤⟩ ∧ 𝑤 ∈ {𝑦𝜓}))
19 nfv 1840 . . . . . . . . . 10 𝑦 𝑧 = ⟨𝑥, 𝑤
20 nfsab1 2611 . . . . . . . . . 10 𝑦 𝑤 ∈ {𝑦𝜓}
2119, 20nfan 1825 . . . . . . . . 9 𝑦(𝑧 = ⟨𝑥, 𝑤⟩ ∧ 𝑤 ∈ {𝑦𝜓})
22 nfv 1840 . . . . . . . . 9 𝑤(𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜓)
23 opeq2 4376 . . . . . . . . . . 11 (𝑤 = 𝑦 → ⟨𝑥, 𝑤⟩ = ⟨𝑥, 𝑦⟩)
2423eqeq2d 2631 . . . . . . . . . 10 (𝑤 = 𝑦 → (𝑧 = ⟨𝑥, 𝑤⟩ ↔ 𝑧 = ⟨𝑥, 𝑦⟩))
25 sbequ12 2108 . . . . . . . . . . . 12 (𝑦 = 𝑤 → (𝜓 ↔ [𝑤 / 𝑦]𝜓))
2625equcoms 1944 . . . . . . . . . . 11 (𝑤 = 𝑦 → (𝜓 ↔ [𝑤 / 𝑦]𝜓))
27 df-clab 2608 . . . . . . . . . . 11 (𝑤 ∈ {𝑦𝜓} ↔ [𝑤 / 𝑦]𝜓)
2826, 27syl6rbbr 279 . . . . . . . . . 10 (𝑤 = 𝑦 → (𝑤 ∈ {𝑦𝜓} ↔ 𝜓))
2924, 28anbi12d 746 . . . . . . . . 9 (𝑤 = 𝑦 → ((𝑧 = ⟨𝑥, 𝑤⟩ ∧ 𝑤 ∈ {𝑦𝜓}) ↔ (𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜓)))
3021, 22, 29cbvex 2271 . . . . . . . 8 (∃𝑤(𝑧 = ⟨𝑥, 𝑤⟩ ∧ 𝑤 ∈ {𝑦𝜓}) ↔ ∃𝑦(𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜓))
314, 18, 303bitri 286 . . . . . . 7 (𝑧 ∈ ({𝑥} × {𝑦𝜓}) ↔ ∃𝑦(𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜓))
3231anbi2i 729 . . . . . 6 ((𝑥𝐴𝑧 ∈ ({𝑥} × {𝑦𝜓})) ↔ (𝑥𝐴 ∧ ∃𝑦(𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜓)))
331, 3, 323bitr4ri 293 . . . . 5 ((𝑥𝐴𝑧 ∈ ({𝑥} × {𝑦𝜓})) ↔ ∃𝑦(𝑧 = ⟨𝑥, 𝑦⟩ ∧ (𝑥𝐴𝜓)))
3433exbii 1771 . . . 4 (∃𝑥(𝑥𝐴𝑧 ∈ ({𝑥} × {𝑦𝜓})) ↔ ∃𝑥𝑦(𝑧 = ⟨𝑥, 𝑦⟩ ∧ (𝑥𝐴𝜓)))
35 eliun 4495 . . . . 5 (𝑧 𝑥𝐴 ({𝑥} × {𝑦𝜓}) ↔ ∃𝑥𝐴 𝑧 ∈ ({𝑥} × {𝑦𝜓}))
36 df-rex 2913 . . . . 5 (∃𝑥𝐴 𝑧 ∈ ({𝑥} × {𝑦𝜓}) ↔ ∃𝑥(𝑥𝐴𝑧 ∈ ({𝑥} × {𝑦𝜓})))
3735, 36bitri 264 . . . 4 (𝑧 𝑥𝐴 ({𝑥} × {𝑦𝜓}) ↔ ∃𝑥(𝑥𝐴𝑧 ∈ ({𝑥} × {𝑦𝜓})))
38 elopab 4948 . . . 4 (𝑧 ∈ {⟨𝑥, 𝑦⟩ ∣ (𝑥𝐴𝜓)} ↔ ∃𝑥𝑦(𝑧 = ⟨𝑥, 𝑦⟩ ∧ (𝑥𝐴𝜓)))
3934, 37, 383bitr4i 292 . . 3 (𝑧 𝑥𝐴 ({𝑥} × {𝑦𝜓}) ↔ 𝑧 ∈ {⟨𝑥, 𝑦⟩ ∣ (𝑥𝐴𝜓)})
4039eqriv 2618 . 2 𝑥𝐴 ({𝑥} × {𝑦𝜓}) = {⟨𝑥, 𝑦⟩ ∣ (𝑥𝐴𝜓)}
41 opabex3d.1 . . 3 (𝜑𝐴 ∈ V)
42 snex 4874 . . . . 5 {𝑥} ∈ V
43 opabex3d.2 . . . . 5 ((𝜑𝑥𝐴) → {𝑦𝜓} ∈ V)
44 xpexg 6920 . . . . 5 (({𝑥} ∈ V ∧ {𝑦𝜓} ∈ V) → ({𝑥} × {𝑦𝜓}) ∈ V)
4542, 43, 44sylancr 694 . . . 4 ((𝜑𝑥𝐴) → ({𝑥} × {𝑦𝜓}) ∈ V)
4645ralrimiva 2961 . . 3 (𝜑 → ∀𝑥𝐴 ({𝑥} × {𝑦𝜓}) ∈ V)
47 iunexg 7096 . . 3 ((𝐴 ∈ V ∧ ∀𝑥𝐴 ({𝑥} × {𝑦𝜓}) ∈ V) → 𝑥𝐴 ({𝑥} × {𝑦𝜓}) ∈ V)
4841, 46, 47syl2anc 692 . 2 (𝜑 𝑥𝐴 ({𝑥} × {𝑦𝜓}) ∈ V)
4940, 48syl5eqelr 2703 1 (𝜑 → {⟨𝑥, 𝑦⟩ ∣ (𝑥𝐴𝜓)} ∈ V)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 196  wa 384   = wceq 1480  wex 1701  [wsb 1877  wcel 1987  {cab 2607  wral 2907  wrex 2908  Vcvv 3189  {csn 4153  cop 4159   ciun 4490  {copab 4677   × cxp 5077
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1719  ax-4 1734  ax-5 1836  ax-6 1885  ax-7 1932  ax-8 1989  ax-9 1996  ax-10 2016  ax-11 2031  ax-12 2044  ax-13 2245  ax-ext 2601  ax-rep 4736  ax-sep 4746  ax-nul 4754  ax-pow 4808  ax-pr 4872  ax-un 6909
This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3an 1038  df-tru 1483  df-ex 1702  df-nf 1707  df-sb 1878  df-eu 2473  df-mo 2474  df-clab 2608  df-cleq 2614  df-clel 2617  df-nfc 2750  df-ne 2791  df-ral 2912  df-rex 2913  df-reu 2914  df-rab 2916  df-v 3191  df-sbc 3422  df-csb 3519  df-dif 3562  df-un 3564  df-in 3566  df-ss 3573  df-nul 3897  df-if 4064  df-pw 4137  df-sn 4154  df-pr 4156  df-op 4160  df-uni 4408  df-iun 4492  df-br 4619  df-opab 4679  df-mpt 4680  df-id 4994  df-xp 5085  df-rel 5086  df-cnv 5087  df-co 5088  df-dm 5089  df-rn 5090  df-res 5091  df-ima 5092  df-iota 5815  df-fun 5854  df-fn 5855  df-f 5856  df-f1 5857  df-fo 5858  df-f1o 5859  df-fv 5860
This theorem is referenced by:  wksfval  26388  fpwrelmap  29369  opabresex0d  40622  upwlksfval  41025
  Copyright terms: Public domain W3C validator