Users' Mathboxes Mathbox for Thierry Arnoux < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  pmtridf1o Structured version   Visualization version   GIF version

Theorem pmtridf1o 33182
Description: Transpositions of 𝑋 and 𝑌 (understood to be the identity when 𝑋 = 𝑌), are bijections. (Contributed by Thierry Arnoux, 1-Jan-2022.)
Hypotheses
Ref Expression
pmtridf1o.a (𝜑𝐴𝑉)
pmtridf1o.x (𝜑𝑋𝐴)
pmtridf1o.y (𝜑𝑌𝐴)
pmtridf1o.t 𝑇 = if(𝑋 = 𝑌, ( I ↾ 𝐴), ((pmTrsp‘𝐴)‘{𝑋, 𝑌}))
Assertion
Ref Expression
pmtridf1o (𝜑𝑇:𝐴1-1-onto𝐴)

Proof of Theorem pmtridf1o
StepHypRef Expression
1 pmtridf1o.t . . . 4 𝑇 = if(𝑋 = 𝑌, ( I ↾ 𝐴), ((pmTrsp‘𝐴)‘{𝑋, 𝑌}))
2 iftrue 4467 . . . . 5 (𝑋 = 𝑌 → if(𝑋 = 𝑌, ( I ↾ 𝐴), ((pmTrsp‘𝐴)‘{𝑋, 𝑌})) = ( I ↾ 𝐴))
32adantl 482 . . . 4 ((𝜑𝑋 = 𝑌) → if(𝑋 = 𝑌, ( I ↾ 𝐴), ((pmTrsp‘𝐴)‘{𝑋, 𝑌})) = ( I ↾ 𝐴))
41, 3eqtrid 2787 . . 3 ((𝜑𝑋 = 𝑌) → 𝑇 = ( I ↾ 𝐴))
5 f1oi 6812 . . . 4 ( I ↾ 𝐴):𝐴1-1-onto𝐴
65a1i 11 . . 3 ((𝜑𝑋 = 𝑌) → ( I ↾ 𝐴):𝐴1-1-onto𝐴)
7 f1oeq1 6762 . . . 4 (𝑇 = ( I ↾ 𝐴) → (𝑇:𝐴1-1-onto𝐴 ↔ ( I ↾ 𝐴):𝐴1-1-onto𝐴))
87biimpar 478 . . 3 ((𝑇 = ( I ↾ 𝐴) ∧ ( I ↾ 𝐴):𝐴1-1-onto𝐴) → 𝑇:𝐴1-1-onto𝐴)
94, 6, 8syl2anc 590 . 2 ((𝜑𝑋 = 𝑌) → 𝑇:𝐴1-1-onto𝐴)
10 simpr 485 . . . . . . 7 ((𝜑𝑋𝑌) → 𝑋𝑌)
1110neneqd 2940 . . . . . 6 ((𝜑𝑋𝑌) → ¬ 𝑋 = 𝑌)
12 iffalse 4470 . . . . . 6 𝑋 = 𝑌 → if(𝑋 = 𝑌, ( I ↾ 𝐴), ((pmTrsp‘𝐴)‘{𝑋, 𝑌})) = ((pmTrsp‘𝐴)‘{𝑋, 𝑌}))
1311, 12syl 17 . . . . 5 ((𝜑𝑋𝑌) → if(𝑋 = 𝑌, ( I ↾ 𝐴), ((pmTrsp‘𝐴)‘{𝑋, 𝑌})) = ((pmTrsp‘𝐴)‘{𝑋, 𝑌}))
141, 13eqtrid 2787 . . . 4 ((𝜑𝑋𝑌) → 𝑇 = ((pmTrsp‘𝐴)‘{𝑋, 𝑌}))
15 pmtridf1o.a . . . . . 6 (𝜑𝐴𝑉)
1615adantr 481 . . . . 5 ((𝜑𝑋𝑌) → 𝐴𝑉)
17 pmtridf1o.x . . . . . . 7 (𝜑𝑋𝐴)
1817adantr 481 . . . . . 6 ((𝜑𝑋𝑌) → 𝑋𝐴)
19 pmtridf1o.y . . . . . . 7 (𝜑𝑌𝐴)
2019adantr 481 . . . . . 6 ((𝜑𝑋𝑌) → 𝑌𝐴)
2118, 20prssd 4760 . . . . 5 ((𝜑𝑋𝑌) → {𝑋, 𝑌} ⊆ 𝐴)
22 enpr2 9924 . . . . . 6 ((𝑋𝐴𝑌𝐴𝑋𝑌) → {𝑋, 𝑌} ≈ 2o)
2318, 20, 10, 22syl3anc 1379 . . . . 5 ((𝜑𝑋𝑌) → {𝑋, 𝑌} ≈ 2o)
24 eqid 2740 . . . . . 6 (pmTrsp‘𝐴) = (pmTrsp‘𝐴)
25 eqid 2740 . . . . . 6 ran (pmTrsp‘𝐴) = ran (pmTrsp‘𝐴)
2624, 25pmtrrn 19430 . . . . 5 ((𝐴𝑉 ∧ {𝑋, 𝑌} ⊆ 𝐴 ∧ {𝑋, 𝑌} ≈ 2o) → ((pmTrsp‘𝐴)‘{𝑋, 𝑌}) ∈ ran (pmTrsp‘𝐴))
2716, 21, 23, 26syl3anc 1379 . . . 4 ((𝜑𝑋𝑌) → ((pmTrsp‘𝐴)‘{𝑋, 𝑌}) ∈ ran (pmTrsp‘𝐴))
2814, 27eqeltrd 2840 . . 3 ((𝜑𝑋𝑌) → 𝑇 ∈ ran (pmTrsp‘𝐴))
2924, 25pmtrff1o 19436 . . 3 (𝑇 ∈ ran (pmTrsp‘𝐴) → 𝑇:𝐴1-1-onto𝐴)
3028, 29syl 17 . 2 ((𝜑𝑋𝑌) → 𝑇:𝐴1-1-onto𝐴)
319, 30pm2.61dane 3022 1 (𝜑𝑇:𝐴1-1-onto𝐴)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wa 396   = wceq 1547  wcel 2119  wne 2935  wss 3890  ifcif 4461  {cpr 4564   class class class wbr 5079   I cid 5519  ran crn 5626  cres 5627  1-1-ontowf1o 6491  cfv 6492  2oc2o 8396  cen 8887  pmTrspcpmtr 19414
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1802  ax-4 1816  ax-5 1917  ax-6 1974  ax-7 2015  ax-8 2121  ax-9 2129  ax-10 2152  ax-11 2168  ax-12 2189  ax-ext 2712  ax-rep 5206  ax-sep 5225  ax-nul 5235  ax-pow 5301  ax-pr 5369  ax-un 7685
This theorem depends on definitions:  df-bi 208  df-an 397  df-or 854  df-3or 1093  df-3an 1094  df-tru 1550  df-fal 1560  df-ex 1787  df-nf 1791  df-sb 2074  df-mo 2543  df-eu 2573  df-clab 2719  df-cleq 2732  df-clel 2815  df-nfc 2889  df-ne 2936  df-ral 3055  df-rex 3065  df-reu 3346  df-rab 3393  df-v 3434  df-sbc 3731  df-csb 3839  df-dif 3893  df-un 3895  df-in 3897  df-ss 3907  df-pss 3910  df-nul 4269  df-if 4462  df-pw 4538  df-sn 4563  df-pr 4565  df-op 4569  df-uni 4846  df-iun 4930  df-br 5080  df-opab 5142  df-mpt 5161  df-tr 5187  df-id 5520  df-eprel 5525  df-po 5533  df-so 5534  df-fr 5578  df-we 5580  df-xp 5631  df-rel 5632  df-cnv 5633  df-co 5634  df-dm 5635  df-rn 5636  df-res 5637  df-ima 5638  df-ord 6320  df-on 6321  df-lim 6322  df-suc 6323  df-iota 6448  df-fun 6494  df-fn 6495  df-f 6496  df-f1 6497  df-fo 6498  df-f1o 6499  df-fv 6500  df-om 7814  df-1o 8402  df-2o 8403  df-er 8640  df-en 8891  df-dom 8892  df-sdom 8893  df-fin 8894  df-pmtr 19415
This theorem is referenced by:  reprpmtf1o  34817  hgt750lema  34848
  Copyright terms: Public domain W3C validator