Theorem eliunxp 4766

Description: Membership in a union of cross products. Analogue of elxp 4643 for nonconstant 𝐵(𝑥). (Contributed by Mario Carneiro, 29-Dec-2014.)

Assertion

Ref	Expression
eliunxp	⊢ (𝐶 ∈ ∪ 𝑥 ∈ 𝐴 ({𝑥} × 𝐵) ↔ ∃𝑥∃𝑦(𝐶 = ⟨𝑥, 𝑦⟩ ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵)))

Distinct variable groups:   𝑦,𝐴   𝑦,𝐵   𝑥,𝑦,𝐶

Allowed substitution hints:   𝐴(𝑥)   𝐵(𝑥)

Proof of Theorem eliunxp

Step	Hyp	Ref	Expression
1		relxp 4735	. . . . . 6 ⊢ Rel ({𝑥} × 𝐵)
2	1	rgenw 2532	. . . . 5 ⊢ ∀𝑥 ∈ 𝐴 Rel ({𝑥} × 𝐵)
3		reliun 4747	. . . . 5 ⊢ (Rel ∪ 𝑥 ∈ 𝐴 ({𝑥} × 𝐵) ↔ ∀𝑥 ∈ 𝐴 Rel ({𝑥} × 𝐵))
4	2, 3	mpbir 146	. . . 4 ⊢ Rel ∪ 𝑥 ∈ 𝐴 ({𝑥} × 𝐵)
5		elrel 4728	. . . 4 ⊢ ((Rel ∪ 𝑥 ∈ 𝐴 ({𝑥} × 𝐵) ∧ 𝐶 ∈ ∪ 𝑥 ∈ 𝐴 ({𝑥} × 𝐵)) → ∃𝑥∃𝑦 𝐶 = ⟨𝑥, 𝑦⟩)
6	4, 5	mpan 424	. . 3 ⊢ (𝐶 ∈ ∪ 𝑥 ∈ 𝐴 ({𝑥} × 𝐵) → ∃𝑥∃𝑦 𝐶 = ⟨𝑥, 𝑦⟩)
7	6	pm4.71ri 392	. 2 ⊢ (𝐶 ∈ ∪ 𝑥 ∈ 𝐴 ({𝑥} × 𝐵) ↔ (∃𝑥∃𝑦 𝐶 = ⟨𝑥, 𝑦⟩ ∧ 𝐶 ∈ ∪ 𝑥 ∈ 𝐴 ({𝑥} × 𝐵)))
8		nfiu1 3916	. . . 4 ⊢ Ⅎ𝑥∪ 𝑥 ∈ 𝐴 ({𝑥} × 𝐵)
9	8	nfel2 2332	. . 3 ⊢ Ⅎ𝑥 𝐶 ∈ ∪ 𝑥 ∈ 𝐴 ({𝑥} × 𝐵)
10	9	19.41 1686	. 2 ⊢ (∃𝑥(∃𝑦 𝐶 = ⟨𝑥, 𝑦⟩ ∧ 𝐶 ∈ ∪ 𝑥 ∈ 𝐴 ({𝑥} × 𝐵)) ↔ (∃𝑥∃𝑦 𝐶 = ⟨𝑥, 𝑦⟩ ∧ 𝐶 ∈ ∪ 𝑥 ∈ 𝐴 ({𝑥} × 𝐵)))
11		19.41v 1902	. . . 4 ⊢ (∃𝑦(𝐶 = ⟨𝑥, 𝑦⟩ ∧ 𝐶 ∈ ∪ 𝑥 ∈ 𝐴 ({𝑥} × 𝐵)) ↔ (∃𝑦 𝐶 = ⟨𝑥, 𝑦⟩ ∧ 𝐶 ∈ ∪ 𝑥 ∈ 𝐴 ({𝑥} × 𝐵)))
12		eleq1 2240	. . . . . . 7 ⊢ (𝐶 = ⟨𝑥, 𝑦⟩ → (𝐶 ∈ ∪ 𝑥 ∈ 𝐴 ({𝑥} × 𝐵) ↔ ⟨𝑥, 𝑦⟩ ∈ ∪ 𝑥 ∈ 𝐴 ({𝑥} × 𝐵)))
13		opeliunxp 4681	. . . . . . 7 ⊢ (⟨𝑥, 𝑦⟩ ∈ ∪ 𝑥 ∈ 𝐴 ({𝑥} × 𝐵) ↔ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵))
14	12, 13	bitrdi 196	. . . . . 6 ⊢ (𝐶 = ⟨𝑥, 𝑦⟩ → (𝐶 ∈ ∪ 𝑥 ∈ 𝐴 ({𝑥} × 𝐵) ↔ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵)))
15	14	pm5.32i 454	. . . . 5 ⊢ ((𝐶 = ⟨𝑥, 𝑦⟩ ∧ 𝐶 ∈ ∪ 𝑥 ∈ 𝐴 ({𝑥} × 𝐵)) ↔ (𝐶 = ⟨𝑥, 𝑦⟩ ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵)))
16	15	exbii 1605	. . . 4 ⊢ (∃𝑦(𝐶 = ⟨𝑥, 𝑦⟩ ∧ 𝐶 ∈ ∪ 𝑥 ∈ 𝐴 ({𝑥} × 𝐵)) ↔ ∃𝑦(𝐶 = ⟨𝑥, 𝑦⟩ ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵)))
17	11, 16	bitr3i 186	. . 3 ⊢ ((∃𝑦 𝐶 = ⟨𝑥, 𝑦⟩ ∧ 𝐶 ∈ ∪ 𝑥 ∈ 𝐴 ({𝑥} × 𝐵)) ↔ ∃𝑦(𝐶 = ⟨𝑥, 𝑦⟩ ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵)))
18	17	exbii 1605	. 2 ⊢ (∃𝑥(∃𝑦 𝐶 = ⟨𝑥, 𝑦⟩ ∧ 𝐶 ∈ ∪ 𝑥 ∈ 𝐴 ({𝑥} × 𝐵)) ↔ ∃𝑥∃𝑦(𝐶 = ⟨𝑥, 𝑦⟩ ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵)))
19	7, 10, 18	3bitr2i 208	1 ⊢ (𝐶 ∈ ∪ 𝑥 ∈ 𝐴 ({𝑥} × 𝐵) ↔ ∃𝑥∃𝑦(𝐶 = ⟨𝑥, 𝑦⟩ ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵)))

Syntax hints:   ∧ wa 104   ↔ wb 105   = wceq 1353  ∃wex 1492   ∈ wcel 2148  ∀wral 2455  {csn 3592  ⟨cop 3595  ∪ ciun 3886   × cxp 4624  Rel wrel 4631

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 709  ax-5 1447  ax-7 1448  ax-gen 1449  ax-ie1 1493  ax-ie2 1494  ax-8 1504  ax-10 1505  ax-11 1506  ax-i12 1507  ax-bndl 1509  ax-4 1510  ax-17 1526  ax-i9 1530  ax-ial 1534  ax-i5r 1535  ax-14 2151  ax-ext 2159  ax-sep 4121  ax-pow 4174  ax-pr 4209

This theorem depends on definitions:  df-bi 117  df-3an 980  df-tru 1356  df-nf 1461  df-sb 1763  df-clab 2164  df-cleq 2170  df-clel 2173  df-nfc 2308  df-ral 2460  df-rex 2461  df-v 2739  df-sbc 2963  df-csb 3058  df-un 3133  df-in 3135  df-ss 3142  df-pw 3577  df-sn 3598  df-pr 3599  df-op 3601  df-iun 3888  df-opab 4065  df-xp 4632  df-rel 4633

This theorem is referenced by:  raliunxp  4768  rexiunxp  4769  dfmpt3  5338  mpomptx  5965  fisumcom2  11441  fprodcom2fi  11629