mapfien - Metamath Proof Explorer

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

Theorem mapfien 9409

Description: A bijection of the base sets induces a bijection on the set of finitely supported functions. (Contributed by Mario Carneiro, 30-May-2015.) (Revised by AV, 3-Jul-2019.) (Revised by AV, 28-Jul-2024.)

**Hypotheses**
Ref	Expression
mapfien.s	⊢ 𝑆 = {𝑥 ∈ (𝐵 ↑_m 𝐴) ∣ 𝑥 finSupp 𝑍}
mapfien.t	⊢ 𝑇 = {𝑥 ∈ (𝐷 ↑_m 𝐶) ∣ 𝑥 finSupp 𝑊}
mapfien.w	⊢ 𝑊 = (𝐺‘𝑍)
mapfien.f	⊢ (𝜑 → 𝐹:𝐶–1-1-onto→𝐴)
mapfien.g	⊢ (𝜑 → 𝐺:𝐵–1-1-onto→𝐷)
mapfien.a	⊢ (𝜑 → 𝐴 ∈ 𝑈)
mapfien.b	⊢ (𝜑 → 𝐵 ∈ 𝑉)
mapfien.c	⊢ (𝜑 → 𝐶 ∈ 𝑋)
mapfien.d	⊢ (𝜑 → 𝐷 ∈ 𝑌)
mapfien.z	⊢ (𝜑 → 𝑍 ∈ 𝐵)

**Assertion**
Ref	Expression
mapfien	⊢ (𝜑 → (𝑓 ∈ 𝑆 ↦ (𝐺 ∘ (𝑓 ∘ 𝐹))):𝑆–1-1-onto→𝑇)

Distinct variable groups: 𝑥,𝐴 𝑥,𝐵 𝑥,𝐶 𝑥,𝑓,𝐹 𝑓,𝐺,𝑥 𝜑,𝑓 𝑥,𝐷 𝑆,𝑓 𝑇,𝑓 𝑥,𝑊 𝑥,𝑍 Allowed substitution hints: 𝜑(𝑥) 𝐴(𝑓) 𝐵(𝑓) 𝐶(𝑓) 𝐷(𝑓) 𝑆(𝑥) 𝑇(𝑥) 𝑈(𝑥,𝑓) 𝑉(𝑥,𝑓) 𝑊(𝑓) 𝑋(𝑥,𝑓) 𝑌(𝑥,𝑓) 𝑍(𝑓)

Proof of Theorem mapfien Dummy variable 𝑔 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		eqid 2731	. 2 ⊢ (𝑓 ∈ 𝑆 ↦ (𝐺 ∘ (𝑓 ∘ 𝐹))) = (𝑓 ∈ 𝑆 ↦ (𝐺 ∘ (𝑓 ∘ 𝐹)))
2		mapfien.g	. . . . . . 7 ⊢ (𝜑 → 𝐺:𝐵–1-1-onto→𝐷)
3		f1of 6833	. . . . . . 7 ⊢ (𝐺:𝐵–1-1-onto→𝐷 → 𝐺:𝐵⟶𝐷)
4	2, 3	syl 17	. . . . . 6 ⊢ (𝜑 → 𝐺:𝐵⟶𝐷)
5	4	adantr 480	. . . . 5 ⊢ ((𝜑 ∧ 𝑓 ∈ 𝑆) → 𝐺:𝐵⟶𝐷)
6		breq1 5151	. . . . . . . . . 10 ⊢ (𝑥 = 𝑓 → (𝑥 finSupp 𝑍 ↔ 𝑓 finSupp 𝑍))
7		mapfien.s	. . . . . . . . . 10 ⊢ 𝑆 = {𝑥 ∈ (𝐵 ↑_m 𝐴) ∣ 𝑥 finSupp 𝑍}
8	6, 7	elrab2 3686	. . . . . . . . 9 ⊢ (𝑓 ∈ 𝑆 ↔ (𝑓 ∈ (𝐵 ↑_m 𝐴) ∧ 𝑓 finSupp 𝑍))
9	8	simplbi 497	. . . . . . . 8 ⊢ (𝑓 ∈ 𝑆 → 𝑓 ∈ (𝐵 ↑_m 𝐴))
10	9	adantl 481	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑓 ∈ 𝑆) → 𝑓 ∈ (𝐵 ↑_m 𝐴))
11		elmapi 8849	. . . . . . 7 ⊢ (𝑓 ∈ (𝐵 ↑_m 𝐴) → 𝑓:𝐴⟶𝐵)
12	10, 11	syl 17	. . . . . 6 ⊢ ((𝜑 ∧ 𝑓 ∈ 𝑆) → 𝑓:𝐴⟶𝐵)
13		mapfien.f	. . . . . . . 8 ⊢ (𝜑 → 𝐹:𝐶–1-1-onto→𝐴)
14		f1of 6833	. . . . . . . 8 ⊢ (𝐹:𝐶–1-1-onto→𝐴 → 𝐹:𝐶⟶𝐴)
15	13, 14	syl 17	. . . . . . 7 ⊢ (𝜑 → 𝐹:𝐶⟶𝐴)
16	15	adantr 480	. . . . . 6 ⊢ ((𝜑 ∧ 𝑓 ∈ 𝑆) → 𝐹:𝐶⟶𝐴)
17	12, 16	fcod 6743	. . . . 5 ⊢ ((𝜑 ∧ 𝑓 ∈ 𝑆) → (𝑓 ∘ 𝐹):𝐶⟶𝐵)
18	5, 17	fcod 6743	. . . 4 ⊢ ((𝜑 ∧ 𝑓 ∈ 𝑆) → (𝐺 ∘ (𝑓 ∘ 𝐹)):𝐶⟶𝐷)
19		mapfien.d	. . . . . 6 ⊢ (𝜑 → 𝐷 ∈ 𝑌)
20		mapfien.c	. . . . . 6 ⊢ (𝜑 → 𝐶 ∈ 𝑋)
21	19, 20	elmapd 8840	. . . . 5 ⊢ (𝜑 → ((𝐺 ∘ (𝑓 ∘ 𝐹)) ∈ (𝐷 ↑_m 𝐶) ↔ (𝐺 ∘ (𝑓 ∘ 𝐹)):𝐶⟶𝐷))
22	21	adantr 480	. . . 4 ⊢ ((𝜑 ∧ 𝑓 ∈ 𝑆) → ((𝐺 ∘ (𝑓 ∘ 𝐹)) ∈ (𝐷 ↑_m 𝐶) ↔ (𝐺 ∘ (𝑓 ∘ 𝐹)):𝐶⟶𝐷))
23	18, 22	mpbird 257	. . 3 ⊢ ((𝜑 ∧ 𝑓 ∈ 𝑆) → (𝐺 ∘ (𝑓 ∘ 𝐹)) ∈ (𝐷 ↑_m 𝐶))
24		mapfien.t	. . . 4 ⊢ 𝑇 = {𝑥 ∈ (𝐷 ↑_m 𝐶) ∣ 𝑥 finSupp 𝑊}
25		mapfien.w	. . . 4 ⊢ 𝑊 = (𝐺‘𝑍)
26		mapfien.a	. . . 4 ⊢ (𝜑 → 𝐴 ∈ 𝑈)
27		mapfien.b	. . . 4 ⊢ (𝜑 → 𝐵 ∈ 𝑉)
28		mapfien.z	. . . 4 ⊢ (𝜑 → 𝑍 ∈ 𝐵)
29	7, 24, 25, 13, 2, 26, 27, 20, 19, 28	mapfienlem1 9406	. . 3 ⊢ ((𝜑 ∧ 𝑓 ∈ 𝑆) → (𝐺 ∘ (𝑓 ∘ 𝐹)) finSupp 𝑊)
30		breq1 5151	. . . 4 ⊢ (𝑥 = (𝐺 ∘ (𝑓 ∘ 𝐹)) → (𝑥 finSupp 𝑊 ↔ (𝐺 ∘ (𝑓 ∘ 𝐹)) finSupp 𝑊))
31	30, 24	elrab2 3686	. . 3 ⊢ ((𝐺 ∘ (𝑓 ∘ 𝐹)) ∈ 𝑇 ↔ ((𝐺 ∘ (𝑓 ∘ 𝐹)) ∈ (𝐷 ↑_m 𝐶) ∧ (𝐺 ∘ (𝑓 ∘ 𝐹)) finSupp 𝑊))
32	23, 29, 31	sylanbrc 582	. 2 ⊢ ((𝜑 ∧ 𝑓 ∈ 𝑆) → (𝐺 ∘ (𝑓 ∘ 𝐹)) ∈ 𝑇)
33	7, 24, 25, 13, 2, 26, 27, 20, 19, 28	mapfienlem3 9408	. 2 ⊢ ((𝜑 ∧ 𝑔 ∈ 𝑇) → ((^◡𝐺 ∘ 𝑔) ∘ ^◡𝐹) ∈ 𝑆)
34		coass 6264	. . . . . 6 ⊢ (((^◡𝐺 ∘ 𝑔) ∘ ^◡𝐹) ∘ 𝐹) = ((^◡𝐺 ∘ 𝑔) ∘ (^◡𝐹 ∘ 𝐹))
35	13	adantr 480	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑓 ∈ 𝑆 ∧ 𝑔 ∈ 𝑇)) → 𝐹:𝐶–1-1-onto→𝐴)
36		f1ococnv1 6862	. . . . . . . . 9 ⊢ (𝐹:𝐶–1-1-onto→𝐴 → (^◡𝐹 ∘ 𝐹) = ( I ↾ 𝐶))
37	35, 36	syl 17	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑓 ∈ 𝑆 ∧ 𝑔 ∈ 𝑇)) → (^◡𝐹 ∘ 𝐹) = ( I ↾ 𝐶))
38	37	coeq2d 5862	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑓 ∈ 𝑆 ∧ 𝑔 ∈ 𝑇)) → ((^◡𝐺 ∘ 𝑔) ∘ (^◡𝐹 ∘ 𝐹)) = ((^◡𝐺 ∘ 𝑔) ∘ ( I ↾ 𝐶)))
39		f1ocnv 6845	. . . . . . . . . . . 12 ⊢ (𝐺:𝐵–1-1-onto→𝐷 → ^◡𝐺:𝐷–1-1-onto→𝐵)
40		f1of 6833	. . . . . . . . . . . 12 ⊢ (^◡𝐺:𝐷–1-1-onto→𝐵 → ^◡𝐺:𝐷⟶𝐵)
41	2, 39, 40	3syl 18	. . . . . . . . . . 11 ⊢ (𝜑 → ^◡𝐺:𝐷⟶𝐵)
42	41	adantr 480	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑔 ∈ 𝑇) → ^◡𝐺:𝐷⟶𝐵)
43		simpr 484	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑔 ∈ 𝑇) → 𝑔 ∈ 𝑇)
44		breq1 5151	. . . . . . . . . . . . . 14 ⊢ (𝑥 = 𝑔 → (𝑥 finSupp 𝑊 ↔ 𝑔 finSupp 𝑊))
45	44, 24	elrab2 3686	. . . . . . . . . . . . 13 ⊢ (𝑔 ∈ 𝑇 ↔ (𝑔 ∈ (𝐷 ↑_m 𝐶) ∧ 𝑔 finSupp 𝑊))
46	43, 45	sylib 217	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑔 ∈ 𝑇) → (𝑔 ∈ (𝐷 ↑_m 𝐶) ∧ 𝑔 finSupp 𝑊))
47	46	simpld 494	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑔 ∈ 𝑇) → 𝑔 ∈ (𝐷 ↑_m 𝐶))
48		elmapi 8849	. . . . . . . . . . 11 ⊢ (𝑔 ∈ (𝐷 ↑_m 𝐶) → 𝑔:𝐶⟶𝐷)
49	47, 48	syl 17	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑔 ∈ 𝑇) → 𝑔:𝐶⟶𝐷)
50	42, 49	fcod 6743	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑔 ∈ 𝑇) → (^◡𝐺 ∘ 𝑔):𝐶⟶𝐵)
51	50	adantrl 713	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑓 ∈ 𝑆 ∧ 𝑔 ∈ 𝑇)) → (^◡𝐺 ∘ 𝑔):𝐶⟶𝐵)
52		fcoi1 6765	. . . . . . . 8 ⊢ ((^◡𝐺 ∘ 𝑔):𝐶⟶𝐵 → ((^◡𝐺 ∘ 𝑔) ∘ ( I ↾ 𝐶)) = (^◡𝐺 ∘ 𝑔))
53	51, 52	syl 17	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑓 ∈ 𝑆 ∧ 𝑔 ∈ 𝑇)) → ((^◡𝐺 ∘ 𝑔) ∘ ( I ↾ 𝐶)) = (^◡𝐺 ∘ 𝑔))
54	38, 53	eqtrd 2771	. . . . . 6 ⊢ ((𝜑 ∧ (𝑓 ∈ 𝑆 ∧ 𝑔 ∈ 𝑇)) → ((^◡𝐺 ∘ 𝑔) ∘ (^◡𝐹 ∘ 𝐹)) = (^◡𝐺 ∘ 𝑔))
55	34, 54	eqtrid 2783	. . . . 5 ⊢ ((𝜑 ∧ (𝑓 ∈ 𝑆 ∧ 𝑔 ∈ 𝑇)) → (((^◡𝐺 ∘ 𝑔) ∘ ^◡𝐹) ∘ 𝐹) = (^◡𝐺 ∘ 𝑔))
56	55	eqeq2d 2742	. . . 4 ⊢ ((𝜑 ∧ (𝑓 ∈ 𝑆 ∧ 𝑔 ∈ 𝑇)) → ((𝑓 ∘ 𝐹) = (((^◡𝐺 ∘ 𝑔) ∘ ^◡𝐹) ∘ 𝐹) ↔ (𝑓 ∘ 𝐹) = (^◡𝐺 ∘ 𝑔)))
57		coass 6264	. . . . . . 7 ⊢ ((^◡𝐺 ∘ 𝐺) ∘ (𝑓 ∘ 𝐹)) = (^◡𝐺 ∘ (𝐺 ∘ (𝑓 ∘ 𝐹)))
58	2	adantr 480	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑓 ∈ 𝑆 ∧ 𝑔 ∈ 𝑇)) → 𝐺:𝐵–1-1-onto→𝐷)
59		f1ococnv1 6862	. . . . . . . . . 10 ⊢ (𝐺:𝐵–1-1-onto→𝐷 → (^◡𝐺 ∘ 𝐺) = ( I ↾ 𝐵))
60	58, 59	syl 17	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑓 ∈ 𝑆 ∧ 𝑔 ∈ 𝑇)) → (^◡𝐺 ∘ 𝐺) = ( I ↾ 𝐵))
61	60	coeq1d 5861	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑓 ∈ 𝑆 ∧ 𝑔 ∈ 𝑇)) → ((^◡𝐺 ∘ 𝐺) ∘ (𝑓 ∘ 𝐹)) = (( I ↾ 𝐵) ∘ (𝑓 ∘ 𝐹)))
62	17	adantrr 714	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑓 ∈ 𝑆 ∧ 𝑔 ∈ 𝑇)) → (𝑓 ∘ 𝐹):𝐶⟶𝐵)
63		fcoi2 6766	. . . . . . . . 9 ⊢ ((𝑓 ∘ 𝐹):𝐶⟶𝐵 → (( I ↾ 𝐵) ∘ (𝑓 ∘ 𝐹)) = (𝑓 ∘ 𝐹))
64	62, 63	syl 17	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑓 ∈ 𝑆 ∧ 𝑔 ∈ 𝑇)) → (( I ↾ 𝐵) ∘ (𝑓 ∘ 𝐹)) = (𝑓 ∘ 𝐹))
65	61, 64	eqtrd 2771	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑓 ∈ 𝑆 ∧ 𝑔 ∈ 𝑇)) → ((^◡𝐺 ∘ 𝐺) ∘ (𝑓 ∘ 𝐹)) = (𝑓 ∘ 𝐹))
66	57, 65	eqtr3id 2785	. . . . . 6 ⊢ ((𝜑 ∧ (𝑓 ∈ 𝑆 ∧ 𝑔 ∈ 𝑇)) → (^◡𝐺 ∘ (𝐺 ∘ (𝑓 ∘ 𝐹))) = (𝑓 ∘ 𝐹))
67	66	eqeq2d 2742	. . . . 5 ⊢ ((𝜑 ∧ (𝑓 ∈ 𝑆 ∧ 𝑔 ∈ 𝑇)) → ((^◡𝐺 ∘ 𝑔) = (^◡𝐺 ∘ (𝐺 ∘ (𝑓 ∘ 𝐹))) ↔ (^◡𝐺 ∘ 𝑔) = (𝑓 ∘ 𝐹)))
68		eqcom 2738	. . . . 5 ⊢ ((^◡𝐺 ∘ 𝑔) = (𝑓 ∘ 𝐹) ↔ (𝑓 ∘ 𝐹) = (^◡𝐺 ∘ 𝑔))
69	67, 68	bitrdi 287	. . . 4 ⊢ ((𝜑 ∧ (𝑓 ∈ 𝑆 ∧ 𝑔 ∈ 𝑇)) → ((^◡𝐺 ∘ 𝑔) = (^◡𝐺 ∘ (𝐺 ∘ (𝑓 ∘ 𝐹))) ↔ (𝑓 ∘ 𝐹) = (^◡𝐺 ∘ 𝑔)))
70	56, 69	bitr4d 282	. . 3 ⊢ ((𝜑 ∧ (𝑓 ∈ 𝑆 ∧ 𝑔 ∈ 𝑇)) → ((𝑓 ∘ 𝐹) = (((^◡𝐺 ∘ 𝑔) ∘ ^◡𝐹) ∘ 𝐹) ↔ (^◡𝐺 ∘ 𝑔) = (^◡𝐺 ∘ (𝐺 ∘ (𝑓 ∘ 𝐹)))))
71		f1ofo 6840	. . . . 5 ⊢ (𝐹:𝐶–1-1-onto→𝐴 → 𝐹:𝐶–onto→𝐴)
72	35, 71	syl 17	. . . 4 ⊢ ((𝜑 ∧ (𝑓 ∈ 𝑆 ∧ 𝑔 ∈ 𝑇)) → 𝐹:𝐶–onto→𝐴)
73		ffn 6717	. . . . . 6 ⊢ (𝑓:𝐴⟶𝐵 → 𝑓 Fn 𝐴)
74	10, 11, 73	3syl 18	. . . . 5 ⊢ ((𝜑 ∧ 𝑓 ∈ 𝑆) → 𝑓 Fn 𝐴)
75	74	adantrr 714	. . . 4 ⊢ ((𝜑 ∧ (𝑓 ∈ 𝑆 ∧ 𝑔 ∈ 𝑇)) → 𝑓 Fn 𝐴)
76		f1ocnv 6845	. . . . . . . . 9 ⊢ (𝐹:𝐶–1-1-onto→𝐴 → ^◡𝐹:𝐴–1-1-onto→𝐶)
77		f1of 6833	. . . . . . . . 9 ⊢ (^◡𝐹:𝐴–1-1-onto→𝐶 → ^◡𝐹:𝐴⟶𝐶)
78	13, 76, 77	3syl 18	. . . . . . . 8 ⊢ (𝜑 → ^◡𝐹:𝐴⟶𝐶)
79	78	adantr 480	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑔 ∈ 𝑇) → ^◡𝐹:𝐴⟶𝐶)
80	50, 79	fcod 6743	. . . . . 6 ⊢ ((𝜑 ∧ 𝑔 ∈ 𝑇) → ((^◡𝐺 ∘ 𝑔) ∘ ^◡𝐹):𝐴⟶𝐵)
81	80	ffnd 6718	. . . . 5 ⊢ ((𝜑 ∧ 𝑔 ∈ 𝑇) → ((^◡𝐺 ∘ 𝑔) ∘ ^◡𝐹) Fn 𝐴)
82	81	adantrl 713	. . . 4 ⊢ ((𝜑 ∧ (𝑓 ∈ 𝑆 ∧ 𝑔 ∈ 𝑇)) → ((^◡𝐺 ∘ 𝑔) ∘ ^◡𝐹) Fn 𝐴)
83		cocan2 7293	. . . 4 ⊢ ((𝐹:𝐶–onto→𝐴 ∧ 𝑓 Fn 𝐴 ∧ ((^◡𝐺 ∘ 𝑔) ∘ ^◡𝐹) Fn 𝐴) → ((𝑓 ∘ 𝐹) = (((^◡𝐺 ∘ 𝑔) ∘ ^◡𝐹) ∘ 𝐹) ↔ 𝑓 = ((^◡𝐺 ∘ 𝑔) ∘ ^◡𝐹)))
84	72, 75, 82, 83	syl3anc 1370	. . 3 ⊢ ((𝜑 ∧ (𝑓 ∈ 𝑆 ∧ 𝑔 ∈ 𝑇)) → ((𝑓 ∘ 𝐹) = (((^◡𝐺 ∘ 𝑔) ∘ ^◡𝐹) ∘ 𝐹) ↔ 𝑓 = ((^◡𝐺 ∘ 𝑔) ∘ ^◡𝐹)))
85	2, 39	syl 17	. . . . . 6 ⊢ (𝜑 → ^◡𝐺:𝐷–1-1-onto→𝐵)
86	85	adantr 480	. . . . 5 ⊢ ((𝜑 ∧ (𝑓 ∈ 𝑆 ∧ 𝑔 ∈ 𝑇)) → ^◡𝐺:𝐷–1-1-onto→𝐵)
87		f1of1 6832	. . . . 5 ⊢ (^◡𝐺:𝐷–1-1-onto→𝐵 → ^◡𝐺:𝐷–1-1→𝐵)
88	86, 87	syl 17	. . . 4 ⊢ ((𝜑 ∧ (𝑓 ∈ 𝑆 ∧ 𝑔 ∈ 𝑇)) → ^◡𝐺:𝐷–1-1→𝐵)
89	49	adantrl 713	. . . 4 ⊢ ((𝜑 ∧ (𝑓 ∈ 𝑆 ∧ 𝑔 ∈ 𝑇)) → 𝑔:𝐶⟶𝐷)
90	18	adantrr 714	. . . 4 ⊢ ((𝜑 ∧ (𝑓 ∈ 𝑆 ∧ 𝑔 ∈ 𝑇)) → (𝐺 ∘ (𝑓 ∘ 𝐹)):𝐶⟶𝐷)
91		cocan1 7292	. . . 4 ⊢ ((^◡𝐺:𝐷–1-1→𝐵 ∧ 𝑔:𝐶⟶𝐷 ∧ (𝐺 ∘ (𝑓 ∘ 𝐹)):𝐶⟶𝐷) → ((^◡𝐺 ∘ 𝑔) = (^◡𝐺 ∘ (𝐺 ∘ (𝑓 ∘ 𝐹))) ↔ 𝑔 = (𝐺 ∘ (𝑓 ∘ 𝐹))))
92	88, 89, 90, 91	syl3anc 1370	. . 3 ⊢ ((𝜑 ∧ (𝑓 ∈ 𝑆 ∧ 𝑔 ∈ 𝑇)) → ((^◡𝐺 ∘ 𝑔) = (^◡𝐺 ∘ (𝐺 ∘ (𝑓 ∘ 𝐹))) ↔ 𝑔 = (𝐺 ∘ (𝑓 ∘ 𝐹))))
93	70, 84, 92	3bitr3d 309	. 2 ⊢ ((𝜑 ∧ (𝑓 ∈ 𝑆 ∧ 𝑔 ∈ 𝑇)) → (𝑓 = ((^◡𝐺 ∘ 𝑔) ∘ ^◡𝐹) ↔ 𝑔 = (𝐺 ∘ (𝑓 ∘ 𝐹))))
94	1, 32, 33, 93	f1o2d 7664	1 ⊢ (𝜑 → (𝑓 ∈ 𝑆 ↦ (𝐺 ∘ (𝑓 ∘ 𝐹))):𝑆–1-1-onto→𝑇)

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 205 ∧ wa 395 = wceq 1540 ∈ wcel 2105 {crab 3431 class class class wbr 5148 ↦ cmpt 5231 I cid 5573 ^◡ccnv 5675 ↾ cres 5678 ∘ ccom 5680 Fn wfn 6538 ⟶wf 6539 –1-1→wf1 6540 –onto→wfo 6541 –1-1-onto→wf1o 6542 ‘cfv 6543 (class class class)co 7412 ↑_m cmap 8826 finSupp cfsupp 9367

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1912 ax-6 1970 ax-7 2010 ax-8 2107 ax-9 2115 ax-10 2136 ax-11 2153 ax-12 2170 ax-ext 2702 ax-rep 5285 ax-sep 5299 ax-nul 5306 ax-pow 5363 ax-pr 5427 ax-un 7729

This theorem depends on definitions: df-bi 206 df-an 396 df-or 845 df-3or 1087 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1781 df-nf 1785 df-sb 2067 df-mo 2533 df-eu 2562 df-clab 2709 df-cleq 2723 df-clel 2809 df-nfc 2884 df-ne 2940 df-ral 3061 df-rex 3070 df-reu 3376 df-rab 3432 df-v 3475 df-sbc 3778 df-csb 3894 df-dif 3951 df-un 3953 df-in 3955 df-ss 3965 df-pss 3967 df-nul 4323 df-if 4529 df-pw 4604 df-sn 4629 df-pr 4631 df-op 4635 df-uni 4909 df-iun 4999 df-br 5149 df-opab 5211 df-mpt 5232 df-tr 5266 df-id 5574 df-eprel 5580 df-po 5588 df-so 5589 df-fr 5631 df-we 5633 df-xp 5682 df-rel 5683 df-cnv 5684 df-co 5685 df-dm 5686 df-rn 5687 df-res 5688 df-ima 5689 df-ord 6367 df-on 6368 df-lim 6369 df-suc 6370 df-iota 6495 df-fun 6545 df-fn 6546 df-f 6547 df-f1 6548 df-fo 6549 df-f1o 6550 df-fv 6551 df-ov 7415 df-oprab 7416 df-mpo 7417 df-om 7860 df-1st 7979 df-2nd 7980 df-supp 8152 df-1o 8472 df-map 8828 df-en 8946 df-fin 8949 df-fsupp 9368

This theorem is referenced by: mapfien2 9410 wemapwe 9698 oef1o 9699 fcobijfs 32381

W3C validator