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

Theorem opabex3 6351
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 1962 . . . . . 6 (∃𝑦(𝑥𝐴 ∧ (𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜑)) ↔ (𝑥𝐴 ∧ ∃𝑦(𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜑)))
2 an12 567 . . . . . . 7 ((𝑧 = ⟨𝑥, 𝑦⟩ ∧ (𝑥𝐴𝜑)) ↔ (𝑥𝐴 ∧ (𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜑)))
32exbii 1658 . . . . . 6 (∃𝑦(𝑧 = ⟨𝑥, 𝑦⟩ ∧ (𝑥𝐴𝜑)) ↔ ∃𝑦(𝑥𝐴 ∧ (𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜑)))
4 elxp 4791 . . . . . . . 8 (𝑧 ∈ ({𝑥} × {𝑦𝜑}) ↔ ∃𝑣𝑤(𝑧 = ⟨𝑣, 𝑤⟩ ∧ (𝑣 ∈ {𝑥} ∧ 𝑤 ∈ {𝑦𝜑})))
5 excom 1716 . . . . . . . . 9 (∃𝑣𝑤(𝑧 = ⟨𝑣, 𝑤⟩ ∧ (𝑣 ∈ {𝑥} ∧ 𝑤 ∈ {𝑦𝜑})) ↔ ∃𝑤𝑣(𝑧 = ⟨𝑣, 𝑤⟩ ∧ (𝑣 ∈ {𝑥} ∧ 𝑤 ∈ {𝑦𝜑})))
6 an12 567 . . . . . . . . . . . . 13 ((𝑧 = ⟨𝑣, 𝑤⟩ ∧ (𝑣 ∈ {𝑥} ∧ 𝑤 ∈ {𝑦𝜑})) ↔ (𝑣 ∈ {𝑥} ∧ (𝑧 = ⟨𝑣, 𝑤⟩ ∧ 𝑤 ∈ {𝑦𝜑})))
7 velsn 3726 . . . . . . . . . . . . . 14 (𝑣 ∈ {𝑥} ↔ 𝑣 = 𝑥)
87anbi1i 462 . . . . . . . . . . . . 13 ((𝑣 ∈ {𝑥} ∧ (𝑧 = ⟨𝑣, 𝑤⟩ ∧ 𝑤 ∈ {𝑦𝜑})) ↔ (𝑣 = 𝑥 ∧ (𝑧 = ⟨𝑣, 𝑤⟩ ∧ 𝑤 ∈ {𝑦𝜑})))
96, 8bitri 184 . . . . . . . . . . . 12 ((𝑧 = ⟨𝑣, 𝑤⟩ ∧ (𝑣 ∈ {𝑥} ∧ 𝑤 ∈ {𝑦𝜑})) ↔ (𝑣 = 𝑥 ∧ (𝑧 = ⟨𝑣, 𝑤⟩ ∧ 𝑤 ∈ {𝑦𝜑})))
109exbii 1658 . . . . . . . . . . 11 (∃𝑣(𝑧 = ⟨𝑣, 𝑤⟩ ∧ (𝑣 ∈ {𝑥} ∧ 𝑤 ∈ {𝑦𝜑})) ↔ ∃𝑣(𝑣 = 𝑥 ∧ (𝑧 = ⟨𝑣, 𝑤⟩ ∧ 𝑤 ∈ {𝑦𝜑})))
11 vex 2824 . . . . . . . . . . . 12 𝑥 ∈ V
12 opeq1 3904 . . . . . . . . . . . . . 14 (𝑣 = 𝑥 → ⟨𝑣, 𝑤⟩ = ⟨𝑥, 𝑤⟩)
1312eqeq2d 2250 . . . . . . . . . . . . 13 (𝑣 = 𝑥 → (𝑧 = ⟨𝑣, 𝑤⟩ ↔ 𝑧 = ⟨𝑥, 𝑤⟩))
1413anbi1d 469 . . . . . . . . . . . 12 (𝑣 = 𝑥 → ((𝑧 = ⟨𝑣, 𝑤⟩ ∧ 𝑤 ∈ {𝑦𝜑}) ↔ (𝑧 = ⟨𝑥, 𝑤⟩ ∧ 𝑤 ∈ {𝑦𝜑})))
1511, 14ceqsexv 2861 . . . . . . . . . . 11 (∃𝑣(𝑣 = 𝑥 ∧ (𝑧 = ⟨𝑣, 𝑤⟩ ∧ 𝑤 ∈ {𝑦𝜑})) ↔ (𝑧 = ⟨𝑥, 𝑤⟩ ∧ 𝑤 ∈ {𝑦𝜑}))
1610, 15bitri 184 . . . . . . . . . 10 (∃𝑣(𝑧 = ⟨𝑣, 𝑤⟩ ∧ (𝑣 ∈ {𝑥} ∧ 𝑤 ∈ {𝑦𝜑})) ↔ (𝑧 = ⟨𝑥, 𝑤⟩ ∧ 𝑤 ∈ {𝑦𝜑}))
1716exbii 1658 . . . . . . . . 9 (∃𝑤𝑣(𝑧 = ⟨𝑣, 𝑤⟩ ∧ (𝑣 ∈ {𝑥} ∧ 𝑤 ∈ {𝑦𝜑})) ↔ ∃𝑤(𝑧 = ⟨𝑥, 𝑤⟩ ∧ 𝑤 ∈ {𝑦𝜑}))
185, 17bitri 184 . . . . . . . 8 (∃𝑣𝑤(𝑧 = ⟨𝑣, 𝑤⟩ ∧ (𝑣 ∈ {𝑥} ∧ 𝑤 ∈ {𝑦𝜑})) ↔ ∃𝑤(𝑧 = ⟨𝑥, 𝑤⟩ ∧ 𝑤 ∈ {𝑦𝜑}))
19 nfv 1581 . . . . . . . . . 10 𝑦 𝑧 = ⟨𝑥, 𝑤
20 nfsab1 2228 . . . . . . . . . 10 𝑦 𝑤 ∈ {𝑦𝜑}
2119, 20nfan 1618 . . . . . . . . 9 𝑦(𝑧 = ⟨𝑥, 𝑤⟩ ∧ 𝑤 ∈ {𝑦𝜑})
22 nfv 1581 . . . . . . . . 9 𝑤(𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜑)
23 opeq2 3905 . . . . . . . . . . 11 (𝑤 = 𝑦 → ⟨𝑥, 𝑤⟩ = ⟨𝑥, 𝑦⟩)
2423eqeq2d 2250 . . . . . . . . . 10 (𝑤 = 𝑦 → (𝑧 = ⟨𝑥, 𝑤⟩ ↔ 𝑧 = ⟨𝑥, 𝑦⟩))
25 df-clab 2225 . . . . . . . . . . 11 (𝑤 ∈ {𝑦𝜑} ↔ [𝑤 / 𝑦]𝜑)
26 sbequ12 1824 . . . . . . . . . . . 12 (𝑦 = 𝑤 → (𝜑 ↔ [𝑤 / 𝑦]𝜑))
2726equcoms 1760 . . . . . . . . . . 11 (𝑤 = 𝑦 → (𝜑 ↔ [𝑤 / 𝑦]𝜑))
2825, 27bitr4id 199 . . . . . . . . . 10 (𝑤 = 𝑦 → (𝑤 ∈ {𝑦𝜑} ↔ 𝜑))
2924, 28anbi12d 477 . . . . . . . . 9 (𝑤 = 𝑦 → ((𝑧 = ⟨𝑥, 𝑤⟩ ∧ 𝑤 ∈ {𝑦𝜑}) ↔ (𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜑)))
3021, 22, 29cbvex 1809 . . . . . . . 8 (∃𝑤(𝑧 = ⟨𝑥, 𝑤⟩ ∧ 𝑤 ∈ {𝑦𝜑}) ↔ ∃𝑦(𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜑))
314, 18, 303bitri 206 . . . . . . 7 (𝑧 ∈ ({𝑥} × {𝑦𝜑}) ↔ ∃𝑦(𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜑))
3231anbi2i 461 . . . . . 6 ((𝑥𝐴𝑧 ∈ ({𝑥} × {𝑦𝜑})) ↔ (𝑥𝐴 ∧ ∃𝑦(𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜑)))
331, 3, 323bitr4ri 213 . . . . 5 ((𝑥𝐴𝑧 ∈ ({𝑥} × {𝑦𝜑})) ↔ ∃𝑦(𝑧 = ⟨𝑥, 𝑦⟩ ∧ (𝑥𝐴𝜑)))
3433exbii 1658 . . . 4 (∃𝑥(𝑥𝐴𝑧 ∈ ({𝑥} × {𝑦𝜑})) ↔ ∃𝑥𝑦(𝑧 = ⟨𝑥, 𝑦⟩ ∧ (𝑥𝐴𝜑)))
35 eliun 4016 . . . . 5 (𝑧 𝑥𝐴 ({𝑥} × {𝑦𝜑}) ↔ ∃𝑥𝐴 𝑧 ∈ ({𝑥} × {𝑦𝜑}))
36 df-rex 2534 . . . . 5 (∃𝑥𝐴 𝑧 ∈ ({𝑥} × {𝑦𝜑}) ↔ ∃𝑥(𝑥𝐴𝑧 ∈ ({𝑥} × {𝑦𝜑})))
3735, 36bitri 184 . . . 4 (𝑧 𝑥𝐴 ({𝑥} × {𝑦𝜑}) ↔ ∃𝑥(𝑥𝐴𝑧 ∈ ({𝑥} × {𝑦𝜑})))
38 elopab 4400 . . . 4 (𝑧 ∈ {⟨𝑥, 𝑦⟩ ∣ (𝑥𝐴𝜑)} ↔ ∃𝑥𝑦(𝑧 = ⟨𝑥, 𝑦⟩ ∧ (𝑥𝐴𝜑)))
3934, 37, 383bitr4i 212 . . 3 (𝑧 𝑥𝐴 ({𝑥} × {𝑦𝜑}) ↔ 𝑧 ∈ {⟨𝑥, 𝑦⟩ ∣ (𝑥𝐴𝜑)})
4039eqriv 2235 . 2 𝑥𝐴 ({𝑥} × {𝑦𝜑}) = {⟨𝑥, 𝑦⟩ ∣ (𝑥𝐴𝜑)}
41 opabex3.1 . . 3 𝐴 ∈ V
42 snexg 4321 . . . . . 6 (𝑥 ∈ V → {𝑥} ∈ V)
4311, 42ax-mp 5 . . . . 5 {𝑥} ∈ V
44 opabex3.2 . . . . 5 (𝑥𝐴 → {𝑦𝜑} ∈ V)
45 xpexg 4889 . . . . 5 (({𝑥} ∈ V ∧ {𝑦𝜑} ∈ V) → ({𝑥} × {𝑦𝜑}) ∈ V)
4643, 44, 45sylancr 418 . . . 4 (𝑥𝐴 → ({𝑥} × {𝑦𝜑}) ∈ V)
4746rgen 2603 . . 3 𝑥𝐴 ({𝑥} × {𝑦𝜑}) ∈ V
48 iunexg 6348 . . 3 ((𝐴 ∈ V ∧ ∀𝑥𝐴 ({𝑥} × {𝑦𝜑}) ∈ V) → 𝑥𝐴 ({𝑥} × {𝑦𝜑}) ∈ V)
4941, 47, 48mp2an 430 . 2 𝑥𝐴 ({𝑥} × {𝑦𝜑}) ∈ V
5040, 49eqeltrri 2312 1 {⟨𝑥, 𝑦⟩ ∣ (𝑥𝐴𝜑)} ∈ V
Colors of variables:    wff set class
This proof depends on syntax axioms:  wi 4  wa 104  wb 105   = wceq 1402  wex 1545  [wsb 1815  wcel 2209  {cab 2224  wral 2528  wrex 2529  Vcvv 2821  {csn 3709  cop 3712   ciun 4012  {copab 4191   × cxp 4772
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-coll 4246  ax-sep 4249  ax-pow 4311  ax-pr 4346  ax-un 4578
This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ral 2533  df-rex 2534  df-reu 2535  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-un 3224  df-in 3226  df-ss 3233  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-iun 4014  df-br 4131  df-opab 4193  df-mpt 4194  df-id 4438  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-res 4786  df-ima 4787  df-iota 5337  df-fun 5379  df-fn 5380  df-f 5381  df-f1 5382  df-fo 5383  df-f1o 5384  df-fv 5385
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator