fparlem3 - Metamath Proof Explorer

	Metamath Proof Explorer		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > fparlem3		Structured version Visualization version GIF version

Theorem fparlem3 8046

Description: Lemma for fpar 8048. (Contributed by NM, 22-Dec-2008.) (Revised by Mario Carneiro, 28-Apr-2015.)

**Assertion**
Ref	Expression
fparlem3	⊢ (𝐹 Fn 𝐴 → (^◡(1^st ↾ (V × V)) ∘ (𝐹 ∘ (1^st ↾ (V × V)))) = ∪ 𝑥 ∈ 𝐴 (({𝑥} × V) × ({(𝐹‘𝑥)} × V)))

Distinct variable groups: 𝑥,𝐴 𝑥,𝐹

Proof of Theorem fparlem3 Dummy variable 𝑦 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		coiun 6208	. 2 ⊢ (^◡(1^st ↾ (V × V)) ∘ ∪ 𝑥 ∈ 𝐴 ((^◡(1^st ↾ (V × V)) “ {𝑥}) × (𝐹 “ {𝑥}))) = ∪ 𝑥 ∈ 𝐴 (^◡(1^st ↾ (V × V)) ∘ ((^◡(1^st ↾ (V × V)) “ {𝑥}) × (𝐹 “ {𝑥})))
2		inss1 4188	. . . . 5 ⊢ (dom 𝐹 ∩ ran (1^st ↾ (V × V))) ⊆ dom 𝐹
3		fndm 6605	. . . . 5 ⊢ (𝐹 Fn 𝐴 → dom 𝐹 = 𝐴)
4	2, 3	sseqtrid 3996	. . . 4 ⊢ (𝐹 Fn 𝐴 → (dom 𝐹 ∩ ran (1^st ↾ (V × V))) ⊆ 𝐴)
5		dfco2a 6198	. . . 4 ⊢ ((dom 𝐹 ∩ ran (1^st ↾ (V × V))) ⊆ 𝐴 → (𝐹 ∘ (1^st ↾ (V × V))) = ∪ 𝑥 ∈ 𝐴 ((^◡(1^st ↾ (V × V)) “ {𝑥}) × (𝐹 “ {𝑥})))
6	4, 5	syl 17	. . 3 ⊢ (𝐹 Fn 𝐴 → (𝐹 ∘ (1^st ↾ (V × V))) = ∪ 𝑥 ∈ 𝐴 ((^◡(1^st ↾ (V × V)) “ {𝑥}) × (𝐹 “ {𝑥})))
7	6	coeq2d 5818	. 2 ⊢ (𝐹 Fn 𝐴 → (^◡(1^st ↾ (V × V)) ∘ (𝐹 ∘ (1^st ↾ (V × V)))) = (^◡(1^st ↾ (V × V)) ∘ ∪ 𝑥 ∈ 𝐴 ((^◡(1^st ↾ (V × V)) “ {𝑥}) × (𝐹 “ {𝑥}))))
8		inss1 4188	. . . . . . . . 9 ⊢ (dom ({(𝐹‘𝑥)} × ({𝑥} × V)) ∩ ran (1^st ↾ (V × V))) ⊆ dom ({(𝐹‘𝑥)} × ({𝑥} × V))
9		dmxpss 6123	. . . . . . . . 9 ⊢ dom ({(𝐹‘𝑥)} × ({𝑥} × V)) ⊆ {(𝐹‘𝑥)}
10	8, 9	sstri 3953	. . . . . . . 8 ⊢ (dom ({(𝐹‘𝑥)} × ({𝑥} × V)) ∩ ran (1^st ↾ (V × V))) ⊆ {(𝐹‘𝑥)}
11		dfco2a 6198	. . . . . . . 8 ⊢ ((dom ({(𝐹‘𝑥)} × ({𝑥} × V)) ∩ ran (1^st ↾ (V × V))) ⊆ {(𝐹‘𝑥)} → (({(𝐹‘𝑥)} × ({𝑥} × V)) ∘ (1^st ↾ (V × V))) = ∪ 𝑦 ∈ {(𝐹‘𝑥)} ((^◡(1^st ↾ (V × V)) “ {𝑦}) × (({(𝐹‘𝑥)} × ({𝑥} × V)) “ {𝑦})))
12	10, 11	ax-mp 5	. . . . . . 7 ⊢ (({(𝐹‘𝑥)} × ({𝑥} × V)) ∘ (1^st ↾ (V × V))) = ∪ 𝑦 ∈ {(𝐹‘𝑥)} ((^◡(1^st ↾ (V × V)) “ {𝑦}) × (({(𝐹‘𝑥)} × ({𝑥} × V)) “ {𝑦}))
13		fvex 6855	. . . . . . . 8 ⊢ (𝐹‘𝑥) ∈ V
14		fparlem1 8044	. . . . . . . . . 10 ⊢ (^◡(1^st ↾ (V × V)) “ {𝑦}) = ({𝑦} × V)
15		sneq 4596	. . . . . . . . . . 11 ⊢ (𝑦 = (𝐹‘𝑥) → {𝑦} = {(𝐹‘𝑥)})
16	15	xpeq1d 5662	. . . . . . . . . 10 ⊢ (𝑦 = (𝐹‘𝑥) → ({𝑦} × V) = ({(𝐹‘𝑥)} × V))
17	14, 16	eqtrid 2788	. . . . . . . . 9 ⊢ (𝑦 = (𝐹‘𝑥) → (^◡(1^st ↾ (V × V)) “ {𝑦}) = ({(𝐹‘𝑥)} × V))
18	15	imaeq2d 6013	. . . . . . . . . 10 ⊢ (𝑦 = (𝐹‘𝑥) → (({(𝐹‘𝑥)} × ({𝑥} × V)) “ {𝑦}) = (({(𝐹‘𝑥)} × ({𝑥} × V)) “ {(𝐹‘𝑥)}))
19		df-ima 5646	. . . . . . . . . . 11 ⊢ (({(𝐹‘𝑥)} × ({𝑥} × V)) “ {(𝐹‘𝑥)}) = ran (({(𝐹‘𝑥)} × ({𝑥} × V)) ↾ {(𝐹‘𝑥)})
20		ssid 3966	. . . . . . . . . . . . . 14 ⊢ {(𝐹‘𝑥)} ⊆ {(𝐹‘𝑥)}
21		xpssres 5974	. . . . . . . . . . . . . 14 ⊢ ({(𝐹‘𝑥)} ⊆ {(𝐹‘𝑥)} → (({(𝐹‘𝑥)} × ({𝑥} × V)) ↾ {(𝐹‘𝑥)}) = ({(𝐹‘𝑥)} × ({𝑥} × V)))
22	20, 21	ax-mp 5	. . . . . . . . . . . . 13 ⊢ (({(𝐹‘𝑥)} × ({𝑥} × V)) ↾ {(𝐹‘𝑥)}) = ({(𝐹‘𝑥)} × ({𝑥} × V))
23	22	rneqi 5892	. . . . . . . . . . . 12 ⊢ ran (({(𝐹‘𝑥)} × ({𝑥} × V)) ↾ {(𝐹‘𝑥)}) = ran ({(𝐹‘𝑥)} × ({𝑥} × V))
24	13	snnz 4737	. . . . . . . . . . . . 13 ⊢ {(𝐹‘𝑥)} ≠ ∅
25		rnxp 6122	. . . . . . . . . . . . 13 ⊢ ({(𝐹‘𝑥)} ≠ ∅ → ran ({(𝐹‘𝑥)} × ({𝑥} × V)) = ({𝑥} × V))
26	24, 25	ax-mp 5	. . . . . . . . . . . 12 ⊢ ran ({(𝐹‘𝑥)} × ({𝑥} × V)) = ({𝑥} × V)
27	23, 26	eqtri 2764	. . . . . . . . . . 11 ⊢ ran (({(𝐹‘𝑥)} × ({𝑥} × V)) ↾ {(𝐹‘𝑥)}) = ({𝑥} × V)
28	19, 27	eqtri 2764	. . . . . . . . . 10 ⊢ (({(𝐹‘𝑥)} × ({𝑥} × V)) “ {(𝐹‘𝑥)}) = ({𝑥} × V)
29	18, 28	eqtrdi 2792	. . . . . . . . 9 ⊢ (𝑦 = (𝐹‘𝑥) → (({(𝐹‘𝑥)} × ({𝑥} × V)) “ {𝑦}) = ({𝑥} × V))
30	17, 29	xpeq12d 5664	. . . . . . . 8 ⊢ (𝑦 = (𝐹‘𝑥) → ((^◡(1^st ↾ (V × V)) “ {𝑦}) × (({(𝐹‘𝑥)} × ({𝑥} × V)) “ {𝑦})) = (({(𝐹‘𝑥)} × V) × ({𝑥} × V)))
31	13, 30	iunxsn 5051	. . . . . . 7 ⊢ ∪ 𝑦 ∈ {(𝐹‘𝑥)} ((^◡(1^st ↾ (V × V)) “ {𝑦}) × (({(𝐹‘𝑥)} × ({𝑥} × V)) “ {𝑦})) = (({(𝐹‘𝑥)} × V) × ({𝑥} × V))
32	12, 31	eqtri 2764	. . . . . 6 ⊢ (({(𝐹‘𝑥)} × ({𝑥} × V)) ∘ (1^st ↾ (V × V))) = (({(𝐹‘𝑥)} × V) × ({𝑥} × V))
33	32	cnveqi 5830	. . . . 5 ⊢ ^◡(({(𝐹‘𝑥)} × ({𝑥} × V)) ∘ (1^st ↾ (V × V))) = ^◡(({(𝐹‘𝑥)} × V) × ({𝑥} × V))
34		cnvco 5841	. . . . 5 ⊢ ^◡(({(𝐹‘𝑥)} × ({𝑥} × V)) ∘ (1^st ↾ (V × V))) = (^◡(1^st ↾ (V × V)) ∘ ^◡({(𝐹‘𝑥)} × ({𝑥} × V)))
35		cnvxp 6109	. . . . 5 ⊢ ^◡(({(𝐹‘𝑥)} × V) × ({𝑥} × V)) = (({𝑥} × V) × ({(𝐹‘𝑥)} × V))
36	33, 34, 35	3eqtr3i 2772	. . . 4 ⊢ (^◡(1^st ↾ (V × V)) ∘ ^◡({(𝐹‘𝑥)} × ({𝑥} × V))) = (({𝑥} × V) × ({(𝐹‘𝑥)} × V))
37		fparlem1 8044	. . . . . . . . 9 ⊢ (^◡(1^st ↾ (V × V)) “ {𝑥}) = ({𝑥} × V)
38	37	xpeq2i 5660	. . . . . . . 8 ⊢ ({(𝐹‘𝑥)} × (^◡(1^st ↾ (V × V)) “ {𝑥})) = ({(𝐹‘𝑥)} × ({𝑥} × V))
39		fnsnfv 6920	. . . . . . . . 9 ⊢ ((𝐹 Fn 𝐴 ∧ 𝑥 ∈ 𝐴) → {(𝐹‘𝑥)} = (𝐹 “ {𝑥}))
40	39	xpeq1d 5662	. . . . . . . 8 ⊢ ((𝐹 Fn 𝐴 ∧ 𝑥 ∈ 𝐴) → ({(𝐹‘𝑥)} × (^◡(1^st ↾ (V × V)) “ {𝑥})) = ((𝐹 “ {𝑥}) × (^◡(1^st ↾ (V × V)) “ {𝑥})))
41	38, 40	eqtr3id 2790	. . . . . . 7 ⊢ ((𝐹 Fn 𝐴 ∧ 𝑥 ∈ 𝐴) → ({(𝐹‘𝑥)} × ({𝑥} × V)) = ((𝐹 “ {𝑥}) × (^◡(1^st ↾ (V × V)) “ {𝑥})))
42	41	cnveqd 5831	. . . . . 6 ⊢ ((𝐹 Fn 𝐴 ∧ 𝑥 ∈ 𝐴) → ^◡({(𝐹‘𝑥)} × ({𝑥} × V)) = ^◡((𝐹 “ {𝑥}) × (^◡(1^st ↾ (V × V)) “ {𝑥})))
43		cnvxp 6109	. . . . . 6 ⊢ ^◡((𝐹 “ {𝑥}) × (^◡(1^st ↾ (V × V)) “ {𝑥})) = ((^◡(1^st ↾ (V × V)) “ {𝑥}) × (𝐹 “ {𝑥}))
44	42, 43	eqtrdi 2792	. . . . 5 ⊢ ((𝐹 Fn 𝐴 ∧ 𝑥 ∈ 𝐴) → ^◡({(𝐹‘𝑥)} × ({𝑥} × V)) = ((^◡(1^st ↾ (V × V)) “ {𝑥}) × (𝐹 “ {𝑥})))
45	44	coeq2d 5818	. . . 4 ⊢ ((𝐹 Fn 𝐴 ∧ 𝑥 ∈ 𝐴) → (^◡(1^st ↾ (V × V)) ∘ ^◡({(𝐹‘𝑥)} × ({𝑥} × V))) = (^◡(1^st ↾ (V × V)) ∘ ((^◡(1^st ↾ (V × V)) “ {𝑥}) × (𝐹 “ {𝑥}))))
46	36, 45	eqtr3id 2790	. . 3 ⊢ ((𝐹 Fn 𝐴 ∧ 𝑥 ∈ 𝐴) → (({𝑥} × V) × ({(𝐹‘𝑥)} × V)) = (^◡(1^st ↾ (V × V)) ∘ ((^◡(1^st ↾ (V × V)) “ {𝑥}) × (𝐹 “ {𝑥}))))
47	46	iuneq2dv 4978	. 2 ⊢ (𝐹 Fn 𝐴 → ∪ 𝑥 ∈ 𝐴 (({𝑥} × V) × ({(𝐹‘𝑥)} × V)) = ∪ 𝑥 ∈ 𝐴 (^◡(1^st ↾ (V × V)) ∘ ((^◡(1^st ↾ (V × V)) “ {𝑥}) × (𝐹 “ {𝑥}))))
48	1, 7, 47	3eqtr4a 2802	1 ⊢ (𝐹 Fn 𝐴 → (^◡(1^st ↾ (V × V)) ∘ (𝐹 ∘ (1^st ↾ (V × V)))) = ∪ 𝑥 ∈ 𝐴 (({𝑥} × V) × ({(𝐹‘𝑥)} × V)))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 396 = wceq 1541 ∈ wcel 2106 ≠ wne 2943 Vcvv 3445 ∩ cin 3909 ⊆ wss 3910 ∅c0 4282 {csn 4586 ∪ ciun 4954 × cxp 5631 ^◡ccnv 5632 dom cdm 5633 ran crn 5634 ↾ cres 5635 “ cima 5636 ∘ ccom 5637 Fn wfn 6491 ‘cfv 6496 1^st c1st 7919

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2707 ax-sep 5256 ax-nul 5263 ax-pr 5384 ax-un 7672

This theorem depends on definitions: df-bi 206 df-an 397 df-or 846 df-3an 1089 df-tru 1544 df-fal 1554 df-ex 1782 df-nf 1786 df-sb 2068 df-mo 2538 df-eu 2567 df-clab 2714 df-cleq 2728 df-clel 2814 df-nfc 2889 df-ne 2944 df-ral 3065 df-rex 3074 df-rab 3408 df-v 3447 df-sbc 3740 df-csb 3856 df-dif 3913 df-un 3915 df-in 3917 df-ss 3927 df-nul 4283 df-if 4487 df-sn 4587 df-pr 4589 df-op 4593 df-uni 4866 df-iun 4956 df-br 5106 df-opab 5168 df-mpt 5189 df-id 5531 df-xp 5639 df-rel 5640 df-cnv 5641 df-co 5642 df-dm 5643 df-rn 5644 df-res 5645 df-ima 5646 df-iota 6448 df-fun 6498 df-fn 6499 df-f 6500 df-fv 6504 df-1st 7921 df-2nd 7922

This theorem is referenced by: fpar 8048

W3C validator