Theorem mptcnfimad 7989

Description: The converse of a mapping of subsets to their image of a bijection. (Contributed by AV, 23-Apr-2025.)

Hypotheses

Ref	Expression
mptcnfimad.m	⊢ 𝑀 = (𝑥 ∈ 𝐴 ↦ (𝐹 “ 𝑥))
mptcnfimad.f	⊢ (𝜑 → 𝐹:𝑉–1-1-onto→𝑊)
mptcnfimad.a	⊢ (𝜑 → 𝐴 ⊆ 𝒫 𝑉)
mptcnfimad.r	⊢ (𝜑 → ran 𝑀 ⊆ 𝒫 𝑊)
mptcnfimad.v	⊢ (𝜑 → 𝑉 ∈ 𝑈)

Assertion

Ref	Expression
mptcnfimad	⊢ (𝜑 → ◡𝑀 = (𝑦 ∈ ran 𝑀 ↦ (◡𝐹 “ 𝑦)))

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

Allowed substitution hints:   𝑈(𝑥, 𝑦)   𝑀(𝑦)   𝑉(𝑥, 𝑦)   𝑊(𝑥, 𝑦)

Proof of Theorem mptcnfimad

Dummy variable 𝑧 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		mptcnfimad.m	. . 3 ⊢ 𝑀 = (𝑥 ∈ 𝐴 ↦ (𝐹 “ 𝑥))
2	1	cnveqi 5862	. 2 ⊢ ◡𝑀 = ◡(𝑥 ∈ 𝐴 ↦ (𝐹 “ 𝑥))
3		simpr 490	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝑥 ∈ 𝐴)
4		mptcnfimad.f	. . . . . . . . . . . 12 ⊢ (𝜑 → 𝐹:𝑉–1-1-onto→𝑊)
5		f1of 6824	. . . . . . . . . . . 12 ⊢ (𝐹:𝑉–1-1-onto→𝑊 → 𝐹:𝑉⟶𝑊)
6	4, 5	syl 18	. . . . . . . . . . 11 ⊢ (𝜑 → 𝐹:𝑉⟶𝑊)
7		mptcnfimad.v	. . . . . . . . . . 11 ⊢ (𝜑 → 𝑉 ∈ 𝑈)
8	6, 7	fexd 7232	. . . . . . . . . 10 ⊢ (𝜑 → 𝐹 ∈ V)
9	8	imaexd 7919	. . . . . . . . 9 ⊢ (𝜑 → (𝐹 “ 𝑥) ∈ V)
10	9	adantr 486	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (𝐹 “ 𝑥) ∈ V)
11	1, 3, 10	elrnmpt1d 5956	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (𝐹 “ 𝑥) ∈ ran 𝑀)
12		f1of1 6823	. . . . . . . . 9 ⊢ (𝐹:𝑉–1-1-onto→𝑊 → 𝐹:𝑉–1-1→𝑊)
13	4, 12	syl 18	. . . . . . . 8 ⊢ (𝜑 → 𝐹:𝑉–1-1→𝑊)
14		mptcnfimad.a	. . . . . . . . . 10 ⊢ (𝜑 → 𝐴 ⊆ 𝒫 𝑉)
15		ssel 3932	. . . . . . . . . . 11 ⊢ (𝐴 ⊆ 𝒫 𝑉 → (𝑥 ∈ 𝐴 → 𝑥 ∈ 𝒫 𝑉))
16		elpwi 4571	. . . . . . . . . . 11 ⊢ (𝑥 ∈ 𝒫 𝑉 → 𝑥 ⊆ 𝑉)
17	15, 16	syl6 36	. . . . . . . . . 10 ⊢ (𝐴 ⊆ 𝒫 𝑉 → (𝑥 ∈ 𝐴 → 𝑥 ⊆ 𝑉))
18	14, 17	syl 18	. . . . . . . . 9 ⊢ (𝜑 → (𝑥 ∈ 𝐴 → 𝑥 ⊆ 𝑉))
19	18	imp 412	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝑥 ⊆ 𝑉)
20		f1imacnv 6841	. . . . . . . . 9 ⊢ ((𝐹:𝑉–1-1→𝑊 ∧ 𝑥 ⊆ 𝑉) → (◡𝐹 “ (𝐹 “ 𝑥)) = 𝑥)
21	20	eqcomd 2771	. . . . . . . 8 ⊢ ((𝐹:𝑉–1-1→𝑊 ∧ 𝑥 ⊆ 𝑉) → 𝑥 = (◡𝐹 “ (𝐹 “ 𝑥)))
22	13, 19, 21	syl2an2r 698	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝑥 = (◡𝐹 “ (𝐹 “ 𝑥)))
23	11, 22	jca 521	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → ((𝐹 “ 𝑥) ∈ ran 𝑀 ∧ 𝑥 = (◡𝐹 “ (𝐹 “ 𝑥))))
24		eleq1 2853	. . . . . . 7 ⊢ (𝑦 = (𝐹 “ 𝑥) → (𝑦 ∈ ran 𝑀 ↔ (𝐹 “ 𝑥) ∈ ran 𝑀))
25		imaeq2 6060	. . . . . . . 8 ⊢ (𝑦 = (𝐹 “ 𝑥) → (◡𝐹 “ 𝑦) = (◡𝐹 “ (𝐹 “ 𝑥)))
26	25	eqeq2d 2776	. . . . . . 7 ⊢ (𝑦 = (𝐹 “ 𝑥) → (𝑥 = (◡𝐹 “ 𝑦) ↔ 𝑥 = (◡𝐹 “ (𝐹 “ 𝑥))))
27	24, 26	anbi12d 644	. . . . . 6 ⊢ (𝑦 = (𝐹 “ 𝑥) → ((𝑦 ∈ ran 𝑀 ∧ 𝑥 = (◡𝐹 “ 𝑦)) ↔ ((𝐹 “ 𝑥) ∈ ran 𝑀 ∧ 𝑥 = (◡𝐹 “ (𝐹 “ 𝑥)))))
28	23, 27	syl5ibrcom 250	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (𝑦 = (𝐹 “ 𝑥) → (𝑦 ∈ ran 𝑀 ∧ 𝑥 = (◡𝐹 “ 𝑦))))
29	28	expimpd 459	. . . 4 ⊢ (𝜑 → ((𝑥 ∈ 𝐴 ∧ 𝑦 = (𝐹 “ 𝑥)) → (𝑦 ∈ ran 𝑀 ∧ 𝑥 = (◡𝐹 “ 𝑦))))
30	10	ralrimiva 3159	. . . . . . . . . . 11 ⊢ (𝜑 → ∀𝑥 ∈ 𝐴 (𝐹 “ 𝑥) ∈ V)
31	1	fnmpt 6679	. . . . . . . . . . 11 ⊢ (∀𝑥 ∈ 𝐴 (𝐹 “ 𝑥) ∈ V → 𝑀 Fn 𝐴)
32	30, 31	syl 18	. . . . . . . . . 10 ⊢ (𝜑 → 𝑀 Fn 𝐴)
33		fvelrnb 6945	. . . . . . . . . 10 ⊢ (𝑀 Fn 𝐴 → (𝑦 ∈ ran 𝑀 ↔ ∃𝑥 ∈ 𝐴 (𝑀‘𝑥) = 𝑦))
34	32, 33	syl 18	. . . . . . . . 9 ⊢ (𝜑 → (𝑦 ∈ ran 𝑀 ↔ ∃𝑥 ∈ 𝐴 (𝑀‘𝑥) = 𝑦))
35		imaeq2 6060	. . . . . . . . . . . . . . . 16 ⊢ (𝑥 = 𝑧 → (𝐹 “ 𝑥) = (𝐹 “ 𝑧))
36	35	cbvmptv 5217	. . . . . . . . . . . . . . 15 ⊢ (𝑥 ∈ 𝐴 ↦ (𝐹 “ 𝑥)) = (𝑧 ∈ 𝐴 ↦ (𝐹 “ 𝑧))
37	1, 36	eqtri 2788	. . . . . . . . . . . . . 14 ⊢ 𝑀 = (𝑧 ∈ 𝐴 ↦ (𝐹 “ 𝑧))
38	37	a1i 11	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝑀 = (𝑧 ∈ 𝐴 ↦ (𝐹 “ 𝑧)))
39		simpr 490	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐴) ∧ 𝑧 = 𝑥) → 𝑧 = 𝑥)
40	39	imaeq2d 6064	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐴) ∧ 𝑧 = 𝑥) → (𝐹 “ 𝑧) = (𝐹 “ 𝑥))
41	38, 40, 3, 10	fvmptd 7001	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (𝑀‘𝑥) = (𝐹 “ 𝑥))
42	41	eqeq1d 2767	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → ((𝑀‘𝑥) = 𝑦 ↔ (𝐹 “ 𝑥) = 𝑦))
43	25	eqcoms 2773	. . . . . . . . . . . . . 14 ⊢ ((𝐹 “ 𝑥) = 𝑦 → (◡𝐹 “ 𝑦) = (◡𝐹 “ (𝐹 “ 𝑥)))
44	43	adantl 487	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐴) ∧ (𝐹 “ 𝑥) = 𝑦) → (◡𝐹 “ 𝑦) = (◡𝐹 “ (𝐹 “ 𝑥)))
45	13, 19, 20	syl2an2r 698	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (◡𝐹 “ (𝐹 “ 𝑥)) = 𝑥)
46	45, 3	eqeltrd 2865	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (◡𝐹 “ (𝐹 “ 𝑥)) ∈ 𝐴)
47	46	adantr 486	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐴) ∧ (𝐹 “ 𝑥) = 𝑦) → (◡𝐹 “ (𝐹 “ 𝑥)) ∈ 𝐴)
48	44, 47	eqeltrd 2865	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐴) ∧ (𝐹 “ 𝑥) = 𝑦) → (◡𝐹 “ 𝑦) ∈ 𝐴)
49	48	ex 418	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → ((𝐹 “ 𝑥) = 𝑦 → (◡𝐹 “ 𝑦) ∈ 𝐴))
50	42, 49	sylbid 243	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → ((𝑀‘𝑥) = 𝑦 → (◡𝐹 “ 𝑦) ∈ 𝐴))
51	50	rexlimdva 3168	. . . . . . . . 9 ⊢ (𝜑 → (∃𝑥 ∈ 𝐴 (𝑀‘𝑥) = 𝑦 → (◡𝐹 “ 𝑦) ∈ 𝐴))
52	34, 51	sylbid 243	. . . . . . . 8 ⊢ (𝜑 → (𝑦 ∈ ran 𝑀 → (◡𝐹 “ 𝑦) ∈ 𝐴))
53	52	imp 412	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑦 ∈ ran 𝑀) → (◡𝐹 “ 𝑦) ∈ 𝐴)
54		f1ofo 6832	. . . . . . . . . 10 ⊢ (𝐹:𝑉–1-1-onto→𝑊 → 𝐹:𝑉–onto→𝑊)
55	4, 54	syl 18	. . . . . . . . 9 ⊢ (𝜑 → 𝐹:𝑉–onto→𝑊)
56		mptcnfimad.r	. . . . . . . . . . 11 ⊢ (𝜑 → ran 𝑀 ⊆ 𝒫 𝑊)
57		ssel 3932	. . . . . . . . . . . 12 ⊢ (ran 𝑀 ⊆ 𝒫 𝑊 → (𝑦 ∈ ran 𝑀 → 𝑦 ∈ 𝒫 𝑊))
58		elpwi 4571	. . . . . . . . . . . 12 ⊢ (𝑦 ∈ 𝒫 𝑊 → 𝑦 ⊆ 𝑊)
59	57, 58	syl6 36	. . . . . . . . . . 11 ⊢ (ran 𝑀 ⊆ 𝒫 𝑊 → (𝑦 ∈ ran 𝑀 → 𝑦 ⊆ 𝑊))
60	56, 59	syl 18	. . . . . . . . . 10 ⊢ (𝜑 → (𝑦 ∈ ran 𝑀 → 𝑦 ⊆ 𝑊))
61	60	imp 412	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑦 ∈ ran 𝑀) → 𝑦 ⊆ 𝑊)
62		foimacnv 6842	. . . . . . . . 9 ⊢ ((𝐹:𝑉–onto→𝑊 ∧ 𝑦 ⊆ 𝑊) → (𝐹 “ (◡𝐹 “ 𝑦)) = 𝑦)
63	55, 61, 62	syl2an2r 698	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑦 ∈ ran 𝑀) → (𝐹 “ (◡𝐹 “ 𝑦)) = 𝑦)
64	63	eqcomd 2771	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑦 ∈ ran 𝑀) → 𝑦 = (𝐹 “ (◡𝐹 “ 𝑦)))
65	53, 64	jca 521	. . . . . 6 ⊢ ((𝜑 ∧ 𝑦 ∈ ran 𝑀) → ((◡𝐹 “ 𝑦) ∈ 𝐴 ∧ 𝑦 = (𝐹 “ (◡𝐹 “ 𝑦))))
66		eleq1 2853	. . . . . . 7 ⊢ (𝑥 = (◡𝐹 “ 𝑦) → (𝑥 ∈ 𝐴 ↔ (◡𝐹 “ 𝑦) ∈ 𝐴))
67		imaeq2 6060	. . . . . . . 8 ⊢ (𝑥 = (◡𝐹 “ 𝑦) → (𝐹 “ 𝑥) = (𝐹 “ (◡𝐹 “ 𝑦)))
68	67	eqeq2d 2776	. . . . . . 7 ⊢ (𝑥 = (◡𝐹 “ 𝑦) → (𝑦 = (𝐹 “ 𝑥) ↔ 𝑦 = (𝐹 “ (◡𝐹 “ 𝑦))))
69	66, 68	anbi12d 644	. . . . . 6 ⊢ (𝑥 = (◡𝐹 “ 𝑦) → ((𝑥 ∈ 𝐴 ∧ 𝑦 = (𝐹 “ 𝑥)) ↔ ((◡𝐹 “ 𝑦) ∈ 𝐴 ∧ 𝑦 = (𝐹 “ (◡𝐹 “ 𝑦)))))
70	65, 69	syl5ibrcom 250	. . . . 5 ⊢ ((𝜑 ∧ 𝑦 ∈ ran 𝑀) → (𝑥 = (◡𝐹 “ 𝑦) → (𝑥 ∈ 𝐴 ∧ 𝑦 = (𝐹 “ 𝑥))))
71	70	expimpd 459	. . . 4 ⊢ (𝜑 → ((𝑦 ∈ ran 𝑀 ∧ 𝑥 = (◡𝐹 “ 𝑦)) → (𝑥 ∈ 𝐴 ∧ 𝑦 = (𝐹 “ 𝑥))))
72	29, 71	impbid 215	. . 3 ⊢ (𝜑 → ((𝑥 ∈ 𝐴 ∧ 𝑦 = (𝐹 “ 𝑥)) ↔ (𝑦 ∈ ran 𝑀 ∧ 𝑥 = (◡𝐹 “ 𝑦))))
73	72	mptcnv 6140	. 2 ⊢ (𝜑 → ◡(𝑥 ∈ 𝐴 ↦ (𝐹 “ 𝑥)) = (𝑦 ∈ ran 𝑀 ↦ (◡𝐹 “ 𝑦)))
74	2, 73	eqtrid 2812	1 ⊢ (𝜑 → ◡𝑀 = (𝑦 ∈ ran 𝑀 ↦ (◡𝐹 “ 𝑦)))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2146  ∀wral 3081  ∃wrex 3091  Vcvv 3457   ⊆ wss 3906  𝒫 cpw 4564   ↦ cmpt 5194  ^◡ccnv 5662  ran crn 5664   “ cima 5666   Fn wfn 6535  ⟶wf 6536  –1-1→wf1 6537  –onto→wfo 6538  –1-1-onto→wf1o 6539  ‘cfv 6540

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2737  ax-rep 5240  ax-sep 5259  ax-nul 5271  ax-pr 5406  ax-un 7742

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2569  df-eu 2599  df-clab 2744  df-cleq 2757  df-clel 2840  df-nfc 2914  df-ne 2961  df-ral 3082  df-rex 3092  df-reu 3372  df-rab 3419  df-v 3459  df-sbc 3747  df-csb 3855  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-nul 4287  df-if 4490  df-pw 4566  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4875  df-iun 4960  df-br 5112  df-opab 5176  df-mpt 5195  df-id 5558  df-xp 5669  df-rel 5670  df-cnv 5671  df-co 5672  df-dm 5673  df-rn 5674  df-res 5675  df-ima 5676  df-iota 6496  df-fun 6542  df-fn 6543  df-f 6544  df-f1 6545  df-fo 6546  df-f1o 6547  df-fv 6548

This theorem is used by: (None)