Theorem marypha2lem2 9392

Description: Lemma for marypha2 9395. 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 4599	. . . 4 ⊢ (𝑥 = 𝑧 → {𝑥} = {𝑧})
3		fveq2 6881	. . . 4 ⊢ (𝑥 = 𝑧 → (𝐹‘𝑥) = (𝐹‘𝑧))
4	2, 3	xpeq12d 5692	. . 3 ⊢ (𝑥 = 𝑧 → ({𝑥} × (𝐹‘𝑥)) = ({𝑧} × (𝐹‘𝑧)))
5	4	cbviunv 5003	. 2 ⊢ ∪ 𝑥 ∈ 𝐴 ({𝑥} × (𝐹‘𝑥)) = ∪ 𝑧 ∈ 𝐴 ({𝑧} × (𝐹‘𝑧))
6		df-xp 5667	. . . . 5 ⊢ ({𝑧} × (𝐹‘𝑧)) = {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ {𝑧} ∧ 𝑦 ∈ (𝐹‘𝑧))}
7	6	a1i 11	. . . 4 ⊢ (𝑧 ∈ 𝐴 → ({𝑧} × (𝐹‘𝑧)) = {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ {𝑧} ∧ 𝑦 ∈ (𝐹‘𝑧))})
8	7	iuneq2i 4978	. . 3 ⊢ ∪ 𝑧 ∈ 𝐴 ({𝑧} × (𝐹‘𝑧)) = ∪ 𝑧 ∈ 𝐴 {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ {𝑧} ∧ 𝑦 ∈ (𝐹‘𝑧))}
9		iunopab 5544	. . 3 ⊢ ∪ 𝑧 ∈ 𝐴 {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ {𝑧} ∧ 𝑦 ∈ (𝐹‘𝑧))} = {⟨𝑥, 𝑦⟩ ∣ ∃𝑧 ∈ 𝐴 (𝑥 ∈ {𝑧} ∧ 𝑦 ∈ (𝐹‘𝑧))}
10		velsn 4605	. . . . . . . 8 ⊢ (𝑥 ∈ {𝑧} ↔ 𝑥 = 𝑧)
11		equcom 2048	. . . . . . . 8 ⊢ (𝑥 = 𝑧 ↔ 𝑧 = 𝑥)
12	10, 11	bitri 278	. . . . . . 7 ⊢ (𝑥 ∈ {𝑧} ↔ 𝑧 = 𝑥)
13	12	anbi1i 635	. . . . . 6 ⊢ ((𝑥 ∈ {𝑧} ∧ 𝑦 ∈ (𝐹‘𝑧)) ↔ (𝑧 = 𝑥 ∧ 𝑦 ∈ (𝐹‘𝑧)))
14	13	rexbii 3112	. . . . 5 ⊢ (∃𝑧 ∈ 𝐴 (𝑥 ∈ {𝑧} ∧ 𝑦 ∈ (𝐹‘𝑧)) ↔ ∃𝑧 ∈ 𝐴 (𝑧 = 𝑥 ∧ 𝑦 ∈ (𝐹‘𝑧)))
15		fveq2 6881	. . . . . . 7 ⊢ (𝑧 = 𝑥 → (𝐹‘𝑧) = (𝐹‘𝑥))
16	15	eleq2d 2849	. . . . . 6 ⊢ (𝑧 = 𝑥 → (𝑦 ∈ (𝐹‘𝑧) ↔ 𝑦 ∈ (𝐹‘𝑥)))
17	16	ceqsrexbv 3615	. . . . 5 ⊢ (∃𝑧 ∈ 𝐴 (𝑧 = 𝑥 ∧ 𝑦 ∈ (𝐹‘𝑧)) ↔ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ (𝐹‘𝑥)))
18	14, 17	bitri 278	. . . 4 ⊢ (∃𝑧 ∈ 𝐴 (𝑥 ∈ {𝑧} ∧ 𝑦 ∈ (𝐹‘𝑧)) ↔ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ (𝐹‘𝑥)))
19	18	opabbii 5178	. . 3 ⊢ {⟨𝑥, 𝑦⟩ ∣ ∃𝑧 ∈ 𝐴 (𝑥 ∈ {𝑧} ∧ 𝑦 ∈ (𝐹‘𝑧))} = {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ (𝐹‘𝑥))}
20	8, 9, 19	3eqtri 2790	. 2 ⊢ ∪ 𝑧 ∈ 𝐴 ({𝑧} × (𝐹‘𝑧)) = {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ (𝐹‘𝑥))}
21	1, 5, 20	3eqtri 2790	1 ⊢ 𝑇 = {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ (𝐹‘𝑥))}

Syntax hints:   ∧ wa 400   = wceq 1570   ∈ wcel 2143  ∃wrex 3089  {csn 4589  ∪ ciun 4956  {copab 5173   × cxp 5659  ‘cfv 6536

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-11 2192  ax-ext 2735

This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1810  df-sb 2097  df-clab 2742  df-cleq 2755  df-clel 2838  df-ral 3080  df-rex 3090  df-rab 3417  df-v 3457  df-dif 3908  df-un 3910  df-ss 3922  df-nul 4287  df-if 4488  df-sn 4590  df-pr 4592  df-op 4596  df-uni 4873  df-iun 4958  df-br 5110  df-opab 5174  df-xp 5667  df-iota 6492  df-fv 6544

This theorem is referenced by:  marypha2lem3  9393  marypha2lem4  9394  eulerpartlemgu  34767