Theorem fveqf1o 7254

Description: Given a bijection 𝐹, produce another bijection 𝐺 which additionally maps two specified points. (Contributed by Mario Carneiro, 30-May-2015.)

Hypothesis

Ref	Expression
fveqf1o.1	⊢ 𝐺 = (𝐹 ∘ (( I ↾ (𝐴 ∖ {𝐶, (◡𝐹‘𝐷)})) ∪ {⟨𝐶, (◡𝐹‘𝐷)⟩, ⟨(◡𝐹‘𝐷), 𝐶⟩}))

Assertion

Ref	Expression
fveqf1o	⊢ ((𝐹:𝐴–1-1-onto→𝐵 ∧ 𝐶 ∈ 𝐴 ∧ 𝐷 ∈ 𝐵) → (𝐺:𝐴–1-1-onto→𝐵 ∧ (𝐺‘𝐶) = 𝐷))

Proof of Theorem fveqf1o

Step	Hyp	Ref	Expression
1		simp1 1136	. . . 4 ⊢ ((𝐹:𝐴–1-1-onto→𝐵 ∧ 𝐶 ∈ 𝐴 ∧ 𝐷 ∈ 𝐵) → 𝐹:𝐴–1-1-onto→𝐵)
2		f1oi 6827	. . . . . . . 8 ⊢ ( I ↾ (𝐴 ∖ {𝐶, (◡𝐹‘𝐷)})):(𝐴 ∖ {𝐶, (◡𝐹‘𝐷)})–1-1-onto→(𝐴 ∖ {𝐶, (◡𝐹‘𝐷)})
3	2	a1i 11	. . . . . . 7 ⊢ ((𝐹:𝐴–1-1-onto→𝐵 ∧ 𝐶 ∈ 𝐴 ∧ 𝐷 ∈ 𝐵) → ( I ↾ (𝐴 ∖ {𝐶, (◡𝐹‘𝐷)})):(𝐴 ∖ {𝐶, (◡𝐹‘𝐷)})–1-1-onto→(𝐴 ∖ {𝐶, (◡𝐹‘𝐷)}))
4		simp2 1137	. . . . . . . 8 ⊢ ((𝐹:𝐴–1-1-onto→𝐵 ∧ 𝐶 ∈ 𝐴 ∧ 𝐷 ∈ 𝐵) → 𝐶 ∈ 𝐴)
5		f1ocnv 6801	. . . . . . . . . 10 ⊢ (𝐹:𝐴–1-1-onto→𝐵 → ◡𝐹:𝐵–1-1-onto→𝐴)
6		f1of 6789	. . . . . . . . . 10 ⊢ (◡𝐹:𝐵–1-1-onto→𝐴 → ◡𝐹:𝐵⟶𝐴)
7	1, 5, 6	3syl 18	. . . . . . . . 9 ⊢ ((𝐹:𝐴–1-1-onto→𝐵 ∧ 𝐶 ∈ 𝐴 ∧ 𝐷 ∈ 𝐵) → ◡𝐹:𝐵⟶𝐴)
8		simp3 1138	. . . . . . . . 9 ⊢ ((𝐹:𝐴–1-1-onto→𝐵 ∧ 𝐶 ∈ 𝐴 ∧ 𝐷 ∈ 𝐵) → 𝐷 ∈ 𝐵)
9	7, 8	ffvelcdmd 7041	. . . . . . . 8 ⊢ ((𝐹:𝐴–1-1-onto→𝐵 ∧ 𝐶 ∈ 𝐴 ∧ 𝐷 ∈ 𝐵) → (◡𝐹‘𝐷) ∈ 𝐴)
10		f1oprswap 6833	. . . . . . . 8 ⊢ ((𝐶 ∈ 𝐴 ∧ (◡𝐹‘𝐷) ∈ 𝐴) → {⟨𝐶, (◡𝐹‘𝐷)⟩, ⟨(◡𝐹‘𝐷), 𝐶⟩}:{𝐶, (◡𝐹‘𝐷)}–1-1-onto→{𝐶, (◡𝐹‘𝐷)})
11	4, 9, 10	syl2anc 584	. . . . . . 7 ⊢ ((𝐹:𝐴–1-1-onto→𝐵 ∧ 𝐶 ∈ 𝐴 ∧ 𝐷 ∈ 𝐵) → {⟨𝐶, (◡𝐹‘𝐷)⟩, ⟨(◡𝐹‘𝐷), 𝐶⟩}:{𝐶, (◡𝐹‘𝐷)}–1-1-onto→{𝐶, (◡𝐹‘𝐷)})
12		disjdifr 4437	. . . . . . . 8 ⊢ ((𝐴 ∖ {𝐶, (◡𝐹‘𝐷)}) ∩ {𝐶, (◡𝐹‘𝐷)}) = ∅
13	12	a1i 11	. . . . . . 7 ⊢ ((𝐹:𝐴–1-1-onto→𝐵 ∧ 𝐶 ∈ 𝐴 ∧ 𝐷 ∈ 𝐵) → ((𝐴 ∖ {𝐶, (◡𝐹‘𝐷)}) ∩ {𝐶, (◡𝐹‘𝐷)}) = ∅)
14		f1oun 6808	. . . . . . 7 ⊢ (((( I ↾ (𝐴 ∖ {𝐶, (◡𝐹‘𝐷)})):(𝐴 ∖ {𝐶, (◡𝐹‘𝐷)})–1-1-onto→(𝐴 ∖ {𝐶, (◡𝐹‘𝐷)}) ∧ {⟨𝐶, (◡𝐹‘𝐷)⟩, ⟨(◡𝐹‘𝐷), 𝐶⟩}:{𝐶, (◡𝐹‘𝐷)}–1-1-onto→{𝐶, (◡𝐹‘𝐷)}) ∧ (((𝐴 ∖ {𝐶, (◡𝐹‘𝐷)}) ∩ {𝐶, (◡𝐹‘𝐷)}) = ∅ ∧ ((𝐴 ∖ {𝐶, (◡𝐹‘𝐷)}) ∩ {𝐶, (◡𝐹‘𝐷)}) = ∅)) → (( I ↾ (𝐴 ∖ {𝐶, (◡𝐹‘𝐷)})) ∪ {⟨𝐶, (◡𝐹‘𝐷)⟩, ⟨(◡𝐹‘𝐷), 𝐶⟩}):((𝐴 ∖ {𝐶, (◡𝐹‘𝐷)}) ∪ {𝐶, (◡𝐹‘𝐷)})–1-1-onto→((𝐴 ∖ {𝐶, (◡𝐹‘𝐷)}) ∪ {𝐶, (◡𝐹‘𝐷)}))
15	3, 11, 13, 13, 14	syl22anc 837	. . . . . 6 ⊢ ((𝐹:𝐴–1-1-onto→𝐵 ∧ 𝐶 ∈ 𝐴 ∧ 𝐷 ∈ 𝐵) → (( I ↾ (𝐴 ∖ {𝐶, (◡𝐹‘𝐷)})) ∪ {⟨𝐶, (◡𝐹‘𝐷)⟩, ⟨(◡𝐹‘𝐷), 𝐶⟩}):((𝐴 ∖ {𝐶, (◡𝐹‘𝐷)}) ∪ {𝐶, (◡𝐹‘𝐷)})–1-1-onto→((𝐴 ∖ {𝐶, (◡𝐹‘𝐷)}) ∪ {𝐶, (◡𝐹‘𝐷)}))
16		uncom 4118	. . . . . . . 8 ⊢ ((𝐴 ∖ {𝐶, (◡𝐹‘𝐷)}) ∪ {𝐶, (◡𝐹‘𝐷)}) = ({𝐶, (◡𝐹‘𝐷)} ∪ (𝐴 ∖ {𝐶, (◡𝐹‘𝐷)}))
17	4, 9	prssd 4787	. . . . . . . . 9 ⊢ ((𝐹:𝐴–1-1-onto→𝐵 ∧ 𝐶 ∈ 𝐴 ∧ 𝐷 ∈ 𝐵) → {𝐶, (◡𝐹‘𝐷)} ⊆ 𝐴)
18		undif 4446	. . . . . . . . 9 ⊢ ({𝐶, (◡𝐹‘𝐷)} ⊆ 𝐴 ↔ ({𝐶, (◡𝐹‘𝐷)} ∪ (𝐴 ∖ {𝐶, (◡𝐹‘𝐷)})) = 𝐴)
19	17, 18	sylib 217	. . . . . . . 8 ⊢ ((𝐹:𝐴–1-1-onto→𝐵 ∧ 𝐶 ∈ 𝐴 ∧ 𝐷 ∈ 𝐵) → ({𝐶, (◡𝐹‘𝐷)} ∪ (𝐴 ∖ {𝐶, (◡𝐹‘𝐷)})) = 𝐴)
20	16, 19	eqtrid 2783	. . . . . . 7 ⊢ ((𝐹:𝐴–1-1-onto→𝐵 ∧ 𝐶 ∈ 𝐴 ∧ 𝐷 ∈ 𝐵) → ((𝐴 ∖ {𝐶, (◡𝐹‘𝐷)}) ∪ {𝐶, (◡𝐹‘𝐷)}) = 𝐴)
21	20	f1oeq2d 6785	. . . . . 6 ⊢ ((𝐹:𝐴–1-1-onto→𝐵 ∧ 𝐶 ∈ 𝐴 ∧ 𝐷 ∈ 𝐵) → ((( I ↾ (𝐴 ∖ {𝐶, (◡𝐹‘𝐷)})) ∪ {⟨𝐶, (◡𝐹‘𝐷)⟩, ⟨(◡𝐹‘𝐷), 𝐶⟩}):((𝐴 ∖ {𝐶, (◡𝐹‘𝐷)}) ∪ {𝐶, (◡𝐹‘𝐷)})–1-1-onto→((𝐴 ∖ {𝐶, (◡𝐹‘𝐷)}) ∪ {𝐶, (◡𝐹‘𝐷)}) ↔ (( I ↾ (𝐴 ∖ {𝐶, (◡𝐹‘𝐷)})) ∪ {⟨𝐶, (◡𝐹‘𝐷)⟩, ⟨(◡𝐹‘𝐷), 𝐶⟩}):𝐴–1-1-onto→((𝐴 ∖ {𝐶, (◡𝐹‘𝐷)}) ∪ {𝐶, (◡𝐹‘𝐷)})))
22	15, 21	mpbid 231	. . . . 5 ⊢ ((𝐹:𝐴–1-1-onto→𝐵 ∧ 𝐶 ∈ 𝐴 ∧ 𝐷 ∈ 𝐵) → (( I ↾ (𝐴 ∖ {𝐶, (◡𝐹‘𝐷)})) ∪ {⟨𝐶, (◡𝐹‘𝐷)⟩, ⟨(◡𝐹‘𝐷), 𝐶⟩}):𝐴–1-1-onto→((𝐴 ∖ {𝐶, (◡𝐹‘𝐷)}) ∪ {𝐶, (◡𝐹‘𝐷)}))
23	20	f1oeq3d 6786	. . . . 5 ⊢ ((𝐹:𝐴–1-1-onto→𝐵 ∧ 𝐶 ∈ 𝐴 ∧ 𝐷 ∈ 𝐵) → ((( I ↾ (𝐴 ∖ {𝐶, (◡𝐹‘𝐷)})) ∪ {⟨𝐶, (◡𝐹‘𝐷)⟩, ⟨(◡𝐹‘𝐷), 𝐶⟩}):𝐴–1-1-onto→((𝐴 ∖ {𝐶, (◡𝐹‘𝐷)}) ∪ {𝐶, (◡𝐹‘𝐷)}) ↔ (( I ↾ (𝐴 ∖ {𝐶, (◡𝐹‘𝐷)})) ∪ {⟨𝐶, (◡𝐹‘𝐷)⟩, ⟨(◡𝐹‘𝐷), 𝐶⟩}):𝐴–1-1-onto→𝐴))
24	22, 23	mpbid 231	. . . 4 ⊢ ((𝐹:𝐴–1-1-onto→𝐵 ∧ 𝐶 ∈ 𝐴 ∧ 𝐷 ∈ 𝐵) → (( I ↾ (𝐴 ∖ {𝐶, (◡𝐹‘𝐷)})) ∪ {⟨𝐶, (◡𝐹‘𝐷)⟩, ⟨(◡𝐹‘𝐷), 𝐶⟩}):𝐴–1-1-onto→𝐴)
25		f1oco 6812	. . . 4 ⊢ ((𝐹:𝐴–1-1-onto→𝐵 ∧ (( I ↾ (𝐴 ∖ {𝐶, (◡𝐹‘𝐷)})) ∪ {⟨𝐶, (◡𝐹‘𝐷)⟩, ⟨(◡𝐹‘𝐷), 𝐶⟩}):𝐴–1-1-onto→𝐴) → (𝐹 ∘ (( I ↾ (𝐴 ∖ {𝐶, (◡𝐹‘𝐷)})) ∪ {⟨𝐶, (◡𝐹‘𝐷)⟩, ⟨(◡𝐹‘𝐷), 𝐶⟩})):𝐴–1-1-onto→𝐵)
26	1, 24, 25	syl2anc 584	. . 3 ⊢ ((𝐹:𝐴–1-1-onto→𝐵 ∧ 𝐶 ∈ 𝐴 ∧ 𝐷 ∈ 𝐵) → (𝐹 ∘ (( I ↾ (𝐴 ∖ {𝐶, (◡𝐹‘𝐷)})) ∪ {⟨𝐶, (◡𝐹‘𝐷)⟩, ⟨(◡𝐹‘𝐷), 𝐶⟩})):𝐴–1-1-onto→𝐵)
27		fveqf1o.1	. . . 4 ⊢ 𝐺 = (𝐹 ∘ (( I ↾ (𝐴 ∖ {𝐶, (◡𝐹‘𝐷)})) ∪ {⟨𝐶, (◡𝐹‘𝐷)⟩, ⟨(◡𝐹‘𝐷), 𝐶⟩}))
28		f1oeq1 6777	. . . 4 ⊢ (𝐺 = (𝐹 ∘ (( I ↾ (𝐴 ∖ {𝐶, (◡𝐹‘𝐷)})) ∪ {⟨𝐶, (◡𝐹‘𝐷)⟩, ⟨(◡𝐹‘𝐷), 𝐶⟩})) → (𝐺:𝐴–1-1-onto→𝐵 ↔ (𝐹 ∘ (( I ↾ (𝐴 ∖ {𝐶, (◡𝐹‘𝐷)})) ∪ {⟨𝐶, (◡𝐹‘𝐷)⟩, ⟨(◡𝐹‘𝐷), 𝐶⟩})):𝐴–1-1-onto→𝐵))
29	27, 28	ax-mp 5	. . 3 ⊢ (𝐺:𝐴–1-1-onto→𝐵 ↔ (𝐹 ∘ (( I ↾ (𝐴 ∖ {𝐶, (◡𝐹‘𝐷)})) ∪ {⟨𝐶, (◡𝐹‘𝐷)⟩, ⟨(◡𝐹‘𝐷), 𝐶⟩})):𝐴–1-1-onto→𝐵)
30	26, 29	sylibr 233	. 2 ⊢ ((𝐹:𝐴–1-1-onto→𝐵 ∧ 𝐶 ∈ 𝐴 ∧ 𝐷 ∈ 𝐵) → 𝐺:𝐴–1-1-onto→𝐵)
31	27	fveq1i 6848	. . . 4 ⊢ (𝐺‘𝐶) = ((𝐹 ∘ (( I ↾ (𝐴 ∖ {𝐶, (◡𝐹‘𝐷)})) ∪ {⟨𝐶, (◡𝐹‘𝐷)⟩, ⟨(◡𝐹‘𝐷), 𝐶⟩}))‘𝐶)
32		f1of 6789	. . . . . 6 ⊢ ((( I ↾ (𝐴 ∖ {𝐶, (◡𝐹‘𝐷)})) ∪ {⟨𝐶, (◡𝐹‘𝐷)⟩, ⟨(◡𝐹‘𝐷), 𝐶⟩}):𝐴–1-1-onto→𝐴 → (( I ↾ (𝐴 ∖ {𝐶, (◡𝐹‘𝐷)})) ∪ {⟨𝐶, (◡𝐹‘𝐷)⟩, ⟨(◡𝐹‘𝐷), 𝐶⟩}):𝐴⟶𝐴)
33	24, 32	syl 17	. . . . 5 ⊢ ((𝐹:𝐴–1-1-onto→𝐵 ∧ 𝐶 ∈ 𝐴 ∧ 𝐷 ∈ 𝐵) → (( I ↾ (𝐴 ∖ {𝐶, (◡𝐹‘𝐷)})) ∪ {⟨𝐶, (◡𝐹‘𝐷)⟩, ⟨(◡𝐹‘𝐷), 𝐶⟩}):𝐴⟶𝐴)
34		fvco3 6945	. . . . 5 ⊢ (((( I ↾ (𝐴 ∖ {𝐶, (◡𝐹‘𝐷)})) ∪ {⟨𝐶, (◡𝐹‘𝐷)⟩, ⟨(◡𝐹‘𝐷), 𝐶⟩}):𝐴⟶𝐴 ∧ 𝐶 ∈ 𝐴) → ((𝐹 ∘ (( I ↾ (𝐴 ∖ {𝐶, (◡𝐹‘𝐷)})) ∪ {⟨𝐶, (◡𝐹‘𝐷)⟩, ⟨(◡𝐹‘𝐷), 𝐶⟩}))‘𝐶) = (𝐹‘((( I ↾ (𝐴 ∖ {𝐶, (◡𝐹‘𝐷)})) ∪ {⟨𝐶, (◡𝐹‘𝐷)⟩, ⟨(◡𝐹‘𝐷), 𝐶⟩})‘𝐶)))
35	33, 4, 34	syl2anc 584	. . . 4 ⊢ ((𝐹:𝐴–1-1-onto→𝐵 ∧ 𝐶 ∈ 𝐴 ∧ 𝐷 ∈ 𝐵) → ((𝐹 ∘ (( I ↾ (𝐴 ∖ {𝐶, (◡𝐹‘𝐷)})) ∪ {⟨𝐶, (◡𝐹‘𝐷)⟩, ⟨(◡𝐹‘𝐷), 𝐶⟩}))‘𝐶) = (𝐹‘((( I ↾ (𝐴 ∖ {𝐶, (◡𝐹‘𝐷)})) ∪ {⟨𝐶, (◡𝐹‘𝐷)⟩, ⟨(◡𝐹‘𝐷), 𝐶⟩})‘𝐶)))
36	31, 35	eqtrid 2783	. . 3 ⊢ ((𝐹:𝐴–1-1-onto→𝐵 ∧ 𝐶 ∈ 𝐴 ∧ 𝐷 ∈ 𝐵) → (𝐺‘𝐶) = (𝐹‘((( I ↾ (𝐴 ∖ {𝐶, (◡𝐹‘𝐷)})) ∪ {⟨𝐶, (◡𝐹‘𝐷)⟩, ⟨(◡𝐹‘𝐷), 𝐶⟩})‘𝐶)))
37		fnresi 6635	. . . . . . . 8 ⊢ ( I ↾ (𝐴 ∖ {𝐶, (◡𝐹‘𝐷)})) Fn (𝐴 ∖ {𝐶, (◡𝐹‘𝐷)})
38	37	a1i 11	. . . . . . 7 ⊢ ((𝐹:𝐴–1-1-onto→𝐵 ∧ 𝐶 ∈ 𝐴 ∧ 𝐷 ∈ 𝐵) → ( I ↾ (𝐴 ∖ {𝐶, (◡𝐹‘𝐷)})) Fn (𝐴 ∖ {𝐶, (◡𝐹‘𝐷)}))
39		f1ofn 6790	. . . . . . . 8 ⊢ ({⟨𝐶, (◡𝐹‘𝐷)⟩, ⟨(◡𝐹‘𝐷), 𝐶⟩}:{𝐶, (◡𝐹‘𝐷)}–1-1-onto→{𝐶, (◡𝐹‘𝐷)} → {⟨𝐶, (◡𝐹‘𝐷)⟩, ⟨(◡𝐹‘𝐷), 𝐶⟩} Fn {𝐶, (◡𝐹‘𝐷)})
40	11, 39	syl 17	. . . . . . 7 ⊢ ((𝐹:𝐴–1-1-onto→𝐵 ∧ 𝐶 ∈ 𝐴 ∧ 𝐷 ∈ 𝐵) → {⟨𝐶, (◡𝐹‘𝐷)⟩, ⟨(◡𝐹‘𝐷), 𝐶⟩} Fn {𝐶, (◡𝐹‘𝐷)})
41		prid1g 4726	. . . . . . . 8 ⊢ (𝐶 ∈ 𝐴 → 𝐶 ∈ {𝐶, (◡𝐹‘𝐷)})
42	4, 41	syl 17	. . . . . . 7 ⊢ ((𝐹:𝐴–1-1-onto→𝐵 ∧ 𝐶 ∈ 𝐴 ∧ 𝐷 ∈ 𝐵) → 𝐶 ∈ {𝐶, (◡𝐹‘𝐷)})
43		fvun2 6938	. . . . . . 7 ⊢ ((( I ↾ (𝐴 ∖ {𝐶, (◡𝐹‘𝐷)})) Fn (𝐴 ∖ {𝐶, (◡𝐹‘𝐷)}) ∧ {⟨𝐶, (◡𝐹‘𝐷)⟩, ⟨(◡𝐹‘𝐷), 𝐶⟩} Fn {𝐶, (◡𝐹‘𝐷)} ∧ (((𝐴 ∖ {𝐶, (◡𝐹‘𝐷)}) ∩ {𝐶, (◡𝐹‘𝐷)}) = ∅ ∧ 𝐶 ∈ {𝐶, (◡𝐹‘𝐷)})) → ((( I ↾ (𝐴 ∖ {𝐶, (◡𝐹‘𝐷)})) ∪ {⟨𝐶, (◡𝐹‘𝐷)⟩, ⟨(◡𝐹‘𝐷), 𝐶⟩})‘𝐶) = ({⟨𝐶, (◡𝐹‘𝐷)⟩, ⟨(◡𝐹‘𝐷), 𝐶⟩}‘𝐶))
44	38, 40, 13, 42, 43	syl112anc 1374	. . . . . 6 ⊢ ((𝐹:𝐴–1-1-onto→𝐵 ∧ 𝐶 ∈ 𝐴 ∧ 𝐷 ∈ 𝐵) → ((( I ↾ (𝐴 ∖ {𝐶, (◡𝐹‘𝐷)})) ∪ {⟨𝐶, (◡𝐹‘𝐷)⟩, ⟨(◡𝐹‘𝐷), 𝐶⟩})‘𝐶) = ({⟨𝐶, (◡𝐹‘𝐷)⟩, ⟨(◡𝐹‘𝐷), 𝐶⟩}‘𝐶))
45		f1ofun 6791	. . . . . . . 8 ⊢ ({⟨𝐶, (◡𝐹‘𝐷)⟩, ⟨(◡𝐹‘𝐷), 𝐶⟩}:{𝐶, (◡𝐹‘𝐷)}–1-1-onto→{𝐶, (◡𝐹‘𝐷)} → Fun {⟨𝐶, (◡𝐹‘𝐷)⟩, ⟨(◡𝐹‘𝐷), 𝐶⟩})
46	11, 45	syl 17	. . . . . . 7 ⊢ ((𝐹:𝐴–1-1-onto→𝐵 ∧ 𝐶 ∈ 𝐴 ∧ 𝐷 ∈ 𝐵) → Fun {⟨𝐶, (◡𝐹‘𝐷)⟩, ⟨(◡𝐹‘𝐷), 𝐶⟩})
47		opex 5426	. . . . . . . 8 ⊢ ⟨𝐶, (◡𝐹‘𝐷)⟩ ∈ V
48	47	prid1 4728	. . . . . . 7 ⊢ ⟨𝐶, (◡𝐹‘𝐷)⟩ ∈ {⟨𝐶, (◡𝐹‘𝐷)⟩, ⟨(◡𝐹‘𝐷), 𝐶⟩}
49		funopfv 6899	. . . . . . 7 ⊢ (Fun {⟨𝐶, (◡𝐹‘𝐷)⟩, ⟨(◡𝐹‘𝐷), 𝐶⟩} → (⟨𝐶, (◡𝐹‘𝐷)⟩ ∈ {⟨𝐶, (◡𝐹‘𝐷)⟩, ⟨(◡𝐹‘𝐷), 𝐶⟩} → ({⟨𝐶, (◡𝐹‘𝐷)⟩, ⟨(◡𝐹‘𝐷), 𝐶⟩}‘𝐶) = (◡𝐹‘𝐷)))
50	46, 48, 49	mpisyl 21	. . . . . 6 ⊢ ((𝐹:𝐴–1-1-onto→𝐵 ∧ 𝐶 ∈ 𝐴 ∧ 𝐷 ∈ 𝐵) → ({⟨𝐶, (◡𝐹‘𝐷)⟩, ⟨(◡𝐹‘𝐷), 𝐶⟩}‘𝐶) = (◡𝐹‘𝐷))
51	44, 50	eqtrd 2771	. . . . 5 ⊢ ((𝐹:𝐴–1-1-onto→𝐵 ∧ 𝐶 ∈ 𝐴 ∧ 𝐷 ∈ 𝐵) → ((( I ↾ (𝐴 ∖ {𝐶, (◡𝐹‘𝐷)})) ∪ {⟨𝐶, (◡𝐹‘𝐷)⟩, ⟨(◡𝐹‘𝐷), 𝐶⟩})‘𝐶) = (◡𝐹‘𝐷))
52	51	fveq2d 6851	. . . 4 ⊢ ((𝐹:𝐴–1-1-onto→𝐵 ∧ 𝐶 ∈ 𝐴 ∧ 𝐷 ∈ 𝐵) → (𝐹‘((( I ↾ (𝐴 ∖ {𝐶, (◡𝐹‘𝐷)})) ∪ {⟨𝐶, (◡𝐹‘𝐷)⟩, ⟨(◡𝐹‘𝐷), 𝐶⟩})‘𝐶)) = (𝐹‘(◡𝐹‘𝐷)))
53		f1ocnvfv2 7228	. . . . 5 ⊢ ((𝐹:𝐴–1-1-onto→𝐵 ∧ 𝐷 ∈ 𝐵) → (𝐹‘(◡𝐹‘𝐷)) = 𝐷)
54	1, 8, 53	syl2anc 584	. . . 4 ⊢ ((𝐹:𝐴–1-1-onto→𝐵 ∧ 𝐶 ∈ 𝐴 ∧ 𝐷 ∈ 𝐵) → (𝐹‘(◡𝐹‘𝐷)) = 𝐷)
55	52, 54	eqtrd 2771	. . 3 ⊢ ((𝐹:𝐴–1-1-onto→𝐵 ∧ 𝐶 ∈ 𝐴 ∧ 𝐷 ∈ 𝐵) → (𝐹‘((( I ↾ (𝐴 ∖ {𝐶, (◡𝐹‘𝐷)})) ∪ {⟨𝐶, (◡𝐹‘𝐷)⟩, ⟨(◡𝐹‘𝐷), 𝐶⟩})‘𝐶)) = 𝐷)
56	36, 55	eqtrd 2771	. 2 ⊢ ((𝐹:𝐴–1-1-onto→𝐵 ∧ 𝐶 ∈ 𝐴 ∧ 𝐷 ∈ 𝐵) → (𝐺‘𝐶) = 𝐷)
57	30, 56	jca 512	1 ⊢ ((𝐹:𝐴–1-1-onto→𝐵 ∧ 𝐶 ∈ 𝐴 ∧ 𝐷 ∈ 𝐵) → (𝐺:𝐴–1-1-onto→𝐵 ∧ (𝐺‘𝐶) = 𝐷))

Syntax hints:   → wi 4   ↔ wb 205   ∧ wa 396   ∧ w3a 1087   = wceq 1541   ∈ wcel 2106   ∖ cdif 3910   ∪ cun 3911   ∩ cin 3912   ⊆ wss 3913  ∅c0 4287  {cpr 4593  ⟨cop 4597   I cid 5535  ^◡ccnv 5637   ↾ cres 5640   ∘ ccom 5642  Fun wfun 6495   Fn wfn 6496  ⟶wf 6497  –1-1-onto→wf1o 6500  ‘cfv 6501

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 2702  ax-sep 5261  ax-nul 5268  ax-pr 5389

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 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-rab 3406  df-v 3448  df-dif 3916  df-un 3918  df-in 3920  df-ss 3930  df-nul 4288  df-if 4492  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4871  df-br 5111  df-opab 5173  df-id 5536  df-xp 5644  df-rel 5645  df-cnv 5646  df-co 5647  df-dm 5648  df-rn 5649  df-res 5650  df-ima 5651  df-iota 6453  df-fun 6503  df-fn 6504  df-f 6505  df-f1 6506  df-fo 6507  df-f1o 6508  df-fv 6509

This theorem is referenced by:  infxpenc2  9967