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

Theorem opeliunxp2 4920
Description: Membership in a union of cross products. (Contributed by Mario Carneiro, 14-Feb-2015.)
Hypothesis
Ref Expression
opeliunxp2.1 (𝑥 = 𝐶𝐵 = 𝐸)
Assertion
Ref Expression
opeliunxp2 (⟨𝐶, 𝐷⟩ ∈ 𝑥𝐴 ({𝑥} × 𝐵) ↔ (𝐶𝐴𝐷𝐸))
Distinct variable groups:   𝑥,𝐶   𝑥,𝐷   𝑥,𝐸   𝑥,𝐴
Allowed substitution hint:   𝐵(𝑥)

Proof of Theorem opeliunxp2
StepHypRef Expression
1 df-br 4131 . . 3 (𝐶 𝑥𝐴 ({𝑥} × 𝐵)𝐷 ↔ ⟨𝐶, 𝐷⟩ ∈ 𝑥𝐴 ({𝑥} × 𝐵))
2 relxp 4884 . . . . . 6 Rel ({𝑥} × 𝐵)
32rgenw 2605 . . . . 5 𝑥𝐴 Rel ({𝑥} × 𝐵)
4 reliun 4898 . . . . 5 (Rel 𝑥𝐴 ({𝑥} × 𝐵) ↔ ∀𝑥𝐴 Rel ({𝑥} × 𝐵))
53, 4mpbir 146 . . . 4 Rel 𝑥𝐴 ({𝑥} × 𝐵)
65brrelex1i 4818 . . 3 (𝐶 𝑥𝐴 ({𝑥} × 𝐵)𝐷𝐶 ∈ V)
71, 6sylbir 135 . 2 (⟨𝐶, 𝐷⟩ ∈ 𝑥𝐴 ({𝑥} × 𝐵) → 𝐶 ∈ V)
8 elex 2833 . . 3 (𝐶𝐴𝐶 ∈ V)
98adantr 276 . 2 ((𝐶𝐴𝐷𝐸) → 𝐶 ∈ V)
10 nfcv 2392 . . 3 𝑥𝐶
11 nfiu1 4042 . . . . 5 𝑥 𝑥𝐴 ({𝑥} × 𝐵)
1211nfel2 2405 . . . 4 𝑥𝐶, 𝐷⟩ ∈ 𝑥𝐴 ({𝑥} × 𝐵)
13 nfv 1581 . . . 4 𝑥(𝐶𝐴𝐷𝐸)
1412, 13nfbi 1642 . . 3 𝑥(⟨𝐶, 𝐷⟩ ∈ 𝑥𝐴 ({𝑥} × 𝐵) ↔ (𝐶𝐴𝐷𝐸))
15 opeq1 3904 . . . . 5 (𝑥 = 𝐶 → ⟨𝑥, 𝐷⟩ = ⟨𝐶, 𝐷⟩)
1615eleq1d 2307 . . . 4 (𝑥 = 𝐶 → (⟨𝑥, 𝐷⟩ ∈ 𝑥𝐴 ({𝑥} × 𝐵) ↔ ⟨𝐶, 𝐷⟩ ∈ 𝑥𝐴 ({𝑥} × 𝐵)))
17 eleq1 2301 . . . . 5 (𝑥 = 𝐶 → (𝑥𝐴𝐶𝐴))
18 opeliunxp2.1 . . . . . 6 (𝑥 = 𝐶𝐵 = 𝐸)
1918eleq2d 2308 . . . . 5 (𝑥 = 𝐶 → (𝐷𝐵𝐷𝐸))
2017, 19anbi12d 477 . . . 4 (𝑥 = 𝐶 → ((𝑥𝐴𝐷𝐵) ↔ (𝐶𝐴𝐷𝐸)))
2116, 20bibi12d 235 . . 3 (𝑥 = 𝐶 → ((⟨𝑥, 𝐷⟩ ∈ 𝑥𝐴 ({𝑥} × 𝐵) ↔ (𝑥𝐴𝐷𝐵)) ↔ (⟨𝐶, 𝐷⟩ ∈ 𝑥𝐴 ({𝑥} × 𝐵) ↔ (𝐶𝐴𝐷𝐸))))
22 opeliunxp 4830 . . 3 (⟨𝑥, 𝐷⟩ ∈ 𝑥𝐴 ({𝑥} × 𝐵) ↔ (𝑥𝐴𝐷𝐵))
2310, 14, 21, 22vtoclgf 2881 . 2 (𝐶 ∈ V → (⟨𝐶, 𝐷⟩ ∈ 𝑥𝐴 ({𝑥} × 𝐵) ↔ (𝐶𝐴𝐷𝐸)))
247, 9, 23pm5.21nii 716 1 (⟨𝐶, 𝐷⟩ ∈ 𝑥𝐴 ({𝑥} × 𝐵) ↔ (𝐶𝐴𝐷𝐸))
Colors of variables:    wff set class
This proof depends on syntax axioms:  wi 4  wa 104  wb 105   = wceq 1402  wcel 2209  wral 2528  Vcvv 2821  {csn 3709  cop 3712   ciun 4012   class class class wbr 4130   × cxp 4772  Rel wrel 4779
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-br 4131  df-opab 4193  df-xp 4780  df-rel 4781
This theorem is used by:  mpoxopn0yelv  6510  eldvap  15783
  Copyright terms: Public domain W3C validator