Theorem marypha2lem2 8899

Description: Lemma for marypha2 8902. 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 4576	. . . 4 ⊢ (𝑥 = 𝑧 → {𝑥} = {𝑧})
3		fveq2 6669	. . . 4 ⊢ (𝑥 = 𝑧 → (𝐹‘𝑥) = (𝐹‘𝑧))
4	2, 3	xpeq12d 5585	. . 3 ⊢ (𝑥 = 𝑧 → ({𝑥} × (𝐹‘𝑥)) = ({𝑧} × (𝐹‘𝑧)))
5	4	cbviunv 4964	. 2 ⊢ ∪ 𝑥 ∈ 𝐴 ({𝑥} × (𝐹‘𝑥)) = ∪ 𝑧 ∈ 𝐴 ({𝑧} × (𝐹‘𝑧))
6		df-xp 5560	. . . . 5 ⊢ ({𝑧} × (𝐹‘𝑧)) = {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ {𝑧} ∧ 𝑦 ∈ (𝐹‘𝑧))}
7	6	a1i 11	. . . 4 ⊢ (𝑧 ∈ 𝐴 → ({𝑧} × (𝐹‘𝑧)) = {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ {𝑧} ∧ 𝑦 ∈ (𝐹‘𝑧))})
8	7	iuneq2i 4939	. . 3 ⊢ ∪ 𝑧 ∈ 𝐴 ({𝑧} × (𝐹‘𝑧)) = ∪ 𝑧 ∈ 𝐴 {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ {𝑧} ∧ 𝑦 ∈ (𝐹‘𝑧))}
9		iunopab 5445	. . 3 ⊢ ∪ 𝑧 ∈ 𝐴 {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ {𝑧} ∧ 𝑦 ∈ (𝐹‘𝑧))} = {⟨𝑥, 𝑦⟩ ∣ ∃𝑧 ∈ 𝐴 (𝑥 ∈ {𝑧} ∧ 𝑦 ∈ (𝐹‘𝑧))}
10		velsn 4582	. . . . . . . 8 ⊢ (𝑥 ∈ {𝑧} ↔ 𝑥 = 𝑧)
11		equcom 2021	. . . . . . . 8 ⊢ (𝑥 = 𝑧 ↔ 𝑧 = 𝑥)
12	10, 11	bitri 277	. . . . . . 7 ⊢ (𝑥 ∈ {𝑧} ↔ 𝑧 = 𝑥)
13	12	anbi1i 625	. . . . . 6 ⊢ ((𝑥 ∈ {𝑧} ∧ 𝑦 ∈ (𝐹‘𝑧)) ↔ (𝑧 = 𝑥 ∧ 𝑦 ∈ (𝐹‘𝑧)))
14	13	rexbii 3247	. . . . 5 ⊢ (∃𝑧 ∈ 𝐴 (𝑥 ∈ {𝑧} ∧ 𝑦 ∈ (𝐹‘𝑧)) ↔ ∃𝑧 ∈ 𝐴 (𝑧 = 𝑥 ∧ 𝑦 ∈ (𝐹‘𝑧)))
15		fveq2 6669	. . . . . . 7 ⊢ (𝑧 = 𝑥 → (𝐹‘𝑧) = (𝐹‘𝑥))
16	15	eleq2d 2898	. . . . . 6 ⊢ (𝑧 = 𝑥 → (𝑦 ∈ (𝐹‘𝑧) ↔ 𝑦 ∈ (𝐹‘𝑥)))
17	16	ceqsrexbv 3649	. . . . 5 ⊢ (∃𝑧 ∈ 𝐴 (𝑧 = 𝑥 ∧ 𝑦 ∈ (𝐹‘𝑧)) ↔ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ (𝐹‘𝑥)))
18	14, 17	bitri 277	. . . 4 ⊢ (∃𝑧 ∈ 𝐴 (𝑥 ∈ {𝑧} ∧ 𝑦 ∈ (𝐹‘𝑧)) ↔ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ (𝐹‘𝑥)))
19	18	opabbii 5132	. . 3 ⊢ {⟨𝑥, 𝑦⟩ ∣ ∃𝑧 ∈ 𝐴 (𝑥 ∈ {𝑧} ∧ 𝑦 ∈ (𝐹‘𝑧))} = {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ (𝐹‘𝑥))}
20	8, 9, 19	3eqtri 2848	. 2 ⊢ ∪ 𝑧 ∈ 𝐴 ({𝑧} × (𝐹‘𝑧)) = {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ (𝐹‘𝑥))}
21	1, 5, 20	3eqtri 2848	1 ⊢ 𝑇 = {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ (𝐹‘𝑥))}

Syntax hints:   ∧ wa 398   = wceq 1533   ∈ wcel 2110  ∃wrex 3139  {csn 4566  ∪ ciun 4918  {copab 5127   × cxp 5552  ‘cfv 6354

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1792  ax-4 1806  ax-5 1907  ax-6 1966  ax-7 2011  ax-8 2112  ax-9 2120  ax-10 2141  ax-11 2157  ax-12 2173  ax-ext 2793  ax-sep 5202  ax-nul 5209  ax-pr 5329

This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3an 1085  df-tru 1536  df-ex 1777  df-nf 1781  df-sb 2066  df-clab 2800  df-cleq 2814  df-clel 2893  df-nfc 2963  df-ral 3143  df-rex 3144  df-rab 3147  df-v 3496  df-dif 3938  df-un 3940  df-in 3942  df-ss 3951  df-nul 4291  df-if 4467  df-sn 4567  df-pr 4569  df-op 4573  df-uni 4838  df-iun 4920  df-br 5066  df-opab 5128  df-xp 5560  df-iota 6313  df-fv 6362

This theorem is referenced by:  marypha2lem3  8900  marypha2lem4  8901  eulerpartlemgu  31635