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

Theorem f1ofvswap 7314
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
StepHypRef Expression
1 f1oi 6863 . . . . . 6 ( I ↾ (𝐴 ∖ {𝑋, 𝑌})):(𝐴 ∖ {𝑋, 𝑌})–1-1-onto→(𝐴 ∖ {𝑋, 𝑌})
2 f1oprswap 6870 . . . . . 6 ((𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝐴) → {⟨𝑋, 𝑌⟩, ⟨𝑌, 𝑋⟩}:{𝑋, 𝑌}–1-1-onto→{𝑋, 𝑌})
3 disjdifr 4427 . . . . . . 7 ((𝐴 ∖ {𝑋, 𝑌}) ∩ {𝑋, 𝑌}) = ∅
4 f1oun 6844 . . . . . . 7 (((( I ↾ (𝐴 ∖ {𝑋, 𝑌})):(𝐴 ∖ {𝑋, 𝑌})–1-1-onto→(𝐴 ∖ {𝑋, 𝑌}) ∧ {⟨𝑋, 𝑌⟩, ⟨𝑌, 𝑋⟩}:{𝑋, 𝑌}–1-1-onto→{𝑋, 𝑌}) ∧ (((𝐴 ∖ {𝑋, 𝑌}) ∩ {𝑋, 𝑌}) = ∅ ∧ ((𝐴 ∖ {𝑋, 𝑌}) ∩ {𝑋, 𝑌}) = ∅)) → (( I ↾ (𝐴 ∖ {𝑋, 𝑌})) ∪ {⟨𝑋, 𝑌⟩, ⟨𝑌, 𝑋⟩}):((𝐴 ∖ {𝑋, 𝑌}) ∪ {𝑋, 𝑌})–1-1-onto→((𝐴 ∖ {𝑋, 𝑌}) ∪ {𝑋, 𝑌}))
53, 3, 4mpanr12 718 . . . . . 6 ((( I ↾ (𝐴 ∖ {𝑋, 𝑌})):(𝐴 ∖ {𝑋, 𝑌})–1-1-onto→(𝐴 ∖ {𝑋, 𝑌}) ∧ {⟨𝑋, 𝑌⟩, ⟨𝑌, 𝑋⟩}:{𝑋, 𝑌}–1-1-onto→{𝑋, 𝑌}) → (( I ↾ (𝐴 ∖ {𝑋, 𝑌})) ∪ {⟨𝑋, 𝑌⟩, ⟨𝑌, 𝑋⟩}):((𝐴 ∖ {𝑋, 𝑌}) ∪ {𝑋, 𝑌})–1-1-onto→((𝐴 ∖ {𝑋, 𝑌}) ∪ {𝑋, 𝑌}))
61, 2, 5sylancr 599 . . . . 5 ((𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝐴) → (( I ↾ (𝐴 ∖ {𝑋, 𝑌})) ∪ {⟨𝑋, 𝑌⟩, ⟨𝑌, 𝑋⟩}):((𝐴 ∖ {𝑋, 𝑌}) ∪ {𝑋, 𝑌})–1-1-onto→((𝐴 ∖ {𝑋, 𝑌}) ∪ {𝑋, 𝑌}))
7 prssi 4782 . . . . . . 7 ((𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝐴) → {𝑋, 𝑌} ⊆ 𝐴)
8 undifr 4439 . . . . . . 7 ({𝑋, 𝑌} ⊆ 𝐴 ↔ ((𝐴 ∖ {𝑋, 𝑌}) ∪ {𝑋, 𝑌}) = 𝐴)
97, 8sylib 221 . . . . . 6 ((𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝐴) → ((𝐴 ∖ {𝑋, 𝑌}) ∪ {𝑋, 𝑌}) = 𝐴)
10 f1oeq23 6815 . . . . . 6 ((((𝐴 ∖ {𝑋, 𝑌}) ∪ {𝑋, 𝑌}) = 𝐴 ∧ ((𝐴 ∖ {𝑋, 𝑌}) ∪ {𝑋, 𝑌}) = 𝐴) → ((( I ↾ (𝐴 ∖ {𝑋, 𝑌})) ∪ {⟨𝑋, 𝑌⟩, ⟨𝑌, 𝑋⟩}):((𝐴 ∖ {𝑋, 𝑌}) ∪ {𝑋, 𝑌})–1-1-onto→((𝐴 ∖ {𝑋, 𝑌}) ∪ {𝑋, 𝑌}) ↔ (( I ↾ (𝐴 ∖ {𝑋, 𝑌})) ∪ {⟨𝑋, 𝑌⟩, ⟨𝑌, 𝑋⟩}):𝐴–1-1-onto→𝐴))
119, 9, 10syl2anc 596 . . . . 5 ((𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝐴) → ((( I ↾ (𝐴 ∖ {𝑋, 𝑌})) ∪ {⟨𝑋, 𝑌⟩, ⟨𝑌, 𝑋⟩}):((𝐴 ∖ {𝑋, 𝑌}) ∪ {𝑋, 𝑌})–1-1-onto→((𝐴 ∖ {𝑋, 𝑌}) ∪ {𝑋, 𝑌}) ↔ (( I ↾ (𝐴 ∖ {𝑋, 𝑌})) ∪ {⟨𝑋, 𝑌⟩, ⟨𝑌, 𝑋⟩}):𝐴–1-1-onto→𝐴))
126, 11mpbid 235 . . . 4 ((𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝐴) → (( I ↾ (𝐴 ∖ {𝑋, 𝑌})) ∪ {⟨𝑋, 𝑌⟩, ⟨𝑌, 𝑋⟩}):𝐴–1-1-onto→𝐴)
13 f1oco 6848 . . . 4 ((𝐹:𝐴–1-1-onto→𝐵 ∧ (( I ↾ (𝐴 ∖ {𝑋, 𝑌})) ∪ {⟨𝑋, 𝑌⟩, ⟨𝑌, 𝑋⟩}):𝐴–1-1-onto→𝐴) → (𝐹 ∘ (( I ↾ (𝐴 ∖ {𝑋, 𝑌})) ∪ {⟨𝑋, 𝑌⟩, ⟨𝑌, 𝑋⟩})):𝐴–1-1-onto→𝐵)
1412, 13sylan2 605 . . 3 ((𝐹:𝐴–1-1-onto→𝐵 ∧ (𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝐴)) → (𝐹 ∘ (( I ↾ (𝐴 ∖ {𝑋, 𝑌})) ∪ {⟨𝑋, 𝑌⟩, ⟨𝑌, 𝑋⟩})):𝐴–1-1-onto→𝐵)
15143impb 1132 . 2 ((𝐹:𝐴–1-1-onto→𝐵 ∧ 𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝐴) → (𝐹 ∘ (( I ↾ (𝐴 ∖ {𝑋, 𝑌})) ∪ {⟨𝑋, 𝑌⟩, ⟨𝑌, 𝑋⟩})):𝐴–1-1-onto→𝐵)
16 f1ofn 6825 . . . 4 (𝐹:𝐴–1-1-onto→𝐵 → 𝐹 Fn 𝐴)
17 coundi 6248 . . . . . 6 (𝐹 ∘ (( I ↾ (𝐴 ∖ {𝑋, 𝑌})) ∪ {⟨𝑋, 𝑌⟩, ⟨𝑌, 𝑋⟩})) = ((𝐹 ∘ ( I ↾ (𝐴 ∖ {𝑋, 𝑌}))) ∪ (𝐹 ∘ {⟨𝑋, 𝑌⟩, ⟨𝑌, 𝑋⟩}))
18 fcoconst 7135 . . . . . . . . . . 11 ((𝐹 Fn 𝐴 ∧ 𝑌 ∈ 𝐴) → (𝐹 ∘ ({𝑋} × {𝑌})) = ({𝑋} × {(𝐹‘𝑌)}))
19183adant2 1149 . . . . . . . . . 10 ((𝐹 Fn 𝐴 ∧ 𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝐴) → (𝐹 ∘ ({𝑋} × {𝑌})) = ({𝑋} × {(𝐹‘𝑌)}))
20 xpsng 7140 . . . . . . . . . . . 12 ((𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝐴) → ({𝑋} × {𝑌}) = {⟨𝑋, 𝑌⟩})
2120coeq2d 5840 . . . . . . . . . . 11 ((𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝐴) → (𝐹 ∘ ({𝑋} × {𝑌})) = (𝐹 ∘ {⟨𝑋, 𝑌⟩}))
22213adant1 1148 . . . . . . . . . 10 ((𝐹 Fn 𝐴 ∧ 𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝐴) → (𝐹 ∘ ({𝑋} × {𝑌})) = (𝐹 ∘ {⟨𝑋, 𝑌⟩}))
23 fvex 6898 . . . . . . . . . . . 12 (𝐹‘𝑌) ∈ V
24 xpsng 7140 . . . . . . . . . . . 12 ((𝑋 ∈ 𝐴 ∧ (𝐹‘𝑌) ∈ V) → ({𝑋} × {(𝐹‘𝑌)}) = {⟨𝑋, (𝐹‘𝑌)⟩})
2523, 24mpan2 704 . . . . . . . . . . 11 (𝑋 ∈ 𝐴 → ({𝑋} × {(𝐹‘𝑌)}) = {⟨𝑋, (𝐹‘𝑌)⟩})
26253ad2ant2 1152 . . . . . . . . . 10 ((𝐹 Fn 𝐴 ∧ 𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝐴) → ({𝑋} × {(𝐹‘𝑌)}) = {⟨𝑋, (𝐹‘𝑌)⟩})
2719, 22, 263eqtr3d 2804 . . . . . . . . 9 ((𝐹 Fn 𝐴 ∧ 𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝐴) → (𝐹 ∘ {⟨𝑋, 𝑌⟩}) = {⟨𝑋, (𝐹‘𝑌)⟩})
28 fcoconst 7135 . . . . . . . . . . 11 ((𝐹 Fn 𝐴 ∧ 𝑋 ∈ 𝐴) → (𝐹 ∘ ({𝑌} × {𝑋})) = ({𝑌} × {(𝐹‘𝑋)}))
29283adant3 1150 . . . . . . . . . 10 ((𝐹 Fn 𝐴 ∧ 𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝐴) → (𝐹 ∘ ({𝑌} × {𝑋})) = ({𝑌} × {(𝐹‘𝑋)}))
30 xpsng 7140 . . . . . . . . . . . . 13 ((𝑌 ∈ 𝐴 ∧ 𝑋 ∈ 𝐴) → ({𝑌} × {𝑋}) = {⟨𝑌, 𝑋⟩})
3130coeq2d 5840 . . . . . . . . . . . 12 ((𝑌 ∈ 𝐴 ∧ 𝑋 ∈ 𝐴) → (𝐹 ∘ ({𝑌} × {𝑋})) = (𝐹 ∘ {⟨𝑌, 𝑋⟩}))
3231ancoms 464 . . . . . . . . . . 11 ((𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝐴) → (𝐹 ∘ ({𝑌} × {𝑋})) = (𝐹 ∘ {⟨𝑌, 𝑋⟩}))
33323adant1 1148 . . . . . . . . . 10 ((𝐹 Fn 𝐴 ∧ 𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝐴) → (𝐹 ∘ ({𝑌} × {𝑋})) = (𝐹 ∘ {⟨𝑌, 𝑋⟩}))
34 fvex 6898 . . . . . . . . . . . 12 (𝐹‘𝑋) ∈ V
35 xpsng 7140 . . . . . . . . . . . 12 ((𝑌 ∈ 𝐴 ∧ (𝐹‘𝑋) ∈ V) → ({𝑌} × {(𝐹‘𝑋)}) = {⟨𝑌, (𝐹‘𝑋)⟩})
3634, 35mpan2 704 . . . . . . . . . . 11 (𝑌 ∈ 𝐴 → ({𝑌} × {(𝐹‘𝑋)}) = {⟨𝑌, (𝐹‘𝑋)⟩})
37363ad2ant3 1153 . . . . . . . . . 10 ((𝐹 Fn 𝐴 ∧ 𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝐴) → ({𝑌} × {(𝐹‘𝑋)}) = {⟨𝑌, (𝐹‘𝑋)⟩})
3829, 33, 373eqtr3d 2804 . . . . . . . . 9 ((𝐹 Fn 𝐴 ∧ 𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝐴) → (𝐹 ∘ {⟨𝑌, 𝑋⟩}) = {⟨𝑌, (𝐹‘𝑋)⟩})
3927, 38uneq12d 4116 . . . . . . . 8 ((𝐹 Fn 𝐴 ∧ 𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝐴) → ((𝐹 ∘ {⟨𝑋, 𝑌⟩}) ∪ (𝐹 ∘ {⟨𝑌, 𝑋⟩})) = ({⟨𝑋, (𝐹‘𝑌)⟩} ∪ {⟨𝑌, (𝐹‘𝑋)⟩}))
40 df-pr 4587 . . . . . . . . . 10 {⟨𝑋, 𝑌⟩, ⟨𝑌, 𝑋⟩} = ({⟨𝑋, 𝑌⟩} ∪ {⟨𝑌, 𝑋⟩})
4140coeq2i 5838 . . . . . . . . 9 (𝐹 ∘ {⟨𝑋, 𝑌⟩, ⟨𝑌, 𝑋⟩}) = (𝐹 ∘ ({⟨𝑋, 𝑌⟩} ∪ {⟨𝑌, 𝑋⟩}))
42 coundi 6248 . . . . . . . . 9 (𝐹 ∘ ({⟨𝑋, 𝑌⟩} ∪ {⟨𝑌, 𝑋⟩})) = ((𝐹 ∘ {⟨𝑋, 𝑌⟩}) ∪ (𝐹 ∘ {⟨𝑌, 𝑋⟩}))
4341, 42eqtri 2784 . . . . . . . 8 (𝐹 ∘ {⟨𝑋, 𝑌⟩, ⟨𝑌, 𝑋⟩}) = ((𝐹 ∘ {⟨𝑋, 𝑌⟩}) ∪ (𝐹 ∘ {⟨𝑌, 𝑋⟩}))
44 df-pr 4587 . . . . . . . 8 {⟨𝑋, (𝐹‘𝑌)⟩, ⟨𝑌, (𝐹‘𝑋)⟩} = ({⟨𝑋, (𝐹‘𝑌)⟩} ∪ {⟨𝑌, (𝐹‘𝑋)⟩})
4539, 43, 443eqtr4g 2821 . . . . . . 7 ((𝐹 Fn 𝐴 ∧ 𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝐴) → (𝐹 ∘ {⟨𝑋, 𝑌⟩, ⟨𝑌, 𝑋⟩}) = {⟨𝑋, (𝐹‘𝑌)⟩, ⟨𝑌, (𝐹‘𝑋)⟩})
4645uneq2d 4115 . . . . . 6 ((𝐹 Fn 𝐴 ∧ 𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝐴) → ((𝐹 ∘ ( I ↾ (𝐴 ∖ {𝑋, 𝑌}))) ∪ (𝐹 ∘ {⟨𝑋, 𝑌⟩, ⟨𝑌, 𝑋⟩})) = ((𝐹 ∘ ( I ↾ (𝐴 ∖ {𝑋, 𝑌}))) ∪ {⟨𝑋, (𝐹‘𝑌)⟩, ⟨𝑌, (𝐹‘𝑋)⟩}))
4717, 46eqtrid 2808 . . . . 5 ((𝐹 Fn 𝐴 ∧ 𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝐴) → (𝐹 ∘ (( I ↾ (𝐴 ∖ {𝑋, 𝑌})) ∪ {⟨𝑋, 𝑌⟩, ⟨𝑌, 𝑋⟩})) = ((𝐹 ∘ ( I ↾ (𝐴 ∖ {𝑋, 𝑌}))) ∪ {⟨𝑋, (𝐹‘𝑌)⟩, ⟨𝑌, (𝐹‘𝑋)⟩}))
48 coires1 6266 . . . . . 6 (𝐹 ∘ ( I ↾ (𝐴 ∖ {𝑋, 𝑌}))) = (𝐹 ↾ (𝐴 ∖ {𝑋, 𝑌}))
4948uneq1i 4111 . . . . 5 ((𝐹 ∘ ( I ↾ (𝐴 ∖ {𝑋, 𝑌}))) ∪ {⟨𝑋, (𝐹‘𝑌)⟩, ⟨𝑌, (𝐹‘𝑋)⟩}) = ((𝐹 ↾ (𝐴 ∖ {𝑋, 𝑌})) ∪ {⟨𝑋, (𝐹‘𝑌)⟩, ⟨𝑌, (𝐹‘𝑋)⟩})
5047, 49eqtrdi 2812 . . . 4 ((𝐹 Fn 𝐴 ∧ 𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝐴) → (𝐹 ∘ (( I ↾ (𝐴 ∖ {𝑋, 𝑌})) ∪ {⟨𝑋, 𝑌⟩, ⟨𝑌, 𝑋⟩})) = ((𝐹 ↾ (𝐴 ∖ {𝑋, 𝑌})) ∪ {⟨𝑋, (𝐹‘𝑌)⟩, ⟨𝑌, (𝐹‘𝑋)⟩}))
5116, 50syl3an1 1181 . . 3 ((𝐹:𝐴–1-1-onto→𝐵 ∧ 𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝐴) → (𝐹 ∘ (( I ↾ (𝐴 ∖ {𝑋, 𝑌})) ∪ {⟨𝑋, 𝑌⟩, ⟨𝑌, 𝑋⟩})) = ((𝐹 ↾ (𝐴 ∖ {𝑋, 𝑌})) ∪ {⟨𝑋, (𝐹‘𝑌)⟩, ⟨𝑌, (𝐹‘𝑋)⟩}))
5251f1oeq1d 6819 . 2 ((𝐹:𝐴–1-1-onto→𝐵 ∧ 𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝐴) → ((𝐹 ∘ (( I ↾ (𝐴 ∖ {𝑋, 𝑌})) ∪ {⟨𝑋, 𝑌⟩, ⟨𝑌, 𝑋⟩})):𝐴–1-1-onto→𝐵 ↔ ((𝐹 ↾ (𝐴 ∖ {𝑋, 𝑌})) ∪ {⟨𝑋, (𝐹‘𝑌)⟩, ⟨𝑌, (𝐹‘𝑋)⟩}):𝐴–1-1-onto→𝐵))
5315, 52mpbid 235 1 ((𝐹:𝐴–1-1-onto→𝐵 ∧ 𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝐴) → ((𝐹 ↾ (𝐴 ∖ {𝑋, 𝑌})) ∪ {⟨𝑋, (𝐹‘𝑌)⟩, ⟨𝑌, (𝐹‘𝑋)⟩}):𝐴–1-1-onto→𝐵)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2145  Vcvv 3451   ∖ cdif 3896   ∪ cun 3897   ∩ cin 3898   ⊆ wss 3899  ∅c0 4279  {csn 4584  {cpr 4586  ⟨cop 4590   I cid 5545   × cxp 5649   ↾ cres 5653   ∘ ccom 5655   Fn wfn 6533  –1-1-onto→wf1o 6537  ‘cfv 6538
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 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2733  ax-sep 5249  ax-nul 5260  ax-pr 5391
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 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-reu 3367  df-rab 3414  df-v 3453  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-br 5104  df-opab 5168  df-mpt 5187  df-id 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-iota 6494  df-fun 6540  df-fn 6541  df-f 6542  df-f1 6543  df-fo 6544  df-f1o 6545  df-fv 6546
This theorem is used by:  dif1en  9177  nregmodelf1o  46004
  Copyright terms: Public domain W3C validator