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

Theorem opeliunxp 4830
Description: Membership in a union of cross products. (Contributed by Mario Carneiro, 29-Dec-2014.) (Revised by Mario Carneiro, 1-Jan-2017.)
Assertion
Ref Expression
opeliunxp (⟨𝑥, 𝐶⟩ ∈ ∪ 𝑥 ∈ 𝐴 ({𝑥} × 𝐵) ↔ (𝑥 ∈ 𝐴 ∧ 𝐶 ∈ 𝐵))

Proof of Theorem opeliunxp
Dummy variables 𝑦 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 elex 2833 . 2 (⟨𝑥, 𝐶⟩ ∈ ∪ 𝑥 ∈ 𝐴 ({𝑥} × 𝐵) → ⟨𝑥, 𝐶⟩ ∈ V)
2 opexg 4368 . 2 ((𝑥 ∈ 𝐴 ∧ 𝐶 ∈ 𝐵) → ⟨𝑥, 𝐶⟩ ∈ V)
3 df-rex 2534 . . . . . 6 (∃𝑥 ∈ 𝐴 𝑦 ∈ ({𝑥} × 𝐵) ↔ ∃𝑥(𝑥 ∈ 𝐴 ∧ 𝑦 ∈ ({𝑥} × 𝐵)))
4 nfv 1581 . . . . . . 7 Ⅎ𝑧(𝑥 ∈ 𝐴 ∧ 𝑦 ∈ ({𝑥} × 𝐵))
5 nfs1v 1999 . . . . . . . 8 Ⅎ𝑥[𝑧 / 𝑥]𝑥 ∈ 𝐴
6 nfcv 2392 . . . . . . . . . 10 Ⅎ𝑥{𝑧}
7 nfcsb1v 3180 . . . . . . . . . 10 Ⅎ𝑥⦋𝑧 / 𝑥⦌𝐵
86, 7nfxp 4801 . . . . . . . . 9 Ⅎ𝑥({𝑧} × ⦋𝑧 / 𝑥⦌𝐵)
98nfcri 2386 . . . . . . . 8 Ⅎ𝑥 𝑦 ∈ ({𝑧} × ⦋𝑧 / 𝑥⦌𝐵)
105, 9nfan 1618 . . . . . . 7 Ⅎ𝑥([𝑧 / 𝑥]𝑥 ∈ 𝐴 ∧ 𝑦 ∈ ({𝑧} × ⦋𝑧 / 𝑥⦌𝐵))
11 sbequ12 1824 . . . . . . . 8 (𝑥 = 𝑧 → (𝑥 ∈ 𝐴 ↔ [𝑧 / 𝑥]𝑥 ∈ 𝐴))
12 sneq 3720 . . . . . . . . . 10 (𝑥 = 𝑧 → {𝑥} = {𝑧})
13 csbeq1a 3156 . . . . . . . . . 10 (𝑥 = 𝑧 → 𝐵 = ⦋𝑧 / 𝑥⦌𝐵)
1412, 13xpeq12d 4799 . . . . . . . . 9 (𝑥 = 𝑧 → ({𝑥} × 𝐵) = ({𝑧} × ⦋𝑧 / 𝑥⦌𝐵))
1514eleq2d 2308 . . . . . . . 8 (𝑥 = 𝑧 → (𝑦 ∈ ({𝑥} × 𝐵) ↔ 𝑦 ∈ ({𝑧} × ⦋𝑧 / 𝑥⦌𝐵)))
1611, 15anbi12d 477 . . . . . . 7 (𝑥 = 𝑧 → ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ ({𝑥} × 𝐵)) ↔ ([𝑧 / 𝑥]𝑥 ∈ 𝐴 ∧ 𝑦 ∈ ({𝑧} × ⦋𝑧 / 𝑥⦌𝐵))))
174, 10, 16cbvex 1809 . . . . . 6 (∃𝑥(𝑥 ∈ 𝐴 ∧ 𝑦 ∈ ({𝑥} × 𝐵)) ↔ ∃𝑧([𝑧 / 𝑥]𝑥 ∈ 𝐴 ∧ 𝑦 ∈ ({𝑧} × ⦋𝑧 / 𝑥⦌𝐵)))
183, 17bitri 184 . . . . 5 (∃𝑥 ∈ 𝐴 𝑦 ∈ ({𝑥} × 𝐵) ↔ ∃𝑧([𝑧 / 𝑥]𝑥 ∈ 𝐴 ∧ 𝑦 ∈ ({𝑧} × ⦋𝑧 / 𝑥⦌𝐵)))
19 eleq1 2301 . . . . . . 7 (𝑦 = ⟨𝑥, 𝐶⟩ → (𝑦 ∈ ({𝑧} × ⦋𝑧 / 𝑥⦌𝐵) ↔ ⟨𝑥, 𝐶⟩ ∈ ({𝑧} × ⦋𝑧 / 𝑥⦌𝐵)))
2019anbi2d 468 . . . . . 6 (𝑦 = ⟨𝑥, 𝐶⟩ → (([𝑧 / 𝑥]𝑥 ∈ 𝐴 ∧ 𝑦 ∈ ({𝑧} × ⦋𝑧 / 𝑥⦌𝐵)) ↔ ([𝑧 / 𝑥]𝑥 ∈ 𝐴 ∧ ⟨𝑥, 𝐶⟩ ∈ ({𝑧} × ⦋𝑧 / 𝑥⦌𝐵))))
2120exbidv 1878 . . . . 5 (𝑦 = ⟨𝑥, 𝐶⟩ → (∃𝑧([𝑧 / 𝑥]𝑥 ∈ 𝐴 ∧ 𝑦 ∈ ({𝑧} × ⦋𝑧 / 𝑥⦌𝐵)) ↔ ∃𝑧([𝑧 / 𝑥]𝑥 ∈ 𝐴 ∧ ⟨𝑥, 𝐶⟩ ∈ ({𝑧} × ⦋𝑧 / 𝑥⦌𝐵))))
2218, 21bitrid 192 . . . 4 (𝑦 = ⟨𝑥, 𝐶⟩ → (∃𝑥 ∈ 𝐴 𝑦 ∈ ({𝑥} × 𝐵) ↔ ∃𝑧([𝑧 / 𝑥]𝑥 ∈ 𝐴 ∧ ⟨𝑥, 𝐶⟩ ∈ ({𝑧} × ⦋𝑧 / 𝑥⦌𝐵))))
23 df-iun 4014 . . . 4 ∪ 𝑥 ∈ 𝐴 ({𝑥} × 𝐵) = {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 ∈ ({𝑥} × 𝐵)}
2422, 23elab2g 2973 . . 3 (⟨𝑥, 𝐶⟩ ∈ V → (⟨𝑥, 𝐶⟩ ∈ ∪ 𝑥 ∈ 𝐴 ({𝑥} × 𝐵) ↔ ∃𝑧([𝑧 / 𝑥]𝑥 ∈ 𝐴 ∧ ⟨𝑥, 𝐶⟩ ∈ ({𝑧} × ⦋𝑧 / 𝑥⦌𝐵))))
25 opelxp 4804 . . . . . . 7 (⟨𝑥, 𝐶⟩ ∈ ({𝑧} × ⦋𝑧 / 𝑥⦌𝐵) ↔ (𝑥 ∈ {𝑧} ∧ 𝐶 ∈ ⦋𝑧 / 𝑥⦌𝐵))
2625anbi2i 461 . . . . . 6 (([𝑧 / 𝑥]𝑥 ∈ 𝐴 ∧ ⟨𝑥, 𝐶⟩ ∈ ({𝑧} × ⦋𝑧 / 𝑥⦌𝐵)) ↔ ([𝑧 / 𝑥]𝑥 ∈ 𝐴 ∧ (𝑥 ∈ {𝑧} ∧ 𝐶 ∈ ⦋𝑧 / 𝑥⦌𝐵)))
27 an12 567 . . . . . 6 (([𝑧 / 𝑥]𝑥 ∈ 𝐴 ∧ (𝑥 ∈ {𝑧} ∧ 𝐶 ∈ ⦋𝑧 / 𝑥⦌𝐵)) ↔ (𝑥 ∈ {𝑧} ∧ ([𝑧 / 𝑥]𝑥 ∈ 𝐴 ∧ 𝐶 ∈ ⦋𝑧 / 𝑥⦌𝐵)))
28 velsn 3726 . . . . . . . 8 (𝑥 ∈ {𝑧} ↔ 𝑥 = 𝑧)
29 equcom 1758 . . . . . . . 8 (𝑥 = 𝑧 ↔ 𝑧 = 𝑥)
3028, 29bitri 184 . . . . . . 7 (𝑥 ∈ {𝑧} ↔ 𝑧 = 𝑥)
3130anbi1i 462 . . . . . 6 ((𝑥 ∈ {𝑧} ∧ ([𝑧 / 𝑥]𝑥 ∈ 𝐴 ∧ 𝐶 ∈ ⦋𝑧 / 𝑥⦌𝐵)) ↔ (𝑧 = 𝑥 ∧ ([𝑧 / 𝑥]𝑥 ∈ 𝐴 ∧ 𝐶 ∈ ⦋𝑧 / 𝑥⦌𝐵)))
3226, 27, 313bitri 206 . . . . 5 (([𝑧 / 𝑥]𝑥 ∈ 𝐴 ∧ ⟨𝑥, 𝐶⟩ ∈ ({𝑧} × ⦋𝑧 / 𝑥⦌𝐵)) ↔ (𝑧 = 𝑥 ∧ ([𝑧 / 𝑥]𝑥 ∈ 𝐴 ∧ 𝐶 ∈ ⦋𝑧 / 𝑥⦌𝐵)))
3332exbii 1658 . . . 4 (∃𝑧([𝑧 / 𝑥]𝑥 ∈ 𝐴 ∧ ⟨𝑥, 𝐶⟩ ∈ ({𝑧} × ⦋𝑧 / 𝑥⦌𝐵)) ↔ ∃𝑧(𝑧 = 𝑥 ∧ ([𝑧 / 𝑥]𝑥 ∈ 𝐴 ∧ 𝐶 ∈ ⦋𝑧 / 𝑥⦌𝐵)))
34 vex 2824 . . . . 5 𝑥 ∈ V
35 sbequ12r 1825 . . . . . 6 (𝑧 = 𝑥 → ([𝑧 / 𝑥]𝑥 ∈ 𝐴 ↔ 𝑥 ∈ 𝐴))
3613equcoms 1760 . . . . . . . 8 (𝑧 = 𝑥 → 𝐵 = ⦋𝑧 / 𝑥⦌𝐵)
3736eqcomd 2244 . . . . . . 7 (𝑧 = 𝑥 → ⦋𝑧 / 𝑥⦌𝐵 = 𝐵)
3837eleq2d 2308 . . . . . 6 (𝑧 = 𝑥 → (𝐶 ∈ ⦋𝑧 / 𝑥⦌𝐵 ↔ 𝐶 ∈ 𝐵))
3935, 38anbi12d 477 . . . . 5 (𝑧 = 𝑥 → (([𝑧 / 𝑥]𝑥 ∈ 𝐴 ∧ 𝐶 ∈ ⦋𝑧 / 𝑥⦌𝐵) ↔ (𝑥 ∈ 𝐴 ∧ 𝐶 ∈ 𝐵)))
4034, 39ceqsexv 2861 . . . 4 (∃𝑧(𝑧 = 𝑥 ∧ ([𝑧 / 𝑥]𝑥 ∈ 𝐴 ∧ 𝐶 ∈ ⦋𝑧 / 𝑥⦌𝐵)) ↔ (𝑥 ∈ 𝐴 ∧ 𝐶 ∈ 𝐵))
4133, 40bitri 184 . . 3 (∃𝑧([𝑧 / 𝑥]𝑥 ∈ 𝐴 ∧ ⟨𝑥, 𝐶⟩ ∈ ({𝑧} × ⦋𝑧 / 𝑥⦌𝐵)) ↔ (𝑥 ∈ 𝐴 ∧ 𝐶 ∈ 𝐵))
4224, 41bitrdi 196 . 2 (⟨𝑥, 𝐶⟩ ∈ V → (⟨𝑥, 𝐶⟩ ∈ ∪ 𝑥 ∈ 𝐴 ({𝑥} × 𝐵) ↔ (𝑥 ∈ 𝐴 ∧ 𝐶 ∈ 𝐵)))
431, 2, 42pm5.21nii 716 1 (⟨𝑥, 𝐶⟩ ∈ ∪ 𝑥 ∈ 𝐴 ({𝑥} × 𝐵) ↔ (𝑥 ∈ 𝐴 ∧ 𝐶 ∈ 𝐵))
Colors of variables:    wff set class
This proof depends on syntax axioms:   ∧ wa 104   ↔ wb 105   = wceq 1402  ∃wex 1545  [wsb 1815   ∈ wcel 2209  ∃wrex 2529  Vcvv 2821  ⦋csb 3147  {csn 3709  ⟨cop 3712  ∪ ciun 4012   × 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-sep 4249  ax-pow 4311  ax-pr 4346
This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-nf 1514  df-sb 1816  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ral 2533  df-rex 2534  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-iun 4014  df-opab 4193  df-xp 4780
This theorem is used by:  eliunxp  4919  opeliunxp2  4920  opeliunxp2f  6509
  Copyright terms: Public domain W3C validator