Theorem opeliun2xp 5706

Description: Membership of an ordered pair in a union of Cartesian products over its second component, analogous to opeliunxp 5705. (Contributed by AV, 30-Mar-2019.)

Assertion

Ref	Expression
opeliun2xp	⊢ (⟨𝐶, 𝑦⟩ ∈ ∪ 𝑦 ∈ 𝐵 (𝐴 × {𝑦}) ↔ (𝑦 ∈ 𝐵 ∧ 𝐶 ∈ 𝐴))

Proof of Theorem opeliun2xp

Dummy variables 𝑥 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		df-iun 4957	. . 3 ⊢ ∪ 𝑦 ∈ 𝐵 (𝐴 × {𝑦}) = {𝑥 ∣ ∃𝑦 ∈ 𝐵 𝑥 ∈ (𝐴 × {𝑦})}
2	1	eleq2i 2820	. 2 ⊢ (⟨𝐶, 𝑦⟩ ∈ ∪ 𝑦 ∈ 𝐵 (𝐴 × {𝑦}) ↔ ⟨𝐶, 𝑦⟩ ∈ {𝑥 ∣ ∃𝑦 ∈ 𝐵 𝑥 ∈ (𝐴 × {𝑦})})
3		opex 5424	. . 3 ⊢ ⟨𝐶, 𝑦⟩ ∈ V
4		df-rex 3054	. . . . 5 ⊢ (∃𝑦 ∈ 𝐵 𝑥 ∈ (𝐴 × {𝑦}) ↔ ∃𝑦(𝑦 ∈ 𝐵 ∧ 𝑥 ∈ (𝐴 × {𝑦})))
5		nfv 1914	. . . . . 6 ⊢ Ⅎ𝑧(𝑦 ∈ 𝐵 ∧ 𝑥 ∈ (𝐴 × {𝑦}))
6		nfs1v 2157	. . . . . . 7 ⊢ Ⅎ𝑦[𝑧 / 𝑦]𝑦 ∈ 𝐵
7		nfcsb1v 3886	. . . . . . . . 9 ⊢ Ⅎ𝑦⦋𝑧 / 𝑦⦌𝐴
8		nfcv 2891	. . . . . . . . 9 ⊢ Ⅎ𝑦{𝑧}
9	7, 8	nfxp 5671	. . . . . . . 8 ⊢ Ⅎ𝑦(⦋𝑧 / 𝑦⦌𝐴 × {𝑧})
10	9	nfcri 2883	. . . . . . 7 ⊢ Ⅎ𝑦 𝑥 ∈ (⦋𝑧 / 𝑦⦌𝐴 × {𝑧})
11	6, 10	nfan 1899	. . . . . 6 ⊢ Ⅎ𝑦([𝑧 / 𝑦]𝑦 ∈ 𝐵 ∧ 𝑥 ∈ (⦋𝑧 / 𝑦⦌𝐴 × {𝑧}))
12		sbequ12 2252	. . . . . . 7 ⊢ (𝑦 = 𝑧 → (𝑦 ∈ 𝐵 ↔ [𝑧 / 𝑦]𝑦 ∈ 𝐵))
13		csbeq1a 3876	. . . . . . . . 9 ⊢ (𝑦 = 𝑧 → 𝐴 = ⦋𝑧 / 𝑦⦌𝐴)
14		sneq 4599	. . . . . . . . 9 ⊢ (𝑦 = 𝑧 → {𝑦} = {𝑧})
15	13, 14	xpeq12d 5669	. . . . . . . 8 ⊢ (𝑦 = 𝑧 → (𝐴 × {𝑦}) = (⦋𝑧 / 𝑦⦌𝐴 × {𝑧}))
16	15	eleq2d 2814	. . . . . . 7 ⊢ (𝑦 = 𝑧 → (𝑥 ∈ (𝐴 × {𝑦}) ↔ 𝑥 ∈ (⦋𝑧 / 𝑦⦌𝐴 × {𝑧})))
17	12, 16	anbi12d 632	. . . . . 6 ⊢ (𝑦 = 𝑧 → ((𝑦 ∈ 𝐵 ∧ 𝑥 ∈ (𝐴 × {𝑦})) ↔ ([𝑧 / 𝑦]𝑦 ∈ 𝐵 ∧ 𝑥 ∈ (⦋𝑧 / 𝑦⦌𝐴 × {𝑧}))))
18	5, 11, 17	cbvexv1 2340	. . . . 5 ⊢ (∃𝑦(𝑦 ∈ 𝐵 ∧ 𝑥 ∈ (𝐴 × {𝑦})) ↔ ∃𝑧([𝑧 / 𝑦]𝑦 ∈ 𝐵 ∧ 𝑥 ∈ (⦋𝑧 / 𝑦⦌𝐴 × {𝑧})))
19	4, 18	bitri 275	. . . 4 ⊢ (∃𝑦 ∈ 𝐵 𝑥 ∈ (𝐴 × {𝑦}) ↔ ∃𝑧([𝑧 / 𝑦]𝑦 ∈ 𝐵 ∧ 𝑥 ∈ (⦋𝑧 / 𝑦⦌𝐴 × {𝑧})))
20		eleq1 2816	. . . . . 6 ⊢ (𝑥 = ⟨𝐶, 𝑦⟩ → (𝑥 ∈ (⦋𝑧 / 𝑦⦌𝐴 × {𝑧}) ↔ ⟨𝐶, 𝑦⟩ ∈ (⦋𝑧 / 𝑦⦌𝐴 × {𝑧})))
21	20	anbi2d 630	. . . . 5 ⊢ (𝑥 = ⟨𝐶, 𝑦⟩ → (([𝑧 / 𝑦]𝑦 ∈ 𝐵 ∧ 𝑥 ∈ (⦋𝑧 / 𝑦⦌𝐴 × {𝑧})) ↔ ([𝑧 / 𝑦]𝑦 ∈ 𝐵 ∧ ⟨𝐶, 𝑦⟩ ∈ (⦋𝑧 / 𝑦⦌𝐴 × {𝑧}))))
22	21	exbidv 1921	. . . 4 ⊢ (𝑥 = ⟨𝐶, 𝑦⟩ → (∃𝑧([𝑧 / 𝑦]𝑦 ∈ 𝐵 ∧ 𝑥 ∈ (⦋𝑧 / 𝑦⦌𝐴 × {𝑧})) ↔ ∃𝑧([𝑧 / 𝑦]𝑦 ∈ 𝐵 ∧ ⟨𝐶, 𝑦⟩ ∈ (⦋𝑧 / 𝑦⦌𝐴 × {𝑧}))))
23	19, 22	bitrid 283	. . 3 ⊢ (𝑥 = ⟨𝐶, 𝑦⟩ → (∃𝑦 ∈ 𝐵 𝑥 ∈ (𝐴 × {𝑦}) ↔ ∃𝑧([𝑧 / 𝑦]𝑦 ∈ 𝐵 ∧ ⟨𝐶, 𝑦⟩ ∈ (⦋𝑧 / 𝑦⦌𝐴 × {𝑧}))))
24	3, 23	elab 3646	. 2 ⊢ (⟨𝐶, 𝑦⟩ ∈ {𝑥 ∣ ∃𝑦 ∈ 𝐵 𝑥 ∈ (𝐴 × {𝑦})} ↔ ∃𝑧([𝑧 / 𝑦]𝑦 ∈ 𝐵 ∧ ⟨𝐶, 𝑦⟩ ∈ (⦋𝑧 / 𝑦⦌𝐴 × {𝑧})))
25		opelxp 5674	. . . . . 6 ⊢ (⟨𝐶, 𝑦⟩ ∈ (⦋𝑧 / 𝑦⦌𝐴 × {𝑧}) ↔ (𝐶 ∈ ⦋𝑧 / 𝑦⦌𝐴 ∧ 𝑦 ∈ {𝑧}))
26	25	anbi2i 623	. . . . 5 ⊢ (([𝑧 / 𝑦]𝑦 ∈ 𝐵 ∧ ⟨𝐶, 𝑦⟩ ∈ (⦋𝑧 / 𝑦⦌𝐴 × {𝑧})) ↔ ([𝑧 / 𝑦]𝑦 ∈ 𝐵 ∧ (𝐶 ∈ ⦋𝑧 / 𝑦⦌𝐴 ∧ 𝑦 ∈ {𝑧})))
27		an13 647	. . . . . 6 ⊢ (([𝑧 / 𝑦]𝑦 ∈ 𝐵 ∧ (𝐶 ∈ ⦋𝑧 / 𝑦⦌𝐴 ∧ 𝑦 ∈ {𝑧})) ↔ (𝑦 ∈ {𝑧} ∧ (𝐶 ∈ ⦋𝑧 / 𝑦⦌𝐴 ∧ [𝑧 / 𝑦]𝑦 ∈ 𝐵)))
28		ancom 460	. . . . . . 7 ⊢ ((𝐶 ∈ ⦋𝑧 / 𝑦⦌𝐴 ∧ [𝑧 / 𝑦]𝑦 ∈ 𝐵) ↔ ([𝑧 / 𝑦]𝑦 ∈ 𝐵 ∧ 𝐶 ∈ ⦋𝑧 / 𝑦⦌𝐴))
29	28	anbi2i 623	. . . . . 6 ⊢ ((𝑦 ∈ {𝑧} ∧ (𝐶 ∈ ⦋𝑧 / 𝑦⦌𝐴 ∧ [𝑧 / 𝑦]𝑦 ∈ 𝐵)) ↔ (𝑦 ∈ {𝑧} ∧ ([𝑧 / 𝑦]𝑦 ∈ 𝐵 ∧ 𝐶 ∈ ⦋𝑧 / 𝑦⦌𝐴)))
30	27, 29	bitri 275	. . . . 5 ⊢ (([𝑧 / 𝑦]𝑦 ∈ 𝐵 ∧ (𝐶 ∈ ⦋𝑧 / 𝑦⦌𝐴 ∧ 𝑦 ∈ {𝑧})) ↔ (𝑦 ∈ {𝑧} ∧ ([𝑧 / 𝑦]𝑦 ∈ 𝐵 ∧ 𝐶 ∈ ⦋𝑧 / 𝑦⦌𝐴)))
31		velsn 4605	. . . . . . 7 ⊢ (𝑦 ∈ {𝑧} ↔ 𝑦 = 𝑧)
32		equcom 2018	. . . . . . 7 ⊢ (𝑦 = 𝑧 ↔ 𝑧 = 𝑦)
33	31, 32	bitri 275	. . . . . 6 ⊢ (𝑦 ∈ {𝑧} ↔ 𝑧 = 𝑦)
34	33	anbi1i 624	. . . . 5 ⊢ ((𝑦 ∈ {𝑧} ∧ ([𝑧 / 𝑦]𝑦 ∈ 𝐵 ∧ 𝐶 ∈ ⦋𝑧 / 𝑦⦌𝐴)) ↔ (𝑧 = 𝑦 ∧ ([𝑧 / 𝑦]𝑦 ∈ 𝐵 ∧ 𝐶 ∈ ⦋𝑧 / 𝑦⦌𝐴)))
35	26, 30, 34	3bitri 297	. . . 4 ⊢ (([𝑧 / 𝑦]𝑦 ∈ 𝐵 ∧ ⟨𝐶, 𝑦⟩ ∈ (⦋𝑧 / 𝑦⦌𝐴 × {𝑧})) ↔ (𝑧 = 𝑦 ∧ ([𝑧 / 𝑦]𝑦 ∈ 𝐵 ∧ 𝐶 ∈ ⦋𝑧 / 𝑦⦌𝐴)))
36	35	exbii 1848	. . 3 ⊢ (∃𝑧([𝑧 / 𝑦]𝑦 ∈ 𝐵 ∧ ⟨𝐶, 𝑦⟩ ∈ (⦋𝑧 / 𝑦⦌𝐴 × {𝑧})) ↔ ∃𝑧(𝑧 = 𝑦 ∧ ([𝑧 / 𝑦]𝑦 ∈ 𝐵 ∧ 𝐶 ∈ ⦋𝑧 / 𝑦⦌𝐴)))
37		sbequ12r 2253	. . . . 5 ⊢ (𝑧 = 𝑦 → ([𝑧 / 𝑦]𝑦 ∈ 𝐵 ↔ 𝑦 ∈ 𝐵))
38	13	equcoms 2020	. . . . . . 7 ⊢ (𝑧 = 𝑦 → 𝐴 = ⦋𝑧 / 𝑦⦌𝐴)
39	38	eqcomd 2735	. . . . . 6 ⊢ (𝑧 = 𝑦 → ⦋𝑧 / 𝑦⦌𝐴 = 𝐴)
40	39	eleq2d 2814	. . . . 5 ⊢ (𝑧 = 𝑦 → (𝐶 ∈ ⦋𝑧 / 𝑦⦌𝐴 ↔ 𝐶 ∈ 𝐴))
41	37, 40	anbi12d 632	. . . 4 ⊢ (𝑧 = 𝑦 → (([𝑧 / 𝑦]𝑦 ∈ 𝐵 ∧ 𝐶 ∈ ⦋𝑧 / 𝑦⦌𝐴) ↔ (𝑦 ∈ 𝐵 ∧ 𝐶 ∈ 𝐴)))
42	41	equsexvw 2005	. . 3 ⊢ (∃𝑧(𝑧 = 𝑦 ∧ ([𝑧 / 𝑦]𝑦 ∈ 𝐵 ∧ 𝐶 ∈ ⦋𝑧 / 𝑦⦌𝐴)) ↔ (𝑦 ∈ 𝐵 ∧ 𝐶 ∈ 𝐴))
43	36, 42	bitri 275	. 2 ⊢ (∃𝑧([𝑧 / 𝑦]𝑦 ∈ 𝐵 ∧ ⟨𝐶, 𝑦⟩ ∈ (⦋𝑧 / 𝑦⦌𝐴 × {𝑧})) ↔ (𝑦 ∈ 𝐵 ∧ 𝐶 ∈ 𝐴))
44	2, 24, 43	3bitri 297	1 ⊢ (⟨𝐶, 𝑦⟩ ∈ ∪ 𝑦 ∈ 𝐵 (𝐴 × {𝑦}) ↔ (𝑦 ∈ 𝐵 ∧ 𝐶 ∈ 𝐴))

Syntax hints:   ↔ wb 206   ∧ wa 395   = wceq 1540  ∃wex 1779  [wsb 2065   ∈ wcel 2109  {cab 2707  ∃wrex 3053  ⦋csb 3862  {csn 4589  ⟨cop 4595  ∪ ciun 4955   × cxp 5636

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2701  ax-sep 5251  ax-nul 5261  ax-pr 5387

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-clab 2708  df-cleq 2721  df-clel 2803  df-nfc 2878  df-ral 3045  df-rex 3054  df-rab 3406  df-v 3449  df-sbc 3754  df-csb 3863  df-dif 3917  df-un 3919  df-ss 3931  df-nul 4297  df-if 4489  df-sn 4590  df-pr 4592  df-op 4596  df-iun 4957  df-opab 5170  df-xp 5644

This theorem is referenced by:  fldextrspunlsplem  33668  eliunxp2  48322