| Mathbox for Thierry Arnoux |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > pmtridf1o | Structured version Visualization version GIF version | ||
| Description: Transpositions of 𝑋 and 𝑌 (understood to be the identity when 𝑋 = 𝑌), are bijections. (Contributed by Thierry Arnoux, 1-Jan-2022.) |
| Ref | Expression |
|---|---|
| pmtridf1o.a | ⊢ (𝜑 → 𝐴 ∈ 𝑉) |
| pmtridf1o.x | ⊢ (𝜑 → 𝑋 ∈ 𝐴) |
| pmtridf1o.y | ⊢ (𝜑 → 𝑌 ∈ 𝐴) |
| pmtridf1o.t | ⊢ 𝑇 = if(𝑋 = 𝑌, ( I ↾ 𝐴), ((pmTrsp‘𝐴)‘{𝑋, 𝑌})) |
| Ref | Expression |
|---|---|
| pmtridf1o | ⊢ (𝜑 → 𝑇:𝐴⟶1-1onto𝐴) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | pmtridf1o.t | . . . 4 ⊢ 𝑇 = if(𝑋 = 𝑌, ( I ↾ 𝐴), ((pmTrsp‘𝐴)‘{𝑋, 𝑌})) | |
| 2 | iftrue 4491 | . . . . 5 ⊢ (𝑋 = 𝑌 → if(𝑋 = 𝑌, ( I ↾ 𝐴), ((pmTrsp‘𝐴)‘{𝑋, 𝑌})) = ( I ↾ 𝐴)) | |
| 3 | 2 | adantl 487 | . . . 4 ⊢ ((𝜑 ∧ 𝑋 = 𝑌) → if(𝑋 = 𝑌, ( I ↾ 𝐴), ((pmTrsp‘𝐴)‘{𝑋, 𝑌})) = ( I ↾ 𝐴)) |
| 4 | 1, 3 | eqtrid 2810 | . . 3 ⊢ ((𝜑 ∧ 𝑋 = 𝑌) → 𝑇 = ( I ↾ 𝐴)) |
| 5 | f1oi 6886 | . . . 4 ⊢ ( I ↾ 𝐴):𝐴⟶1-1onto𝐴 | |
| 6 | 5 | a1i 11 | . . 3 ⊢ ((𝜑 ∧ 𝑋 = 𝑌) → ( I ↾ 𝐴):𝐴⟶1-1onto𝐴) |
| 7 | f1oeq1 6834 | . . . 4 ⊢ (𝑇 = ( I ↾ 𝐴) → (𝑇:𝐴⟶1-1onto𝐴 ↔ ( I ↾ 𝐴):𝐴⟶1-1onto𝐴)) | |
| 8 | 7 | biimpar 483 | . . 3 ⊢ ((𝑇 = ( I ↾ 𝐴) ∧ ( I ↾ 𝐴):𝐴⟶1-1onto𝐴) → 𝑇:𝐴⟶1-1onto𝐴) |
| 9 | 4, 6, 8 | syl2anc 596 | . 2 ⊢ ((𝜑 ∧ 𝑋 = 𝑌) → 𝑇:𝐴⟶1-1onto𝐴) |
| 10 | simpr 490 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑋 ≠ 𝑌) → 𝑋 ≠ 𝑌) | |
| 11 | 10 | neneqd 2964 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑋 ≠ 𝑌) → ¬ 𝑋 = 𝑌) |
| 12 | iffalse 4494 | . . . . . 6 ⊢ (¬ 𝑋 = 𝑌 → if(𝑋 = 𝑌, ( I ↾ 𝐴), ((pmTrsp‘𝐴)‘{𝑋, 𝑌})) = ((pmTrsp‘𝐴)‘{𝑋, 𝑌})) | |
| 13 | 11, 12 | syl 18 | . . . . 5 ⊢ ((𝜑 ∧ 𝑋 ≠ 𝑌) → if(𝑋 = 𝑌, ( I ↾ 𝐴), ((pmTrsp‘𝐴)‘{𝑋, 𝑌})) = ((pmTrsp‘𝐴)‘{𝑋, 𝑌})) |
| 14 | 1, 13 | eqtrid 2810 | . . . 4 ⊢ ((𝜑 ∧ 𝑋 ≠ 𝑌) → 𝑇 = ((pmTrsp‘𝐴)‘{𝑋, 𝑌})) |
| 15 | pmtridf1o.a | . . . . . 6 ⊢ (𝜑 → 𝐴 ∈ 𝑉) | |
| 16 | 15 | adantr 486 | . . . . 5 ⊢ ((𝜑 ∧ 𝑋 ≠ 𝑌) → 𝐴 ∈ 𝑉) |
| 17 | pmtridf1o.x | . . . . . . 7 ⊢ (𝜑 → 𝑋 ∈ 𝐴) | |
| 18 | 17 | adantr 486 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑋 ≠ 𝑌) → 𝑋 ∈ 𝐴) |
| 19 | pmtridf1o.y | . . . . . . 7 ⊢ (𝜑 → 𝑌 ∈ 𝐴) | |
| 20 | 19 | adantr 486 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑋 ≠ 𝑌) → 𝑌 ∈ 𝐴) |
| 21 | 18, 20 | prssd 4781 | . . . . 5 ⊢ ((𝜑 ∧ 𝑋 ≠ 𝑌) → {𝑋, 𝑌} ⊆ 𝐴) |
| 22 | enpr2 10110 | . . . . . 6 ⊢ ((𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝐴 ∧ 𝑋 ≠ 𝑌) → {𝑋, 𝑌} ≈ 2o) | |
| 23 | 18, 20, 10, 22 | syl3anc 1399 | . . . . 5 ⊢ ((𝜑 ∧ 𝑋 ≠ 𝑌) → {𝑋, 𝑌} ≈ 2o) |
| 24 | eqid 2763 | . . . . . 6 ⊢ (pmTrsp‘𝐴) = (pmTrsp‘𝐴) | |
| 25 | eqid 2763 | . . . . . 6 ⊢ ran (pmTrsp‘𝐴) = ran (pmTrsp‘𝐴) | |
| 26 | 24, 25 | pmtrrn 19701 | . . . . 5 ⊢ ((𝐴 ∈ 𝑉 ∧ {𝑋, 𝑌} ⊆ 𝐴 ∧ {𝑋, 𝑌} ≈ 2o) → ((pmTrsp‘𝐴)‘{𝑋, 𝑌}) ∈ ran (pmTrsp‘𝐴)) |
| 27 | 16, 21, 23, 26 | syl3anc 1399 | . . . 4 ⊢ ((𝜑 ∧ 𝑋 ≠ 𝑌) → ((pmTrsp‘𝐴)‘{𝑋, 𝑌}) ∈ ran (pmTrsp‘𝐴)) |
| 28 | 14, 27 | eqeltrd 2864 | . . 3 ⊢ ((𝜑 ∧ 𝑋 ≠ 𝑌) → 𝑇 ∈ ran (pmTrsp‘𝐴)) |
| 29 | 24, 25 | pmtrff1o 19707 | . . 3 ⊢ (𝑇 ∈ ran (pmTrsp‘𝐴) → 𝑇:𝐴⟶1-1onto𝐴) |
| 30 | 28, 29 | syl 18 | . 2 ⊢ ((𝜑 ∧ 𝑋 ≠ 𝑌) → 𝑇:𝐴⟶1-1onto𝐴) |
| 31 | 9, 30 | pm2.61dane 3046 | 1 ⊢ (𝜑 → 𝑇:𝐴⟶1-1onto𝐴) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 → wi 4 ∧ wa 401 = wceq 1570 ∈ wcel 2147 ≠ wne 2959 ⊆ wss 3900 ifcif 4485 {cpr 4590 class class class wbr 5106 I cid 5549 ran crn 5656 ↾ cres 5657 ⟶1-1ontowf1o 6557 ‘cfv 6558 2oc2o 8498 ≈ cen 8998 pmTrspcpmtr 19685 |
| 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 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-rep 5235 ax-sep 5252 ax-nul 5263 ax-pow 5331 ax-pr 5395 ax-un 7775 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-ral 3081 df-rex 3091 df-reu 3370 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 df-ss 3901 df-pss 4017 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-op 4839 df-uni 4871 df-iun 4956 df-br 5107 df-opab 5171 df-mpt 5190 df-tr 5216 df-id 5550 df-eprel 5555 df-po 5563 df-so 5564 df-fr 5608 df-we 5610 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-rn 5666 df-res 5667 df-ima 5668 df-ord 6383 df-on 6384 df-lim 6385 df-suc 6386 df-iota 6512 df-fun 6560 df-fn 6561 df-f 6562 df-f1 6563 df-fo 6564 df-f1o 6565 df-fv 6566 df-om 7902 df-1o 8504 df-2o 8505 df-er 8745 df-en 9002 df-dom 9003 df-sdom 9004 df-fin 9005 df-pmtr 19686 |
| This theorem is used by: reprpmtf1o 35325 hgt750lema 35356 |
| Copyright terms: Public domain | W3C validator |