Theorem f1ofvswap 7254

Description: Swapping two values in a bijection between two classes yields another bijection between those classes. (Contributed by BTernaryTau, 31-Aug-2024.)

Assertion

Ref	Expression
f1ofvswap	⊢ ((𝐹:𝐴–1-1-onto→𝐵 ∧ 𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝐴) → ((𝐹 ↾ (𝐴 ∖ {𝑋, 𝑌})) ∪ {⟨𝑋, (𝐹‘𝑌)⟩, ⟨𝑌, (𝐹‘𝑋)⟩}):𝐴–1-1-onto→𝐵)

Proof of Theorem f1ofvswap

Step	Hyp	Ref	Expression
1		f1oi 6809	. . . . . 6 ⊢ ( I ↾ (𝐴 ∖ {𝑋, 𝑌})):(𝐴 ∖ {𝑋, 𝑌})–1-1-onto→(𝐴 ∖ {𝑋, 𝑌})
2		f1oprswap 6816	. . . . . 6 ⊢ ((𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝐴) → {⟨𝑋, 𝑌⟩, ⟨𝑌, 𝑋⟩}:{𝑋, 𝑌}–1-1-onto→{𝑋, 𝑌})
3		disjdifr 4404	. . . . . . 7 ⊢ ((𝐴 ∖ {𝑋, 𝑌}) ∩ {𝑋, 𝑌}) = ∅
4		f1oun 6790	. . . . . . 7 ⊢ (((( I ↾ (𝐴 ∖ {𝑋, 𝑌})):(𝐴 ∖ {𝑋, 𝑌})–1-1-onto→(𝐴 ∖ {𝑋, 𝑌}) ∧ {⟨𝑋, 𝑌⟩, ⟨𝑌, 𝑋⟩}:{𝑋, 𝑌}–1-1-onto→{𝑋, 𝑌}) ∧ (((𝐴 ∖ {𝑋, 𝑌}) ∩ {𝑋, 𝑌}) = ∅ ∧ ((𝐴 ∖ {𝑋, 𝑌}) ∩ {𝑋, 𝑌}) = ∅)) → (( I ↾ (𝐴 ∖ {𝑋, 𝑌})) ∪ {⟨𝑋, 𝑌⟩, ⟨𝑌, 𝑋⟩}):((𝐴 ∖ {𝑋, 𝑌}) ∪ {𝑋, 𝑌})–1-1-onto→((𝐴 ∖ {𝑋, 𝑌}) ∪ {𝑋, 𝑌}))
5	3, 3, 4	mpanr12 712	. . . . . 6 ⊢ ((( I ↾ (𝐴 ∖ {𝑋, 𝑌})):(𝐴 ∖ {𝑋, 𝑌})–1-1-onto→(𝐴 ∖ {𝑋, 𝑌}) ∧ {⟨𝑋, 𝑌⟩, ⟨𝑌, 𝑋⟩}:{𝑋, 𝑌}–1-1-onto→{𝑋, 𝑌}) → (( I ↾ (𝐴 ∖ {𝑋, 𝑌})) ∪ {⟨𝑋, 𝑌⟩, ⟨𝑌, 𝑋⟩}):((𝐴 ∖ {𝑋, 𝑌}) ∪ {𝑋, 𝑌})–1-1-onto→((𝐴 ∖ {𝑋, 𝑌}) ∪ {𝑋, 𝑌}))
6	1, 2, 5	sylancr 594	. . . . 5 ⊢ ((𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝐴) → (( I ↾ (𝐴 ∖ {𝑋, 𝑌})) ∪ {⟨𝑋, 𝑌⟩, ⟨𝑌, 𝑋⟩}):((𝐴 ∖ {𝑋, 𝑌}) ∪ {𝑋, 𝑌})–1-1-onto→((𝐴 ∖ {𝑋, 𝑌}) ∪ {𝑋, 𝑌}))
7		prssi 4755	. . . . . . 7 ⊢ ((𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝐴) → {𝑋, 𝑌} ⊆ 𝐴)
8		undifr 4414	. . . . . . 7 ⊢ ({𝑋, 𝑌} ⊆ 𝐴 ↔ ((𝐴 ∖ {𝑋, 𝑌}) ∪ {𝑋, 𝑌}) = 𝐴)
9	7, 8	sylib 220	. . . . . 6 ⊢ ((𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝐴) → ((𝐴 ∖ {𝑋, 𝑌}) ∪ {𝑋, 𝑌}) = 𝐴)
10		f1oeq23 6762	. . . . . 6 ⊢ ((((𝐴 ∖ {𝑋, 𝑌}) ∪ {𝑋, 𝑌}) = 𝐴 ∧ ((𝐴 ∖ {𝑋, 𝑌}) ∪ {𝑋, 𝑌}) = 𝐴) → ((( I ↾ (𝐴 ∖ {𝑋, 𝑌})) ∪ {⟨𝑋, 𝑌⟩, ⟨𝑌, 𝑋⟩}):((𝐴 ∖ {𝑋, 𝑌}) ∪ {𝑋, 𝑌})–1-1-onto→((𝐴 ∖ {𝑋, 𝑌}) ∪ {𝑋, 𝑌}) ↔ (( I ↾ (𝐴 ∖ {𝑋, 𝑌})) ∪ {⟨𝑋, 𝑌⟩, ⟨𝑌, 𝑋⟩}):𝐴–1-1-onto→𝐴))
11	9, 9, 10	syl2anc 591	. . . . 5 ⊢ ((𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝐴) → ((( I ↾ (𝐴 ∖ {𝑋, 𝑌})) ∪ {⟨𝑋, 𝑌⟩, ⟨𝑌, 𝑋⟩}):((𝐴 ∖ {𝑋, 𝑌}) ∪ {𝑋, 𝑌})–1-1-onto→((𝐴 ∖ {𝑋, 𝑌}) ∪ {𝑋, 𝑌}) ↔ (( I ↾ (𝐴 ∖ {𝑋, 𝑌})) ∪ {⟨𝑋, 𝑌⟩, ⟨𝑌, 𝑋⟩}):𝐴–1-1-onto→𝐴))
12	6, 11	mpbid 234	. . . 4 ⊢ ((𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝐴) → (( I ↾ (𝐴 ∖ {𝑋, 𝑌})) ∪ {⟨𝑋, 𝑌⟩, ⟨𝑌, 𝑋⟩}):𝐴–1-1-onto→𝐴)
13		f1oco 6794	. . . 4 ⊢ ((𝐹:𝐴–1-1-onto→𝐵 ∧ (( I ↾ (𝐴 ∖ {𝑋, 𝑌})) ∪ {⟨𝑋, 𝑌⟩, ⟨𝑌, 𝑋⟩}):𝐴–1-1-onto→𝐴) → (𝐹 ∘ (( I ↾ (𝐴 ∖ {𝑋, 𝑌})) ∪ {⟨𝑋, 𝑌⟩, ⟨𝑌, 𝑋⟩})):𝐴–1-1-onto→𝐵)
14	12, 13	sylan2 600	. . 3 ⊢ ((𝐹:𝐴–1-1-onto→𝐵 ∧ (𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝐴)) → (𝐹 ∘ (( I ↾ (𝐴 ∖ {𝑋, 𝑌})) ∪ {⟨𝑋, 𝑌⟩, ⟨𝑌, 𝑋⟩})):𝐴–1-1-onto→𝐵)
15	14	3impb 1121	. 2 ⊢ ((𝐹:𝐴–1-1-onto→𝐵 ∧ 𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝐴) → (𝐹 ∘ (( I ↾ (𝐴 ∖ {𝑋, 𝑌})) ∪ {⟨𝑋, 𝑌⟩, ⟨𝑌, 𝑋⟩})):𝐴–1-1-onto→𝐵)
16		f1ofn 6772	. . . 4 ⊢ (𝐹:𝐴–1-1-onto→𝐵 → 𝐹 Fn 𝐴)
17		coundi 6202	. . . . . 6 ⊢ (𝐹 ∘ (( I ↾ (𝐴 ∖ {𝑋, 𝑌})) ∪ {⟨𝑋, 𝑌⟩, ⟨𝑌, 𝑋⟩})) = ((𝐹 ∘ ( I ↾ (𝐴 ∖ {𝑋, 𝑌}))) ∪ (𝐹 ∘ {⟨𝑋, 𝑌⟩, ⟨𝑌, 𝑋⟩}))
18		fcoconst 7080	. . . . . . . . . . 11 ⊢ ((𝐹 Fn 𝐴 ∧ 𝑌 ∈ 𝐴) → (𝐹 ∘ ({𝑋} × {𝑌})) = ({𝑋} × {(𝐹‘𝑌)}))
19	18	3adant2 1138	. . . . . . . . . 10 ⊢ ((𝐹 Fn 𝐴 ∧ 𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝐴) → (𝐹 ∘ ({𝑋} × {𝑌})) = ({𝑋} × {(𝐹‘𝑌)}))
20		xpsng 7085	. . . . . . . . . . . 12 ⊢ ((𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝐴) → ({𝑋} × {𝑌}) = {⟨𝑋, 𝑌⟩})
21	20	coeq2d 5807	. . . . . . . . . . 11 ⊢ ((𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝐴) → (𝐹 ∘ ({𝑋} × {𝑌})) = (𝐹 ∘ {⟨𝑋, 𝑌⟩}))
22	21	3adant1 1137	. . . . . . . . . 10 ⊢ ((𝐹 Fn 𝐴 ∧ 𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝐴) → (𝐹 ∘ ({𝑋} × {𝑌})) = (𝐹 ∘ {⟨𝑋, 𝑌⟩}))
23		fvex 6844	. . . . . . . . . . . 12 ⊢ (𝐹‘𝑌) ∈ V
24		xpsng 7085	. . . . . . . . . . . 12 ⊢ ((𝑋 ∈ 𝐴 ∧ (𝐹‘𝑌) ∈ V) → ({𝑋} × {(𝐹‘𝑌)}) = {⟨𝑋, (𝐹‘𝑌)⟩})
25	23, 24	mpan2 698	. . . . . . . . . . 11 ⊢ (𝑋 ∈ 𝐴 → ({𝑋} × {(𝐹‘𝑌)}) = {⟨𝑋, (𝐹‘𝑌)⟩})
26	25	3ad2ant2 1141	. . . . . . . . . 10 ⊢ ((𝐹 Fn 𝐴 ∧ 𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝐴) → ({𝑋} × {(𝐹‘𝑌)}) = {⟨𝑋, (𝐹‘𝑌)⟩})
27	19, 22, 26	3eqtr3d 2784	. . . . . . . . 9 ⊢ ((𝐹 Fn 𝐴 ∧ 𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝐴) → (𝐹 ∘ {⟨𝑋, 𝑌⟩}) = {⟨𝑋, (𝐹‘𝑌)⟩})
28		fcoconst 7080	. . . . . . . . . . 11 ⊢ ((𝐹 Fn 𝐴 ∧ 𝑋 ∈ 𝐴) → (𝐹 ∘ ({𝑌} × {𝑋})) = ({𝑌} × {(𝐹‘𝑋)}))
29	28	3adant3 1139	. . . . . . . . . 10 ⊢ ((𝐹 Fn 𝐴 ∧ 𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝐴) → (𝐹 ∘ ({𝑌} × {𝑋})) = ({𝑌} × {(𝐹‘𝑋)}))
30		xpsng 7085	. . . . . . . . . . . . 13 ⊢ ((𝑌 ∈ 𝐴 ∧ 𝑋 ∈ 𝐴) → ({𝑌} × {𝑋}) = {⟨𝑌, 𝑋⟩})
31	30	coeq2d 5807	. . . . . . . . . . . 12 ⊢ ((𝑌 ∈ 𝐴 ∧ 𝑋 ∈ 𝐴) → (𝐹 ∘ ({𝑌} × {𝑋})) = (𝐹 ∘ {⟨𝑌, 𝑋⟩}))
32	31	ancoms 460	. . . . . . . . . . 11 ⊢ ((𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝐴) → (𝐹 ∘ ({𝑌} × {𝑋})) = (𝐹 ∘ {⟨𝑌, 𝑋⟩}))
33	32	3adant1 1137	. . . . . . . . . 10 ⊢ ((𝐹 Fn 𝐴 ∧ 𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝐴) → (𝐹 ∘ ({𝑌} × {𝑋})) = (𝐹 ∘ {⟨𝑌, 𝑋⟩}))
34		fvex 6844	. . . . . . . . . . . 12 ⊢ (𝐹‘𝑋) ∈ V
35		xpsng 7085	. . . . . . . . . . . 12 ⊢ ((𝑌 ∈ 𝐴 ∧ (𝐹‘𝑋) ∈ V) → ({𝑌} × {(𝐹‘𝑋)}) = {⟨𝑌, (𝐹‘𝑋)⟩})
36	34, 35	mpan2 698	. . . . . . . . . . 11 ⊢ (𝑌 ∈ 𝐴 → ({𝑌} × {(𝐹‘𝑋)}) = {⟨𝑌, (𝐹‘𝑋)⟩})
37	36	3ad2ant3 1142	. . . . . . . . . 10 ⊢ ((𝐹 Fn 𝐴 ∧ 𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝐴) → ({𝑌} × {(𝐹‘𝑋)}) = {⟨𝑌, (𝐹‘𝑋)⟩})
38	29, 33, 37	3eqtr3d 2784	. . . . . . . . 9 ⊢ ((𝐹 Fn 𝐴 ∧ 𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝐴) → (𝐹 ∘ {⟨𝑌, 𝑋⟩}) = {⟨𝑌, (𝐹‘𝑋)⟩})
39	27, 38	uneq12d 4102	. . . . . . . 8 ⊢ ((𝐹 Fn 𝐴 ∧ 𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝐴) → ((𝐹 ∘ {⟨𝑋, 𝑌⟩}) ∪ (𝐹 ∘ {⟨𝑌, 𝑋⟩})) = ({⟨𝑋, (𝐹‘𝑌)⟩} ∪ {⟨𝑌, (𝐹‘𝑋)⟩}))
40		df-pr 4561	. . . . . . . . . 10 ⊢ {⟨𝑋, 𝑌⟩, ⟨𝑌, 𝑋⟩} = ({⟨𝑋, 𝑌⟩} ∪ {⟨𝑌, 𝑋⟩})
41	40	coeq2i 5805	. . . . . . . . 9 ⊢ (𝐹 ∘ {⟨𝑋, 𝑌⟩, ⟨𝑌, 𝑋⟩}) = (𝐹 ∘ ({⟨𝑋, 𝑌⟩} ∪ {⟨𝑌, 𝑋⟩}))
42		coundi 6202	. . . . . . . . 9 ⊢ (𝐹 ∘ ({⟨𝑋, 𝑌⟩} ∪ {⟨𝑌, 𝑋⟩})) = ((𝐹 ∘ {⟨𝑋, 𝑌⟩}) ∪ (𝐹 ∘ {⟨𝑌, 𝑋⟩}))
43	41, 42	eqtri 2764	. . . . . . . 8 ⊢ (𝐹 ∘ {⟨𝑋, 𝑌⟩, ⟨𝑌, 𝑋⟩}) = ((𝐹 ∘ {⟨𝑋, 𝑌⟩}) ∪ (𝐹 ∘ {⟨𝑌, 𝑋⟩}))
44		df-pr 4561	. . . . . . . 8 ⊢ {⟨𝑋, (𝐹‘𝑌)⟩, ⟨𝑌, (𝐹‘𝑋)⟩} = ({⟨𝑋, (𝐹‘𝑌)⟩} ∪ {⟨𝑌, (𝐹‘𝑋)⟩})
45	39, 43, 44	3eqtr4g 2801	. . . . . . 7 ⊢ ((𝐹 Fn 𝐴 ∧ 𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝐴) → (𝐹 ∘ {⟨𝑋, 𝑌⟩, ⟨𝑌, 𝑋⟩}) = {⟨𝑋, (𝐹‘𝑌)⟩, ⟨𝑌, (𝐹‘𝑋)⟩})
46	45	uneq2d 4101	. . . . . 6 ⊢ ((𝐹 Fn 𝐴 ∧ 𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝐴) → ((𝐹 ∘ ( I ↾ (𝐴 ∖ {𝑋, 𝑌}))) ∪ (𝐹 ∘ {⟨𝑋, 𝑌⟩, ⟨𝑌, 𝑋⟩})) = ((𝐹 ∘ ( I ↾ (𝐴 ∖ {𝑋, 𝑌}))) ∪ {⟨𝑋, (𝐹‘𝑌)⟩, ⟨𝑌, (𝐹‘𝑋)⟩}))
47	17, 46	eqtrid 2788	. . . . 5 ⊢ ((𝐹 Fn 𝐴 ∧ 𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝐴) → (𝐹 ∘ (( I ↾ (𝐴 ∖ {𝑋, 𝑌})) ∪ {⟨𝑋, 𝑌⟩, ⟨𝑌, 𝑋⟩})) = ((𝐹 ∘ ( I ↾ (𝐴 ∖ {𝑋, 𝑌}))) ∪ {⟨𝑋, (𝐹‘𝑌)⟩, ⟨𝑌, (𝐹‘𝑋)⟩}))
48		coires1 6220	. . . . . 6 ⊢ (𝐹 ∘ ( I ↾ (𝐴 ∖ {𝑋, 𝑌}))) = (𝐹 ↾ (𝐴 ∖ {𝑋, 𝑌}))
49	48	uneq1i 4097	. . . . 5 ⊢ ((𝐹 ∘ ( I ↾ (𝐴 ∖ {𝑋, 𝑌}))) ∪ {⟨𝑋, (𝐹‘𝑌)⟩, ⟨𝑌, (𝐹‘𝑋)⟩}) = ((𝐹 ↾ (𝐴 ∖ {𝑋, 𝑌})) ∪ {⟨𝑋, (𝐹‘𝑌)⟩, ⟨𝑌, (𝐹‘𝑋)⟩})
50	47, 49	eqtrdi 2792	. . . 4 ⊢ ((𝐹 Fn 𝐴 ∧ 𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝐴) → (𝐹 ∘ (( I ↾ (𝐴 ∖ {𝑋, 𝑌})) ∪ {⟨𝑋, 𝑌⟩, ⟨𝑌, 𝑋⟩})) = ((𝐹 ↾ (𝐴 ∖ {𝑋, 𝑌})) ∪ {⟨𝑋, (𝐹‘𝑌)⟩, ⟨𝑌, (𝐹‘𝑋)⟩}))
51	16, 50	syl3an1 1170	. . 3 ⊢ ((𝐹:𝐴–1-1-onto→𝐵 ∧ 𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝐴) → (𝐹 ∘ (( I ↾ (𝐴 ∖ {𝑋, 𝑌})) ∪ {⟨𝑋, 𝑌⟩, ⟨𝑌, 𝑋⟩})) = ((𝐹 ↾ (𝐴 ∖ {𝑋, 𝑌})) ∪ {⟨𝑋, (𝐹‘𝑌)⟩, ⟨𝑌, (𝐹‘𝑋)⟩}))
52	51	f1oeq1d 6766	. 2 ⊢ ((𝐹:𝐴–1-1-onto→𝐵 ∧ 𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝐴) → ((𝐹 ∘ (( I ↾ (𝐴 ∖ {𝑋, 𝑌})) ∪ {⟨𝑋, 𝑌⟩, ⟨𝑌, 𝑋⟩})):𝐴–1-1-onto→𝐵 ↔ ((𝐹 ↾ (𝐴 ∖ {𝑋, 𝑌})) ∪ {⟨𝑋, (𝐹‘𝑌)⟩, ⟨𝑌, (𝐹‘𝑋)⟩}):𝐴–1-1-onto→𝐵))
53	15, 52	mpbid 234	1 ⊢ ((𝐹:𝐴–1-1-onto→𝐵 ∧ 𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝐴) → ((𝐹 ↾ (𝐴 ∖ {𝑋, 𝑌})) ∪ {⟨𝑋, (𝐹‘𝑌)⟩, ⟨𝑌, (𝐹‘𝑋)⟩}):𝐴–1-1-onto→𝐵)

Syntax hints:   → wi 4   ↔ wb 208   ∧ wa 397   ∧ w3a 1093   = wceq 1548   ∈ wcel 2121  Vcvv 3433   ∖ cdif 3882   ∪ cun 3883   ∩ cin 3884   ⊆ wss 3885  ∅c0 4264  {csn 4558  {cpr 4560  ⟨cop 4564   I cid 5515   × cxp 5619   ↾ cres 5623   ∘ ccom 5625   Fn wfn 6484  –1-1-onto→wf1o 6488  ‘cfv 6489

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1803  ax-4 1817  ax-5 1918  ax-6 1975  ax-7 2016  ax-8 2123  ax-9 2131  ax-10 2154  ax-11 2170  ax-12 2191  ax-ext 2713  ax-sep 5221  ax-nul 5231  ax-pr 5365

This theorem depends on definitions:  df-bi 209  df-an 398  df-or 855  df-3an 1095  df-tru 1551  df-fal 1561  df-ex 1788  df-nf 1792  df-sb 2075  df-mo 2545  df-eu 2575  df-clab 2720  df-cleq 2733  df-clel 2816  df-nfc 2890  df-ne 2937  df-ral 3056  df-rex 3066  df-reu 3347  df-rab 3394  df-v 3435  df-sbc 3726  df-csb 3834  df-dif 3888  df-un 3890  df-in 3892  df-ss 3902  df-nul 4265  df-if 4458  df-sn 4559  df-pr 4561  df-op 4565  df-uni 4842  df-br 5076  df-opab 5138  df-mpt 5157  df-id 5516  df-xp 5627  df-rel 5628  df-cnv 5629  df-co 5630  df-dm 5631  df-rn 5632  df-res 5633  df-ima 5634  df-iota 6445  df-fun 6491  df-fn 6492  df-f 6493  df-f1 6494  df-fo 6495  df-f1o 6496  df-fv 6497

This theorem is referenced by:  dif1en  9090  nregmodelf1o  45474