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

Theorem opabex3 6265
Description: Existence of an ordered pair abstraction. (Contributed by Jeff Madsen, 2-Sep-2009.)
Hypotheses
Ref Expression
opabex3.1 𝐴 ∈ V
opabex3.2 (𝑥𝐴 → {𝑦𝜑} ∈ V)
Assertion
Ref Expression
opabex3 {⟨𝑥, 𝑦⟩ ∣ (𝑥𝐴𝜑)} ∈ V
Distinct variable group:   𝑥,𝐴,𝑦
Allowed substitution hints:   𝜑(𝑥,𝑦)

Proof of Theorem opabex3
Dummy variables 𝑣 𝑤 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 19.42v 1953 . . . . . 6 (∃𝑦(𝑥𝐴 ∧ (𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜑)) ↔ (𝑥𝐴 ∧ ∃𝑦(𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜑)))
2 an12 561 . . . . . . 7 ((𝑧 = ⟨𝑥, 𝑦⟩ ∧ (𝑥𝐴𝜑)) ↔ (𝑥𝐴 ∧ (𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜑)))
32exbii 1651 . . . . . 6 (∃𝑦(𝑧 = ⟨𝑥, 𝑦⟩ ∧ (𝑥𝐴𝜑)) ↔ ∃𝑦(𝑥𝐴 ∧ (𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜑)))
4 elxp 4735 . . . . . . . 8 (𝑧 ∈ ({𝑥} × {𝑦𝜑}) ↔ ∃𝑣𝑤(𝑧 = ⟨𝑣, 𝑤⟩ ∧ (𝑣 ∈ {𝑥} ∧ 𝑤 ∈ {𝑦𝜑})))
5 excom 1710 . . . . . . . . 9 (∃𝑣𝑤(𝑧 = ⟨𝑣, 𝑤⟩ ∧ (𝑣 ∈ {𝑥} ∧ 𝑤 ∈ {𝑦𝜑})) ↔ ∃𝑤𝑣(𝑧 = ⟨𝑣, 𝑤⟩ ∧ (𝑣 ∈ {𝑥} ∧ 𝑤 ∈ {𝑦𝜑})))
6 an12 561 . . . . . . . . . . . . 13 ((𝑧 = ⟨𝑣, 𝑤⟩ ∧ (𝑣 ∈ {𝑥} ∧ 𝑤 ∈ {𝑦𝜑})) ↔ (𝑣 ∈ {𝑥} ∧ (𝑧 = ⟨𝑣, 𝑤⟩ ∧ 𝑤 ∈ {𝑦𝜑})))
7 velsn 3683 . . . . . . . . . . . . . 14 (𝑣 ∈ {𝑥} ↔ 𝑣 = 𝑥)
87anbi1i 458 . . . . . . . . . . . . 13 ((𝑣 ∈ {𝑥} ∧ (𝑧 = ⟨𝑣, 𝑤⟩ ∧ 𝑤 ∈ {𝑦𝜑})) ↔ (𝑣 = 𝑥 ∧ (𝑧 = ⟨𝑣, 𝑤⟩ ∧ 𝑤 ∈ {𝑦𝜑})))
96, 8bitri 184 . . . . . . . . . . . 12 ((𝑧 = ⟨𝑣, 𝑤⟩ ∧ (𝑣 ∈ {𝑥} ∧ 𝑤 ∈ {𝑦𝜑})) ↔ (𝑣 = 𝑥 ∧ (𝑧 = ⟨𝑣, 𝑤⟩ ∧ 𝑤 ∈ {𝑦𝜑})))
109exbii 1651 . . . . . . . . . . 11 (∃𝑣(𝑧 = ⟨𝑣, 𝑤⟩ ∧ (𝑣 ∈ {𝑥} ∧ 𝑤 ∈ {𝑦𝜑})) ↔ ∃𝑣(𝑣 = 𝑥 ∧ (𝑧 = ⟨𝑣, 𝑤⟩ ∧ 𝑤 ∈ {𝑦𝜑})))
11 vex 2802 . . . . . . . . . . . 12 𝑥 ∈ V
12 opeq1 3856 . . . . . . . . . . . . . 14 (𝑣 = 𝑥 → ⟨𝑣, 𝑤⟩ = ⟨𝑥, 𝑤⟩)
1312eqeq2d 2241 . . . . . . . . . . . . 13 (𝑣 = 𝑥 → (𝑧 = ⟨𝑣, 𝑤⟩ ↔ 𝑧 = ⟨𝑥, 𝑤⟩))
1413anbi1d 465 . . . . . . . . . . . 12 (𝑣 = 𝑥 → ((𝑧 = ⟨𝑣, 𝑤⟩ ∧ 𝑤 ∈ {𝑦𝜑}) ↔ (𝑧 = ⟨𝑥, 𝑤⟩ ∧ 𝑤 ∈ {𝑦𝜑})))
1511, 14ceqsexv 2839 . . . . . . . . . . 11 (∃𝑣(𝑣 = 𝑥 ∧ (𝑧 = ⟨𝑣, 𝑤⟩ ∧ 𝑤 ∈ {𝑦𝜑})) ↔ (𝑧 = ⟨𝑥, 𝑤⟩ ∧ 𝑤 ∈ {𝑦𝜑}))
1610, 15bitri 184 . . . . . . . . . 10 (∃𝑣(𝑧 = ⟨𝑣, 𝑤⟩ ∧ (𝑣 ∈ {𝑥} ∧ 𝑤 ∈ {𝑦𝜑})) ↔ (𝑧 = ⟨𝑥, 𝑤⟩ ∧ 𝑤 ∈ {𝑦𝜑}))
1716exbii 1651 . . . . . . . . 9 (∃𝑤𝑣(𝑧 = ⟨𝑣, 𝑤⟩ ∧ (𝑣 ∈ {𝑥} ∧ 𝑤 ∈ {𝑦𝜑})) ↔ ∃𝑤(𝑧 = ⟨𝑥, 𝑤⟩ ∧ 𝑤 ∈ {𝑦𝜑}))
185, 17bitri 184 . . . . . . . 8 (∃𝑣𝑤(𝑧 = ⟨𝑣, 𝑤⟩ ∧ (𝑣 ∈ {𝑥} ∧ 𝑤 ∈ {𝑦𝜑})) ↔ ∃𝑤(𝑧 = ⟨𝑥, 𝑤⟩ ∧ 𝑤 ∈ {𝑦𝜑}))
19 nfv 1574 . . . . . . . . . 10 𝑦 𝑧 = ⟨𝑥, 𝑤
20 nfsab1 2219 . . . . . . . . . 10 𝑦 𝑤 ∈ {𝑦𝜑}
2119, 20nfan 1611 . . . . . . . . 9 𝑦(𝑧 = ⟨𝑥, 𝑤⟩ ∧ 𝑤 ∈ {𝑦𝜑})
22 nfv 1574 . . . . . . . . 9 𝑤(𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜑)
23 opeq2 3857 . . . . . . . . . . 11 (𝑤 = 𝑦 → ⟨𝑥, 𝑤⟩ = ⟨𝑥, 𝑦⟩)
2423eqeq2d 2241 . . . . . . . . . 10 (𝑤 = 𝑦 → (𝑧 = ⟨𝑥, 𝑤⟩ ↔ 𝑧 = ⟨𝑥, 𝑦⟩))
25 df-clab 2216 . . . . . . . . . . 11 (𝑤 ∈ {𝑦𝜑} ↔ [𝑤 / 𝑦]𝜑)
26 sbequ12 1817 . . . . . . . . . . . 12 (𝑦 = 𝑤 → (𝜑 ↔ [𝑤 / 𝑦]𝜑))
2726equcoms 1754 . . . . . . . . . . 11 (𝑤 = 𝑦 → (𝜑 ↔ [𝑤 / 𝑦]𝜑))
2825, 27bitr4id 199 . . . . . . . . . 10 (𝑤 = 𝑦 → (𝑤 ∈ {𝑦𝜑} ↔ 𝜑))
2924, 28anbi12d 473 . . . . . . . . 9 (𝑤 = 𝑦 → ((𝑧 = ⟨𝑥, 𝑤⟩ ∧ 𝑤 ∈ {𝑦𝜑}) ↔ (𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜑)))
3021, 22, 29cbvex 1802 . . . . . . . 8 (∃𝑤(𝑧 = ⟨𝑥, 𝑤⟩ ∧ 𝑤 ∈ {𝑦𝜑}) ↔ ∃𝑦(𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜑))
314, 18, 303bitri 206 . . . . . . 7 (𝑧 ∈ ({𝑥} × {𝑦𝜑}) ↔ ∃𝑦(𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜑))
3231anbi2i 457 . . . . . 6 ((𝑥𝐴𝑧 ∈ ({𝑥} × {𝑦𝜑})) ↔ (𝑥𝐴 ∧ ∃𝑦(𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜑)))
331, 3, 323bitr4ri 213 . . . . 5 ((𝑥𝐴𝑧 ∈ ({𝑥} × {𝑦𝜑})) ↔ ∃𝑦(𝑧 = ⟨𝑥, 𝑦⟩ ∧ (𝑥𝐴𝜑)))
3433exbii 1651 . . . 4 (∃𝑥(𝑥𝐴𝑧 ∈ ({𝑥} × {𝑦𝜑})) ↔ ∃𝑥𝑦(𝑧 = ⟨𝑥, 𝑦⟩ ∧ (𝑥𝐴𝜑)))
35 eliun 3968 . . . . 5 (𝑧 𝑥𝐴 ({𝑥} × {𝑦𝜑}) ↔ ∃𝑥𝐴 𝑧 ∈ ({𝑥} × {𝑦𝜑}))
36 df-rex 2514 . . . . 5 (∃𝑥𝐴 𝑧 ∈ ({𝑥} × {𝑦𝜑}) ↔ ∃𝑥(𝑥𝐴𝑧 ∈ ({𝑥} × {𝑦𝜑})))
3735, 36bitri 184 . . . 4 (𝑧 𝑥𝐴 ({𝑥} × {𝑦𝜑}) ↔ ∃𝑥(𝑥𝐴𝑧 ∈ ({𝑥} × {𝑦𝜑})))
38 elopab 4345 . . . 4 (𝑧 ∈ {⟨𝑥, 𝑦⟩ ∣ (𝑥𝐴𝜑)} ↔ ∃𝑥𝑦(𝑧 = ⟨𝑥, 𝑦⟩ ∧ (𝑥𝐴𝜑)))
3934, 37, 383bitr4i 212 . . 3 (𝑧 𝑥𝐴 ({𝑥} × {𝑦𝜑}) ↔ 𝑧 ∈ {⟨𝑥, 𝑦⟩ ∣ (𝑥𝐴𝜑)})
4039eqriv 2226 . 2 𝑥𝐴 ({𝑥} × {𝑦𝜑}) = {⟨𝑥, 𝑦⟩ ∣ (𝑥𝐴𝜑)}
41 opabex3.1 . . 3 𝐴 ∈ V
42 snexg 4267 . . . . . 6 (𝑥 ∈ V → {𝑥} ∈ V)
4311, 42ax-mp 5 . . . . 5 {𝑥} ∈ V
44 opabex3.2 . . . . 5 (𝑥𝐴 → {𝑦𝜑} ∈ V)
45 xpexg 4832 . . . . 5 (({𝑥} ∈ V ∧ {𝑦𝜑} ∈ V) → ({𝑥} × {𝑦𝜑}) ∈ V)
4643, 44, 45sylancr 414 . . . 4 (𝑥𝐴 → ({𝑥} × {𝑦𝜑}) ∈ V)
4746rgen 2583 . . 3 𝑥𝐴 ({𝑥} × {𝑦𝜑}) ∈ V
48 iunexg 6262 . . 3 ((𝐴 ∈ V ∧ ∀𝑥𝐴 ({𝑥} × {𝑦𝜑}) ∈ V) → 𝑥𝐴 ({𝑥} × {𝑦𝜑}) ∈ V)
4941, 47, 48mp2an 426 . 2 𝑥𝐴 ({𝑥} × {𝑦𝜑}) ∈ V
5040, 49eqeltrri 2303 1 {⟨𝑥, 𝑦⟩ ∣ (𝑥𝐴𝜑)} ∈ V
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104  wb 105   = wceq 1395  wex 1538  [wsb 1808  wcel 2200  {cab 2215  wral 2508  wrex 2509  Vcvv 2799  {csn 3666  cop 3669   ciun 3964  {copab 4143   × cxp 4716
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 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-13 2202  ax-14 2203  ax-ext 2211  ax-coll 4198  ax-sep 4201  ax-pow 4257  ax-pr 4292  ax-un 4523
This theorem depends on definitions:  df-bi 117  df-3an 1004  df-tru 1398  df-nf 1507  df-sb 1809  df-eu 2080  df-mo 2081  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ral 2513  df-rex 2514  df-reu 2515  df-rab 2517  df-v 2801  df-sbc 3029  df-csb 3125  df-un 3201  df-in 3203  df-ss 3210  df-pw 3651  df-sn 3672  df-pr 3673  df-op 3675  df-uni 3888  df-iun 3966  df-br 4083  df-opab 4145  df-mpt 4146  df-id 4383  df-xp 4724  df-rel 4725  df-cnv 4726  df-co 4727  df-dm 4728  df-rn 4729  df-res 4730  df-ima 4731  df-iota 5277  df-fun 5319  df-fn 5320  df-f 5321  df-f1 5322  df-fo 5323  df-f1o 5324  df-fv 5325
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator