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 33235
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 4485 . . . . 5 (𝑋 = 𝑌 → if(𝑋 = 𝑌, ( I ↾ 𝐴), ((pmTrsp‘𝐴)‘{𝑋, 𝑌})) = ( I ↾ 𝐴))
32adantl 485 . . . 4 ((𝜑𝑋 = 𝑌) → if(𝑋 = 𝑌, ( I ↾ 𝐴), ((pmTrsp‘𝐴)‘{𝑋, 𝑌})) = ( I ↾ 𝐴))
41, 3eqtrid 2808 . . 3 ((𝜑𝑋 = 𝑌) → 𝑇 = ( I ↾ 𝐴))
5 f1oi 6841 . . . 4 ( I ↾ 𝐴):𝐴1-1-onto𝐴
65a1i 11 . . 3 ((𝜑𝑋 = 𝑌) → ( I ↾ 𝐴):𝐴1-1-onto𝐴)
7 f1oeq1 6790 . . . 4 (𝑇 = ( I ↾ 𝐴) → (𝑇:𝐴1-1-onto𝐴 ↔ ( I ↾ 𝐴):𝐴1-1-onto𝐴))
87biimpar 481 . . 3 ((𝑇 = ( I ↾ 𝐴) ∧ ( I ↾ 𝐴):𝐴1-1-onto𝐴) → 𝑇:𝐴1-1-onto𝐴)
94, 6, 8syl2anc 593 . 2 ((𝜑𝑋 = 𝑌) → 𝑇:𝐴1-1-onto𝐴)
10 simpr 488 . . . . . . 7 ((𝜑𝑋𝑌) → 𝑋𝑌)
1110neneqd 2961 . . . . . 6 ((𝜑𝑋𝑌) → ¬ 𝑋 = 𝑌)
12 iffalse 4488 . . . . . 6 𝑋 = 𝑌 → if(𝑋 = 𝑌, ( I ↾ 𝐴), ((pmTrsp‘𝐴)‘{𝑋, 𝑌})) = ((pmTrsp‘𝐴)‘{𝑋, 𝑌}))
1311, 12syl 17 . . . . 5 ((𝜑𝑋𝑌) → if(𝑋 = 𝑌, ( I ↾ 𝐴), ((pmTrsp‘𝐴)‘{𝑋, 𝑌})) = ((pmTrsp‘𝐴)‘{𝑋, 𝑌}))
141, 13eqtrid 2808 . . . 4 ((𝜑𝑋𝑌) → 𝑇 = ((pmTrsp‘𝐴)‘{𝑋, 𝑌}))
15 pmtridf1o.a . . . . . 6 (𝜑𝐴𝑉)
1615adantr 484 . . . . 5 ((𝜑𝑋𝑌) → 𝐴𝑉)
17 pmtridf1o.x . . . . . . 7 (𝜑𝑋𝐴)
1817adantr 484 . . . . . 6 ((𝜑𝑋𝑌) → 𝑋𝐴)
19 pmtridf1o.y . . . . . . 7 (𝜑𝑌𝐴)
2019adantr 484 . . . . . 6 ((𝜑𝑋𝑌) → 𝑌𝐴)
2118, 20prssd 4779 . . . . 5 ((𝜑𝑋𝑌) → {𝑋, 𝑌} ⊆ 𝐴)
22 enpr2 9957 . . . . . 6 ((𝑋𝐴𝑌𝐴𝑋𝑌) → {𝑋, 𝑌} ≈ 2o)
2318, 20, 10, 22syl3anc 1389 . . . . 5 ((𝜑𝑋𝑌) → {𝑋, 𝑌} ≈ 2o)
24 eqid 2761 . . . . . 6 (pmTrsp‘𝐴) = (pmTrsp‘𝐴)
25 eqid 2761 . . . . . 6 ran (pmTrsp‘𝐴) = ran (pmTrsp‘𝐴)
2624, 25pmtrrn 19480 . . . . 5 ((𝐴𝑉 ∧ {𝑋, 𝑌} ⊆ 𝐴 ∧ {𝑋, 𝑌} ≈ 2o) → ((pmTrsp‘𝐴)‘{𝑋, 𝑌}) ∈ ran (pmTrsp‘𝐴))
2716, 21, 23, 26syl3anc 1389 . . . 4 ((𝜑𝑋𝑌) → ((pmTrsp‘𝐴)‘{𝑋, 𝑌}) ∈ ran (pmTrsp‘𝐴))
2814, 27eqeltrd 2861 . . 3 ((𝜑𝑋𝑌) → 𝑇 ∈ ran (pmTrsp‘𝐴))
2924, 25pmtrff1o 19486 . . 3 (𝑇 ∈ ran (pmTrsp‘𝐴) → 𝑇:𝐴1-1-onto𝐴)
3028, 29syl 17 . 2 ((𝜑𝑋𝑌) → 𝑇:𝐴1-1-onto𝐴)
319, 30pm2.61dane 3043 1 (𝜑𝑇:𝐴1-1-onto𝐴)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wa 399   = wceq 1559  wcel 2141  wne 2956  wss 3904  ifcif 4479  {cpr 4583   class class class wbr 5099   I cid 5539  ran crn 5646  cres 5647  1-1-ontowf1o 6516  cfv 6517  2oc2o 8426  cen 8920  pmTrspcpmtr 19464
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1814  ax-4 1828  ax-5 1929  ax-6 1986  ax-7 2027  ax-8 2143  ax-9 2151  ax-10 2174  ax-11 2190  ax-12 2211  ax-ext 2733  ax-rep 5226  ax-sep 5245  ax-nul 5255  ax-pow 5321  ax-pr 5389  ax-un 7714
This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-3or 1098  df-3an 1099  df-tru 1562  df-fal 1572  df-ex 1799  df-nf 1803  df-sb 2090  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3076  df-rex 3086  df-reu 3367  df-rab 3414  df-v 3455  df-sbc 3745  df-csb 3853  df-dif 3907  df-un 3909  df-in 3911  df-ss 3921  df-pss 3924  df-nul 4286  df-if 4480  df-pw 4556  df-sn 4582  df-pr 4584  df-op 4588  df-uni 4865  df-iun 4950  df-br 5100  df-opab 5162  df-mpt 5181  df-tr 5207  df-id 5540  df-eprel 5545  df-po 5553  df-so 5554  df-fr 5598  df-we 5600  df-xp 5651  df-rel 5652  df-cnv 5653  df-co 5654  df-dm 5655  df-rn 5656  df-res 5657  df-ima 5658  df-ord 6345  df-on 6346  df-lim 6347  df-suc 6348  df-iota 6473  df-fun 6519  df-fn 6520  df-f 6521  df-f1 6522  df-fo 6523  df-f1o 6524  df-fv 6525  df-om 7843  df-1o 8432  df-2o 8433  df-er 8673  df-en 8924  df-dom 8925  df-sdom 8926  df-fin 8927  df-pmtr 19465
This theorem is referenced by:  reprpmtf1o  34884  hgt750lema  34915
  Copyright terms: Public domain W3C validator