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

Theorem opabex3d 7145
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 1918 . . . . . 6 (∃𝑦(𝑥𝐴 ∧ (𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜓)) ↔ (𝑥𝐴 ∧ ∃𝑦(𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜓)))
2 an12 838 . . . . . . 7 ((𝑧 = ⟨𝑥, 𝑦⟩ ∧ (𝑥𝐴𝜓)) ↔ (𝑥𝐴 ∧ (𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜓)))
32exbii 1774 . . . . . 6 (∃𝑦(𝑧 = ⟨𝑥, 𝑦⟩ ∧ (𝑥𝐴𝜓)) ↔ ∃𝑦(𝑥𝐴 ∧ (𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜓)))
4 elxp 5131 . . . . . . . 8 (𝑧 ∈ ({𝑥} × {𝑦𝜓}) ↔ ∃𝑣𝑤(𝑧 = ⟨𝑣, 𝑤⟩ ∧ (𝑣 ∈ {𝑥} ∧ 𝑤 ∈ {𝑦𝜓})))
5 excom 2042 . . . . . . . . 9 (∃𝑣𝑤(𝑧 = ⟨𝑣, 𝑤⟩ ∧ (𝑣 ∈ {𝑥} ∧ 𝑤 ∈ {𝑦𝜓})) ↔ ∃𝑤𝑣(𝑧 = ⟨𝑣, 𝑤⟩ ∧ (𝑣 ∈ {𝑥} ∧ 𝑤 ∈ {𝑦𝜓})))
6 an12 838 . . . . . . . . . . . . 13 ((𝑧 = ⟨𝑣, 𝑤⟩ ∧ (𝑣 ∈ {𝑥} ∧ 𝑤 ∈ {𝑦𝜓})) ↔ (𝑣 ∈ {𝑥} ∧ (𝑧 = ⟨𝑣, 𝑤⟩ ∧ 𝑤 ∈ {𝑦𝜓})))
7 velsn 4193 . . . . . . . . . . . . . 14 (𝑣 ∈ {𝑥} ↔ 𝑣 = 𝑥)
87anbi1i 731 . . . . . . . . . . . . 13 ((𝑣 ∈ {𝑥} ∧ (𝑧 = ⟨𝑣, 𝑤⟩ ∧ 𝑤 ∈ {𝑦𝜓})) ↔ (𝑣 = 𝑥 ∧ (𝑧 = ⟨𝑣, 𝑤⟩ ∧ 𝑤 ∈ {𝑦𝜓})))
96, 8bitri 264 . . . . . . . . . . . 12 ((𝑧 = ⟨𝑣, 𝑤⟩ ∧ (𝑣 ∈ {𝑥} ∧ 𝑤 ∈ {𝑦𝜓})) ↔ (𝑣 = 𝑥 ∧ (𝑧 = ⟨𝑣, 𝑤⟩ ∧ 𝑤 ∈ {𝑦𝜓})))
109exbii 1774 . . . . . . . . . . 11 (∃𝑣(𝑧 = ⟨𝑣, 𝑤⟩ ∧ (𝑣 ∈ {𝑥} ∧ 𝑤 ∈ {𝑦𝜓})) ↔ ∃𝑣(𝑣 = 𝑥 ∧ (𝑧 = ⟨𝑣, 𝑤⟩ ∧ 𝑤 ∈ {𝑦𝜓})))
11 vex 3203 . . . . . . . . . . . 12 𝑥 ∈ V
12 opeq1 4402 . . . . . . . . . . . . . 14 (𝑣 = 𝑥 → ⟨𝑣, 𝑤⟩ = ⟨𝑥, 𝑤⟩)
1312eqeq2d 2632 . . . . . . . . . . . . 13 (𝑣 = 𝑥 → (𝑧 = ⟨𝑣, 𝑤⟩ ↔ 𝑧 = ⟨𝑥, 𝑤⟩))
1413anbi1d 741 . . . . . . . . . . . 12 (𝑣 = 𝑥 → ((𝑧 = ⟨𝑣, 𝑤⟩ ∧ 𝑤 ∈ {𝑦𝜓}) ↔ (𝑧 = ⟨𝑥, 𝑤⟩ ∧ 𝑤 ∈ {𝑦𝜓})))
1511, 14ceqsexv 3242 . . . . . . . . . . 11 (∃𝑣(𝑣 = 𝑥 ∧ (𝑧 = ⟨𝑣, 𝑤⟩ ∧ 𝑤 ∈ {𝑦𝜓})) ↔ (𝑧 = ⟨𝑥, 𝑤⟩ ∧ 𝑤 ∈ {𝑦𝜓}))
1610, 15bitri 264 . . . . . . . . . 10 (∃𝑣(𝑧 = ⟨𝑣, 𝑤⟩ ∧ (𝑣 ∈ {𝑥} ∧ 𝑤 ∈ {𝑦𝜓})) ↔ (𝑧 = ⟨𝑥, 𝑤⟩ ∧ 𝑤 ∈ {𝑦𝜓}))
1716exbii 1774 . . . . . . . . 9 (∃𝑤𝑣(𝑧 = ⟨𝑣, 𝑤⟩ ∧ (𝑣 ∈ {𝑥} ∧ 𝑤 ∈ {𝑦𝜓})) ↔ ∃𝑤(𝑧 = ⟨𝑥, 𝑤⟩ ∧ 𝑤 ∈ {𝑦𝜓}))
185, 17bitri 264 . . . . . . . 8 (∃𝑣𝑤(𝑧 = ⟨𝑣, 𝑤⟩ ∧ (𝑣 ∈ {𝑥} ∧ 𝑤 ∈ {𝑦𝜓})) ↔ ∃𝑤(𝑧 = ⟨𝑥, 𝑤⟩ ∧ 𝑤 ∈ {𝑦𝜓}))
19 nfv 1843 . . . . . . . . . 10 𝑦 𝑧 = ⟨𝑥, 𝑤
20 nfsab1 2612 . . . . . . . . . 10 𝑦 𝑤 ∈ {𝑦𝜓}
2119, 20nfan 1828 . . . . . . . . 9 𝑦(𝑧 = ⟨𝑥, 𝑤⟩ ∧ 𝑤 ∈ {𝑦𝜓})
22 nfv 1843 . . . . . . . . 9 𝑤(𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜓)
23 opeq2 4403 . . . . . . . . . . 11 (𝑤 = 𝑦 → ⟨𝑥, 𝑤⟩ = ⟨𝑥, 𝑦⟩)
2423eqeq2d 2632 . . . . . . . . . 10 (𝑤 = 𝑦 → (𝑧 = ⟨𝑥, 𝑤⟩ ↔ 𝑧 = ⟨𝑥, 𝑦⟩))
25 sbequ12 2111 . . . . . . . . . . . 12 (𝑦 = 𝑤 → (𝜓 ↔ [𝑤 / 𝑦]𝜓))
2625equcoms 1947 . . . . . . . . . . 11 (𝑤 = 𝑦 → (𝜓 ↔ [𝑤 / 𝑦]𝜓))
27 df-clab 2609 . . . . . . . . . . 11 (𝑤 ∈ {𝑦𝜓} ↔ [𝑤 / 𝑦]𝜓)
2826, 27syl6rbbr 279 . . . . . . . . . 10 (𝑤 = 𝑦 → (𝑤 ∈ {𝑦𝜓} ↔ 𝜓))
2924, 28anbi12d 747 . . . . . . . . 9 (𝑤 = 𝑦 → ((𝑧 = ⟨𝑥, 𝑤⟩ ∧ 𝑤 ∈ {𝑦𝜓}) ↔ (𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜓)))
3021, 22, 29cbvex 2272 . . . . . . . 8 (∃𝑤(𝑧 = ⟨𝑥, 𝑤⟩ ∧ 𝑤 ∈ {𝑦𝜓}) ↔ ∃𝑦(𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜓))
314, 18, 303bitri 286 . . . . . . 7 (𝑧 ∈ ({𝑥} × {𝑦𝜓}) ↔ ∃𝑦(𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜓))
3231anbi2i 730 . . . . . 6 ((𝑥𝐴𝑧 ∈ ({𝑥} × {𝑦𝜓})) ↔ (𝑥𝐴 ∧ ∃𝑦(𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜓)))
331, 3, 323bitr4ri 293 . . . . 5 ((𝑥𝐴𝑧 ∈ ({𝑥} × {𝑦𝜓})) ↔ ∃𝑦(𝑧 = ⟨𝑥, 𝑦⟩ ∧ (𝑥𝐴𝜓)))
3433exbii 1774 . . . 4 (∃𝑥(𝑥𝐴𝑧 ∈ ({𝑥} × {𝑦𝜓})) ↔ ∃𝑥𝑦(𝑧 = ⟨𝑥, 𝑦⟩ ∧ (𝑥𝐴𝜓)))
35 eliun 4524 . . . . 5 (𝑧 𝑥𝐴 ({𝑥} × {𝑦𝜓}) ↔ ∃𝑥𝐴 𝑧 ∈ ({𝑥} × {𝑦𝜓}))
36 df-rex 2918 . . . . 5 (∃𝑥𝐴 𝑧 ∈ ({𝑥} × {𝑦𝜓}) ↔ ∃𝑥(𝑥𝐴𝑧 ∈ ({𝑥} × {𝑦𝜓})))
3735, 36bitri 264 . . . 4 (𝑧 𝑥𝐴 ({𝑥} × {𝑦𝜓}) ↔ ∃𝑥(𝑥𝐴𝑧 ∈ ({𝑥} × {𝑦𝜓})))
38 elopab 4983 . . . 4 (𝑧 ∈ {⟨𝑥, 𝑦⟩ ∣ (𝑥𝐴𝜓)} ↔ ∃𝑥𝑦(𝑧 = ⟨𝑥, 𝑦⟩ ∧ (𝑥𝐴𝜓)))
3934, 37, 383bitr4i 292 . . 3 (𝑧 𝑥𝐴 ({𝑥} × {𝑦𝜓}) ↔ 𝑧 ∈ {⟨𝑥, 𝑦⟩ ∣ (𝑥𝐴𝜓)})
4039eqriv 2619 . 2 𝑥𝐴 ({𝑥} × {𝑦𝜓}) = {⟨𝑥, 𝑦⟩ ∣ (𝑥𝐴𝜓)}
41 opabex3d.1 . . 3 (𝜑𝐴 ∈ V)
42 snex 4908 . . . . 5 {𝑥} ∈ V
43 opabex3d.2 . . . . 5 ((𝜑𝑥𝐴) → {𝑦𝜓} ∈ V)
44 xpexg 6960 . . . . 5 (({𝑥} ∈ V ∧ {𝑦𝜓} ∈ V) → ({𝑥} × {𝑦𝜓}) ∈ V)
4542, 43, 44sylancr 695 . . . 4 ((𝜑𝑥𝐴) → ({𝑥} × {𝑦𝜓}) ∈ V)
4645ralrimiva 2966 . . 3 (𝜑 → ∀𝑥𝐴 ({𝑥} × {𝑦𝜓}) ∈ V)
47 iunexg 7143 . . 3 ((𝐴 ∈ V ∧ ∀𝑥𝐴 ({𝑥} × {𝑦𝜓}) ∈ V) → 𝑥𝐴 ({𝑥} × {𝑦𝜓}) ∈ V)
4841, 46, 47syl2anc 693 . 2 (𝜑 𝑥𝐴 ({𝑥} × {𝑦𝜓}) ∈ V)
4940, 48syl5eqelr 2706 1 (𝜑 → {⟨𝑥, 𝑦⟩ ∣ (𝑥𝐴𝜓)} ∈ V)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 196  wa 384   = wceq 1483  wex 1704  [wsb 1880  wcel 1990  {cab 2608  wral 2912  wrex 2913  Vcvv 3200  {csn 4177  cop 4183   ciun 4520  {copab 4712   × cxp 5112
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-8 1992  ax-9 1999  ax-10 2019  ax-11 2034  ax-12 2047  ax-13 2246  ax-ext 2602  ax-rep 4771  ax-sep 4781  ax-nul 4789  ax-pow 4843  ax-pr 4906  ax-un 6949
This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3an 1039  df-tru 1486  df-ex 1705  df-nf 1710  df-sb 1881  df-eu 2474  df-mo 2475  df-clab 2609  df-cleq 2615  df-clel 2618  df-nfc 2753  df-ne 2795  df-ral 2917  df-rex 2918  df-reu 2919  df-rab 2921  df-v 3202  df-sbc 3436  df-csb 3534  df-dif 3577  df-un 3579  df-in 3581  df-ss 3588  df-nul 3916  df-if 4087  df-pw 4160  df-sn 4178  df-pr 4180  df-op 4184  df-uni 4437  df-iun 4522  df-br 4654  df-opab 4713  df-mpt 4730  df-id 5024  df-xp 5120  df-rel 5121  df-cnv 5122  df-co 5123  df-dm 5124  df-rn 5125  df-res 5126  df-ima 5127  df-iota 5851  df-fun 5890  df-fn 5891  df-f 5892  df-f1 5893  df-fo 5894  df-f1o 5895  df-fv 5896
This theorem is referenced by:  wksfval  26505  fpwrelmap  29508  cnvepresex  34104  opabresex0d  41304  upwlksfval  41716
  Copyright terms: Public domain W3C validator