![]() |
Mathbox for Thierry Arnoux |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > Mathboxes > pmtridfv2 | Structured version Visualization version GIF version |
Description: Value at Y of the transposition of 𝑋 and 𝑌 (understood to be the identity when X = Y ). (Contributed by Thierry Arnoux, 3-Jan-2022.) |
Ref | Expression |
---|---|
pmtridf1o.a | ⊢ (𝜑 → 𝐴 ∈ 𝑉) |
pmtridf1o.x | ⊢ (𝜑 → 𝑋 ∈ 𝐴) |
pmtridf1o.y | ⊢ (𝜑 → 𝑌 ∈ 𝐴) |
pmtridf1o.t | ⊢ 𝑇 = if(𝑋 = 𝑌, ( I ↾ 𝐴), ((pmTrsp‘𝐴)‘{𝑋, 𝑌})) |
Ref | Expression |
---|---|
pmtridfv2 | ⊢ (𝜑 → (𝑇‘𝑌) = 𝑋) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | pmtridf1o.y | . . . . 5 ⊢ (𝜑 → 𝑌 ∈ 𝐴) | |
2 | fvresi 6439 | . . . . 5 ⊢ (𝑌 ∈ 𝐴 → (( I ↾ 𝐴)‘𝑌) = 𝑌) | |
3 | 1, 2 | syl 17 | . . . 4 ⊢ (𝜑 → (( I ↾ 𝐴)‘𝑌) = 𝑌) |
4 | 3 | adantr 481 | . . 3 ⊢ ((𝜑 ∧ 𝑋 = 𝑌) → (( I ↾ 𝐴)‘𝑌) = 𝑌) |
5 | pmtridf1o.t | . . . . 5 ⊢ 𝑇 = if(𝑋 = 𝑌, ( I ↾ 𝐴), ((pmTrsp‘𝐴)‘{𝑋, 𝑌})) | |
6 | simpr 477 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑋 = 𝑌) → 𝑋 = 𝑌) | |
7 | 6 | iftrued 4094 | . . . . 5 ⊢ ((𝜑 ∧ 𝑋 = 𝑌) → if(𝑋 = 𝑌, ( I ↾ 𝐴), ((pmTrsp‘𝐴)‘{𝑋, 𝑌})) = ( I ↾ 𝐴)) |
8 | 5, 7 | syl5eq 2668 | . . . 4 ⊢ ((𝜑 ∧ 𝑋 = 𝑌) → 𝑇 = ( I ↾ 𝐴)) |
9 | 8 | fveq1d 6193 | . . 3 ⊢ ((𝜑 ∧ 𝑋 = 𝑌) → (𝑇‘𝑌) = (( I ↾ 𝐴)‘𝑌)) |
10 | 4, 9, 6 | 3eqtr4d 2666 | . 2 ⊢ ((𝜑 ∧ 𝑋 = 𝑌) → (𝑇‘𝑌) = 𝑋) |
11 | simpr 477 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑋 ≠ 𝑌) → 𝑋 ≠ 𝑌) | |
12 | 11 | neneqd 2799 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑋 ≠ 𝑌) → ¬ 𝑋 = 𝑌) |
13 | 12 | iffalsed 4097 | . . . . 5 ⊢ ((𝜑 ∧ 𝑋 ≠ 𝑌) → if(𝑋 = 𝑌, ( I ↾ 𝐴), ((pmTrsp‘𝐴)‘{𝑋, 𝑌})) = ((pmTrsp‘𝐴)‘{𝑋, 𝑌})) |
14 | 5, 13 | syl5eq 2668 | . . . 4 ⊢ ((𝜑 ∧ 𝑋 ≠ 𝑌) → 𝑇 = ((pmTrsp‘𝐴)‘{𝑋, 𝑌})) |
15 | 14 | fveq1d 6193 | . . 3 ⊢ ((𝜑 ∧ 𝑋 ≠ 𝑌) → (𝑇‘𝑌) = (((pmTrsp‘𝐴)‘{𝑋, 𝑌})‘𝑌)) |
16 | pmtridf1o.a | . . . . 5 ⊢ (𝜑 → 𝐴 ∈ 𝑉) | |
17 | 16 | adantr 481 | . . . 4 ⊢ ((𝜑 ∧ 𝑋 ≠ 𝑌) → 𝐴 ∈ 𝑉) |
18 | pmtridf1o.x | . . . . 5 ⊢ (𝜑 → 𝑋 ∈ 𝐴) | |
19 | 18 | adantr 481 | . . . 4 ⊢ ((𝜑 ∧ 𝑋 ≠ 𝑌) → 𝑋 ∈ 𝐴) |
20 | 1 | adantr 481 | . . . 4 ⊢ ((𝜑 ∧ 𝑋 ≠ 𝑌) → 𝑌 ∈ 𝐴) |
21 | eqid 2622 | . . . . 5 ⊢ (pmTrsp‘𝐴) = (pmTrsp‘𝐴) | |
22 | 21 | pmtrprfv2 29848 | . . . 4 ⊢ ((𝐴 ∈ 𝑉 ∧ (𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝐴 ∧ 𝑋 ≠ 𝑌)) → (((pmTrsp‘𝐴)‘{𝑋, 𝑌})‘𝑌) = 𝑋) |
23 | 17, 19, 20, 11, 22 | syl13anc 1328 | . . 3 ⊢ ((𝜑 ∧ 𝑋 ≠ 𝑌) → (((pmTrsp‘𝐴)‘{𝑋, 𝑌})‘𝑌) = 𝑋) |
24 | 15, 23 | eqtrd 2656 | . 2 ⊢ ((𝜑 ∧ 𝑋 ≠ 𝑌) → (𝑇‘𝑌) = 𝑋) |
25 | 10, 24 | pm2.61dane 2881 | 1 ⊢ (𝜑 → (𝑇‘𝑌) = 𝑋) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 384 = wceq 1483 ∈ wcel 1990 ≠ wne 2794 ifcif 4086 {cpr 4179 I cid 5023 ↾ cres 5116 ‘cfv 5888 pmTrspcpmtr 17861 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1722 ax-4 1737 ax-5 1839 ax-6 1888 ax-7 1935 ax-8 1992 ax-9 1999 ax-10 2019 ax-11 2034 ax-12 2047 ax-13 2246 ax-ext 2602 ax-rep 4771 ax-sep 4781 ax-nul 4789 ax-pow 4843 ax-pr 4906 ax-un 6949 |
This theorem depends on definitions: df-bi 197 df-or 385 df-an 386 df-3or 1038 df-3an 1039 df-tru 1486 df-ex 1705 df-nf 1710 df-sb 1881 df-eu 2474 df-mo 2475 df-clab 2609 df-cleq 2615 df-clel 2618 df-nfc 2753 df-ne 2795 df-ral 2917 df-rex 2918 df-reu 2919 df-rab 2921 df-v 3202 df-sbc 3436 df-csb 3534 df-dif 3577 df-un 3579 df-in 3581 df-ss 3588 df-pss 3590 df-nul 3916 df-if 4087 df-pw 4160 df-sn 4178 df-pr 4180 df-tp 4182 df-op 4184 df-uni 4437 df-iun 4522 df-br 4654 df-opab 4713 df-mpt 4730 df-tr 4753 df-id 5024 df-eprel 5029 df-po 5035 df-so 5036 df-fr 5073 df-we 5075 df-xp 5120 df-rel 5121 df-cnv 5122 df-co 5123 df-dm 5124 df-rn 5125 df-res 5126 df-ima 5127 df-ord 5726 df-on 5727 df-lim 5728 df-suc 5729 df-iota 5851 df-fun 5890 df-fn 5891 df-f 5892 df-f1 5893 df-fo 5894 df-f1o 5895 df-fv 5896 df-om 7066 df-1o 7560 df-2o 7561 df-er 7742 df-en 7956 df-dom 7957 df-sdom 7958 df-pmtr 17862 |
This theorem is referenced by: reprpmtf1o 30704 |
Copyright terms: Public domain | W3C validator |