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

Theorem f1ofvswap 7304
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 6859 . . . . . 6 ( I ↾ (𝐴 ∖ {𝑋, 𝑌})):(𝐴 ∖ {𝑋, 𝑌})–1-1-onto→(𝐴 ∖ {𝑋, 𝑌})
2 f1oprswap 6866 . . . . . 6 ((𝑋𝐴𝑌𝐴) → {⟨𝑋, 𝑌⟩, ⟨𝑌, 𝑋⟩}:{𝑋, 𝑌}–1-1-onto→{𝑋, 𝑌})
3 disjdifr 4434 . . . . . . 7 ((𝐴 ∖ {𝑋, 𝑌}) ∩ {𝑋, 𝑌}) = ∅
4 f1oun 6840 . . . . . . 7 (((( I ↾ (𝐴 ∖ {𝑋, 𝑌})):(𝐴 ∖ {𝑋, 𝑌})–1-1-onto→(𝐴 ∖ {𝑋, 𝑌}) ∧ {⟨𝑋, 𝑌⟩, ⟨𝑌, 𝑋⟩}:{𝑋, 𝑌}–1-1-onto→{𝑋, 𝑌}) ∧ (((𝐴 ∖ {𝑋, 𝑌}) ∩ {𝑋, 𝑌}) = ∅ ∧ ((𝐴 ∖ {𝑋, 𝑌}) ∩ {𝑋, 𝑌}) = ∅)) → (( I ↾ (𝐴 ∖ {𝑋, 𝑌})) ∪ {⟨𝑋, 𝑌⟩, ⟨𝑌, 𝑋⟩}):((𝐴 ∖ {𝑋, 𝑌}) ∪ {𝑋, 𝑌})–1-1-onto→((𝐴 ∖ {𝑋, 𝑌}) ∪ {𝑋, 𝑌}))
53, 3, 4mpanr12 717 . . . . . 6 ((( I ↾ (𝐴 ∖ {𝑋, 𝑌})):(𝐴 ∖ {𝑋, 𝑌})–1-1-onto→(𝐴 ∖ {𝑋, 𝑌}) ∧ {⟨𝑋, 𝑌⟩, ⟨𝑌, 𝑋⟩}:{𝑋, 𝑌}–1-1-onto→{𝑋, 𝑌}) → (( I ↾ (𝐴 ∖ {𝑋, 𝑌})) ∪ {⟨𝑋, 𝑌⟩, ⟨𝑌, 𝑋⟩}):((𝐴 ∖ {𝑋, 𝑌}) ∪ {𝑋, 𝑌})–1-1-onto→((𝐴 ∖ {𝑋, 𝑌}) ∪ {𝑋, 𝑌}))
61, 2, 5sylancr 598 . . . . 5 ((𝑋𝐴𝑌𝐴) → (( I ↾ (𝐴 ∖ {𝑋, 𝑌})) ∪ {⟨𝑋, 𝑌⟩, ⟨𝑌, 𝑋⟩}):((𝐴 ∖ {𝑋, 𝑌}) ∪ {𝑋, 𝑌})–1-1-onto→((𝐴 ∖ {𝑋, 𝑌}) ∪ {𝑋, 𝑌}))
7 prssi 4787 . . . . . . 7 ((𝑋𝐴𝑌𝐴) → {𝑋, 𝑌} ⊆ 𝐴)
8 undifr 4444 . . . . . . 7 ({𝑋, 𝑌} ⊆ 𝐴 ↔ ((𝐴 ∖ {𝑋, 𝑌}) ∪ {𝑋, 𝑌}) = 𝐴)
97, 8sylib 221 . . . . . 6 ((𝑋𝐴𝑌𝐴) → ((𝐴 ∖ {𝑋, 𝑌}) ∪ {𝑋, 𝑌}) = 𝐴)
10 f1oeq23 6811 . . . . . 6 ((((𝐴 ∖ {𝑋, 𝑌}) ∪ {𝑋, 𝑌}) = 𝐴 ∧ ((𝐴 ∖ {𝑋, 𝑌}) ∪ {𝑋, 𝑌}) = 𝐴) → ((( I ↾ (𝐴 ∖ {𝑋, 𝑌})) ∪ {⟨𝑋, 𝑌⟩, ⟨𝑌, 𝑋⟩}):((𝐴 ∖ {𝑋, 𝑌}) ∪ {𝑋, 𝑌})–1-1-onto→((𝐴 ∖ {𝑋, 𝑌}) ∪ {𝑋, 𝑌}) ↔ (( I ↾ (𝐴 ∖ {𝑋, 𝑌})) ∪ {⟨𝑋, 𝑌⟩, ⟨𝑌, 𝑋⟩}):𝐴1-1-onto𝐴))
119, 9, 10syl2anc 595 . . . . 5 ((𝑋𝐴𝑌𝐴) → ((( I ↾ (𝐴 ∖ {𝑋, 𝑌})) ∪ {⟨𝑋, 𝑌⟩, ⟨𝑌, 𝑋⟩}):((𝐴 ∖ {𝑋, 𝑌}) ∪ {𝑋, 𝑌})–1-1-onto→((𝐴 ∖ {𝑋, 𝑌}) ∪ {𝑋, 𝑌}) ↔ (( I ↾ (𝐴 ∖ {𝑋, 𝑌})) ∪ {⟨𝑋, 𝑌⟩, ⟨𝑌, 𝑋⟩}):𝐴1-1-onto𝐴))
126, 11mpbid 235 . . . 4 ((𝑋𝐴𝑌𝐴) → (( I ↾ (𝐴 ∖ {𝑋, 𝑌})) ∪ {⟨𝑋, 𝑌⟩, ⟨𝑌, 𝑋⟩}):𝐴1-1-onto𝐴)
13 f1oco 6844 . . . 4 ((𝐹:𝐴1-1-onto𝐵 ∧ (( I ↾ (𝐴 ∖ {𝑋, 𝑌})) ∪ {⟨𝑋, 𝑌⟩, ⟨𝑌, 𝑋⟩}):𝐴1-1-onto𝐴) → (𝐹 ∘ (( I ↾ (𝐴 ∖ {𝑋, 𝑌})) ∪ {⟨𝑋, 𝑌⟩, ⟨𝑌, 𝑋⟩})):𝐴1-1-onto𝐵)
1412, 13sylan2 604 . . 3 ((𝐹:𝐴1-1-onto𝐵 ∧ (𝑋𝐴𝑌𝐴)) → (𝐹 ∘ (( I ↾ (𝐴 ∖ {𝑋, 𝑌})) ∪ {⟨𝑋, 𝑌⟩, ⟨𝑌, 𝑋⟩})):𝐴1-1-onto𝐵)
15143impb 1132 . 2 ((𝐹:𝐴1-1-onto𝐵𝑋𝐴𝑌𝐴) → (𝐹 ∘ (( I ↾ (𝐴 ∖ {𝑋, 𝑌})) ∪ {⟨𝑋, 𝑌⟩, ⟨𝑌, 𝑋⟩})):𝐴1-1-onto𝐵)
16 f1ofn 6821 . . . 4 (𝐹:𝐴1-1-onto𝐵𝐹 Fn 𝐴)
17 coundi 6248 . . . . . 6 (𝐹 ∘ (( I ↾ (𝐴 ∖ {𝑋, 𝑌})) ∪ {⟨𝑋, 𝑌⟩, ⟨𝑌, 𝑋⟩})) = ((𝐹 ∘ ( I ↾ (𝐴 ∖ {𝑋, 𝑌}))) ∪ (𝐹 ∘ {⟨𝑋, 𝑌⟩, ⟨𝑌, 𝑋⟩}))
18 fcoconst 7130 . . . . . . . . . . 11 ((𝐹 Fn 𝐴𝑌𝐴) → (𝐹 ∘ ({𝑋} × {𝑌})) = ({𝑋} × {(𝐹𝑌)}))
19183adant2 1149 . . . . . . . . . 10 ((𝐹 Fn 𝐴𝑋𝐴𝑌𝐴) → (𝐹 ∘ ({𝑋} × {𝑌})) = ({𝑋} × {(𝐹𝑌)}))
20 xpsng 7135 . . . . . . . . . . . 12 ((𝑋𝐴𝑌𝐴) → ({𝑋} × {𝑌}) = {⟨𝑋, 𝑌⟩})
2120coeq2d 5848 . . . . . . . . . . 11 ((𝑋𝐴𝑌𝐴) → (𝐹 ∘ ({𝑋} × {𝑌})) = (𝐹 ∘ {⟨𝑋, 𝑌⟩}))
22213adant1 1148 . . . . . . . . . 10 ((𝐹 Fn 𝐴𝑋𝐴𝑌𝐴) → (𝐹 ∘ ({𝑋} × {𝑌})) = (𝐹 ∘ {⟨𝑋, 𝑌⟩}))
23 fvex 6894 . . . . . . . . . . . 12 (𝐹𝑌) ∈ V
24 xpsng 7135 . . . . . . . . . . . 12 ((𝑋𝐴 ∧ (𝐹𝑌) ∈ V) → ({𝑋} × {(𝐹𝑌)}) = {⟨𝑋, (𝐹𝑌)⟩})
2523, 24mpan2 703 . . . . . . . . . . 11 (𝑋𝐴 → ({𝑋} × {(𝐹𝑌)}) = {⟨𝑋, (𝐹𝑌)⟩})
26253ad2ant2 1152 . . . . . . . . . 10 ((𝐹 Fn 𝐴𝑋𝐴𝑌𝐴) → ({𝑋} × {(𝐹𝑌)}) = {⟨𝑋, (𝐹𝑌)⟩})
2719, 22, 263eqtr3d 2806 . . . . . . . . 9 ((𝐹 Fn 𝐴𝑋𝐴𝑌𝐴) → (𝐹 ∘ {⟨𝑋, 𝑌⟩}) = {⟨𝑋, (𝐹𝑌)⟩})
28 fcoconst 7130 . . . . . . . . . . 11 ((𝐹 Fn 𝐴𝑋𝐴) → (𝐹 ∘ ({𝑌} × {𝑋})) = ({𝑌} × {(𝐹𝑋)}))
29283adant3 1150 . . . . . . . . . 10 ((𝐹 Fn 𝐴𝑋𝐴𝑌𝐴) → (𝐹 ∘ ({𝑌} × {𝑋})) = ({𝑌} × {(𝐹𝑋)}))
30 xpsng 7135 . . . . . . . . . . . . 13 ((𝑌𝐴𝑋𝐴) → ({𝑌} × {𝑋}) = {⟨𝑌, 𝑋⟩})
3130coeq2d 5848 . . . . . . . . . . . 12 ((𝑌𝐴𝑋𝐴) → (𝐹 ∘ ({𝑌} × {𝑋})) = (𝐹 ∘ {⟨𝑌, 𝑋⟩}))
3231ancoms 463 . . . . . . . . . . 11 ((𝑋𝐴𝑌𝐴) → (𝐹 ∘ ({𝑌} × {𝑋})) = (𝐹 ∘ {⟨𝑌, 𝑋⟩}))
33323adant1 1148 . . . . . . . . . 10 ((𝐹 Fn 𝐴𝑋𝐴𝑌𝐴) → (𝐹 ∘ ({𝑌} × {𝑋})) = (𝐹 ∘ {⟨𝑌, 𝑋⟩}))
34 fvex 6894 . . . . . . . . . . . 12 (𝐹𝑋) ∈ V
35 xpsng 7135 . . . . . . . . . . . 12 ((𝑌𝐴 ∧ (𝐹𝑋) ∈ V) → ({𝑌} × {(𝐹𝑋)}) = {⟨𝑌, (𝐹𝑋)⟩})
3634, 35mpan2 703 . . . . . . . . . . 11 (𝑌𝐴 → ({𝑌} × {(𝐹𝑋)}) = {⟨𝑌, (𝐹𝑋)⟩})
37363ad2ant3 1153 . . . . . . . . . 10 ((𝐹 Fn 𝐴𝑋𝐴𝑌𝐴) → ({𝑌} × {(𝐹𝑋)}) = {⟨𝑌, (𝐹𝑋)⟩})
3829, 33, 373eqtr3d 2806 . . . . . . . . 9 ((𝐹 Fn 𝐴𝑋𝐴𝑌𝐴) → (𝐹 ∘ {⟨𝑌, 𝑋⟩}) = {⟨𝑌, (𝐹𝑋)⟩})
3927, 38uneq12d 4123 . . . . . . . 8 ((𝐹 Fn 𝐴𝑋𝐴𝑌𝐴) → ((𝐹 ∘ {⟨𝑋, 𝑌⟩}) ∪ (𝐹 ∘ {⟨𝑌, 𝑋⟩})) = ({⟨𝑋, (𝐹𝑌)⟩} ∪ {⟨𝑌, (𝐹𝑋)⟩}))
40 df-pr 4592 . . . . . . . . . 10 {⟨𝑋, 𝑌⟩, ⟨𝑌, 𝑋⟩} = ({⟨𝑋, 𝑌⟩} ∪ {⟨𝑌, 𝑋⟩})
4140coeq2i 5846 . . . . . . . . 9 (𝐹 ∘ {⟨𝑋, 𝑌⟩, ⟨𝑌, 𝑋⟩}) = (𝐹 ∘ ({⟨𝑋, 𝑌⟩} ∪ {⟨𝑌, 𝑋⟩}))
42 coundi 6248 . . . . . . . . 9 (𝐹 ∘ ({⟨𝑋, 𝑌⟩} ∪ {⟨𝑌, 𝑋⟩})) = ((𝐹 ∘ {⟨𝑋, 𝑌⟩}) ∪ (𝐹 ∘ {⟨𝑌, 𝑋⟩}))
4341, 42eqtri 2786 . . . . . . . 8 (𝐹 ∘ {⟨𝑋, 𝑌⟩, ⟨𝑌, 𝑋⟩}) = ((𝐹 ∘ {⟨𝑋, 𝑌⟩}) ∪ (𝐹 ∘ {⟨𝑌, 𝑋⟩}))
44 df-pr 4592 . . . . . . . 8 {⟨𝑋, (𝐹𝑌)⟩, ⟨𝑌, (𝐹𝑋)⟩} = ({⟨𝑋, (𝐹𝑌)⟩} ∪ {⟨𝑌, (𝐹𝑋)⟩})
4539, 43, 443eqtr4g 2823 . . . . . . 7 ((𝐹 Fn 𝐴𝑋𝐴𝑌𝐴) → (𝐹 ∘ {⟨𝑋, 𝑌⟩, ⟨𝑌, 𝑋⟩}) = {⟨𝑋, (𝐹𝑌)⟩, ⟨𝑌, (𝐹𝑋)⟩})
4645uneq2d 4122 . . . . . 6 ((𝐹 Fn 𝐴𝑋𝐴𝑌𝐴) → ((𝐹 ∘ ( I ↾ (𝐴 ∖ {𝑋, 𝑌}))) ∪ (𝐹 ∘ {⟨𝑋, 𝑌⟩, ⟨𝑌, 𝑋⟩})) = ((𝐹 ∘ ( I ↾ (𝐴 ∖ {𝑋, 𝑌}))) ∪ {⟨𝑋, (𝐹𝑌)⟩, ⟨𝑌, (𝐹𝑋)⟩}))
4717, 46eqtrid 2810 . . . . 5 ((𝐹 Fn 𝐴𝑋𝐴𝑌𝐴) → (𝐹 ∘ (( I ↾ (𝐴 ∖ {𝑋, 𝑌})) ∪ {⟨𝑋, 𝑌⟩, ⟨𝑌, 𝑋⟩})) = ((𝐹 ∘ ( I ↾ (𝐴 ∖ {𝑋, 𝑌}))) ∪ {⟨𝑋, (𝐹𝑌)⟩, ⟨𝑌, (𝐹𝑋)⟩}))
48 coires1 6266 . . . . . 6 (𝐹 ∘ ( I ↾ (𝐴 ∖ {𝑋, 𝑌}))) = (𝐹 ↾ (𝐴 ∖ {𝑋, 𝑌}))
4948uneq1i 4118 . . . . 5 ((𝐹 ∘ ( I ↾ (𝐴 ∖ {𝑋, 𝑌}))) ∪ {⟨𝑋, (𝐹𝑌)⟩, ⟨𝑌, (𝐹𝑋)⟩}) = ((𝐹 ↾ (𝐴 ∖ {𝑋, 𝑌})) ∪ {⟨𝑋, (𝐹𝑌)⟩, ⟨𝑌, (𝐹𝑋)⟩})
5047, 49eqtrdi 2814 . . . 4 ((𝐹 Fn 𝐴𝑋𝐴𝑌𝐴) → (𝐹 ∘ (( I ↾ (𝐴 ∖ {𝑋, 𝑌})) ∪ {⟨𝑋, 𝑌⟩, ⟨𝑌, 𝑋⟩})) = ((𝐹 ↾ (𝐴 ∖ {𝑋, 𝑌})) ∪ {⟨𝑋, (𝐹𝑌)⟩, ⟨𝑌, (𝐹𝑋)⟩}))
5116, 50syl3an1 1181 . . 3 ((𝐹:𝐴1-1-onto𝐵𝑋𝐴𝑌𝐴) → (𝐹 ∘ (( I ↾ (𝐴 ∖ {𝑋, 𝑌})) ∪ {⟨𝑋, 𝑌⟩, ⟨𝑌, 𝑋⟩})) = ((𝐹 ↾ (𝐴 ∖ {𝑋, 𝑌})) ∪ {⟨𝑋, (𝐹𝑌)⟩, ⟨𝑌, (𝐹𝑋)⟩}))
5251f1oeq1d 6815 . 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 400  w3a 1103   = wceq 1570  wcel 2143  Vcvv 3455  cdif 3902  cun 3903  cin 3904  wss 3905  c0 4286  {csn 4589  {cpr 4591  cop 4595   I cid 5555   × cxp 5659  cres 5663  ccom 5665   Fn wfn 6531  1-1-ontowf1o 6535  cfv 6536
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-10 2176  ax-11 2192  ax-12 2213  ax-ext 2735  ax-sep 5257  ax-nul 5269  ax-pr 5404
This proof depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1810  df-nf 1814  df-sb 2097  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2838  df-nfc 2912  df-ne 2959  df-ral 3080  df-rex 3090  df-reu 3370  df-rab 3417  df-v 3457  df-sbc 3745  df-csb 3854  df-dif 3908  df-un 3910  df-in 3912  df-ss 3922  df-nul 4287  df-if 4488  df-sn 4590  df-pr 4592  df-op 4596  df-uni 4873  df-br 5110  df-opab 5174  df-mpt 5193  df-id 5556  df-xp 5667  df-rel 5668  df-cnv 5669  df-co 5670  df-dm 5671  df-rn 5672  df-res 5673  df-ima 5674  df-iota 6492  df-fun 6538  df-fn 6539  df-f 6540  df-f1 6541  df-fo 6542  df-f1o 6543  df-fv 6544
This theorem is used by:  dif1en  9142  nregmodelf1o  45752
  Copyright terms: Public domain W3C validator