Theorem marypha2lem2 9125

Description: Lemma for marypha2 9128. Properties of the used relation. (Contributed by Stefan O'Rear, 20-Feb-2015.)

Hypothesis

Ref	Expression
marypha2lem.t	⊢ 𝑇 = ∪ 𝑥 ∈ 𝐴 ({𝑥} × (𝐹‘𝑥))

Assertion

Ref	Expression
marypha2lem2	⊢ 𝑇 = {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ (𝐹‘𝑥))}

Distinct variable groups:   𝑥,𝐴,𝑦   𝑥,𝐹,𝑦

Allowed substitution hints:   𝑇(𝑥,𝑦)

Proof of Theorem marypha2lem2

Dummy variable 𝑧 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		marypha2lem.t	. 2 ⊢ 𝑇 = ∪ 𝑥 ∈ 𝐴 ({𝑥} × (𝐹‘𝑥))
2		sneq 4568	. . . 4 ⊢ (𝑥 = 𝑧 → {𝑥} = {𝑧})
3		fveq2 6756	. . . 4 ⊢ (𝑥 = 𝑧 → (𝐹‘𝑥) = (𝐹‘𝑧))
4	2, 3	xpeq12d 5611	. . 3 ⊢ (𝑥 = 𝑧 → ({𝑥} × (𝐹‘𝑥)) = ({𝑧} × (𝐹‘𝑧)))
5	4	cbviunv 4966	. 2 ⊢ ∪ 𝑥 ∈ 𝐴 ({𝑥} × (𝐹‘𝑥)) = ∪ 𝑧 ∈ 𝐴 ({𝑧} × (𝐹‘𝑧))
6		df-xp 5586	. . . . 5 ⊢ ({𝑧} × (𝐹‘𝑧)) = {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ {𝑧} ∧ 𝑦 ∈ (𝐹‘𝑧))}
7	6	a1i 11	. . . 4 ⊢ (𝑧 ∈ 𝐴 → ({𝑧} × (𝐹‘𝑧)) = {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ {𝑧} ∧ 𝑦 ∈ (𝐹‘𝑧))})
8	7	iuneq2i 4942	. . 3 ⊢ ∪ 𝑧 ∈ 𝐴 ({𝑧} × (𝐹‘𝑧)) = ∪ 𝑧 ∈ 𝐴 {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ {𝑧} ∧ 𝑦 ∈ (𝐹‘𝑧))}
9		iunopab 5465	. . 3 ⊢ ∪ 𝑧 ∈ 𝐴 {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ {𝑧} ∧ 𝑦 ∈ (𝐹‘𝑧))} = {⟨𝑥, 𝑦⟩ ∣ ∃𝑧 ∈ 𝐴 (𝑥 ∈ {𝑧} ∧ 𝑦 ∈ (𝐹‘𝑧))}
10		velsn 4574	. . . . . . . 8 ⊢ (𝑥 ∈ {𝑧} ↔ 𝑥 = 𝑧)
11		equcom 2022	. . . . . . . 8 ⊢ (𝑥 = 𝑧 ↔ 𝑧 = 𝑥)
12	10, 11	bitri 274	. . . . . . 7 ⊢ (𝑥 ∈ {𝑧} ↔ 𝑧 = 𝑥)
13	12	anbi1i 623	. . . . . 6 ⊢ ((𝑥 ∈ {𝑧} ∧ 𝑦 ∈ (𝐹‘𝑧)) ↔ (𝑧 = 𝑥 ∧ 𝑦 ∈ (𝐹‘𝑧)))
14	13	rexbii 3177	. . . . 5 ⊢ (∃𝑧 ∈ 𝐴 (𝑥 ∈ {𝑧} ∧ 𝑦 ∈ (𝐹‘𝑧)) ↔ ∃𝑧 ∈ 𝐴 (𝑧 = 𝑥 ∧ 𝑦 ∈ (𝐹‘𝑧)))
15		fveq2 6756	. . . . . . 7 ⊢ (𝑧 = 𝑥 → (𝐹‘𝑧) = (𝐹‘𝑥))
16	15	eleq2d 2824	. . . . . 6 ⊢ (𝑧 = 𝑥 → (𝑦 ∈ (𝐹‘𝑧) ↔ 𝑦 ∈ (𝐹‘𝑥)))
17	16	ceqsrexbv 3579	. . . . 5 ⊢ (∃𝑧 ∈ 𝐴 (𝑧 = 𝑥 ∧ 𝑦 ∈ (𝐹‘𝑧)) ↔ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ (𝐹‘𝑥)))
18	14, 17	bitri 274	. . . 4 ⊢ (∃𝑧 ∈ 𝐴 (𝑥 ∈ {𝑧} ∧ 𝑦 ∈ (𝐹‘𝑧)) ↔ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ (𝐹‘𝑥)))
19	18	opabbii 5137	. . 3 ⊢ {⟨𝑥, 𝑦⟩ ∣ ∃𝑧 ∈ 𝐴 (𝑥 ∈ {𝑧} ∧ 𝑦 ∈ (𝐹‘𝑧))} = {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ (𝐹‘𝑥))}
20	8, 9, 19	3eqtri 2770	. 2 ⊢ ∪ 𝑧 ∈ 𝐴 ({𝑧} × (𝐹‘𝑧)) = {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ (𝐹‘𝑥))}
21	1, 5, 20	3eqtri 2770	1 ⊢ 𝑇 = {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ (𝐹‘𝑥))}

Syntax hints:   ∧ wa 395   = wceq 1539   ∈ wcel 2108  ∃wrex 3064  {csn 4558  ∪ ciun 4921  {copab 5132   × cxp 5578  ‘cfv 6418

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1799  ax-4 1813  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2110  ax-9 2118  ax-11 2156  ax-12 2173  ax-ext 2709  ax-sep 5218  ax-nul 5225  ax-pr 5347

This theorem depends on definitions:  df-bi 206  df-an 396  df-or 844  df-3an 1087  df-tru 1542  df-fal 1552  df-ex 1784  df-nf 1788  df-sb 2069  df-clab 2716  df-cleq 2730  df-clel 2817  df-nfc 2888  df-ral 3068  df-rex 3069  df-rab 3072  df-v 3424  df-dif 3886  df-un 3888  df-in 3890  df-ss 3900  df-nul 4254  df-if 4457  df-sn 4559  df-pr 4561  df-op 4565  df-uni 4837  df-iun 4923  df-br 5071  df-opab 5133  df-xp 5586  df-iota 6376  df-fv 6426

This theorem is referenced by:  marypha2lem3  9126  marypha2lem4  9127  eulerpartlemgu  32244