| 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 7119 | . . . . 5 ⊢ (𝑌 ∈ 𝐴 → (( I ↾ 𝐴)‘𝑌) = 𝑌) | |
| 3 | 1, 2 | syl 17 | . . . 4 ⊢ (𝜑 → (( I ↾ 𝐴)‘𝑌) = 𝑌) |
| 4 | 3 | adantr 480 | . . 3 ⊢ ((𝜑 ∧ 𝑋 = 𝑌) → (( I ↾ 𝐴)‘𝑌) = 𝑌) |
| 5 | pmtridf1o.t | . . . . 5 ⊢ 𝑇 = if(𝑋 = 𝑌, ( I ↾ 𝐴), ((pmTrsp‘𝐴)‘{𝑋, 𝑌})) | |
| 6 | simpr 484 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑋 = 𝑌) → 𝑋 = 𝑌) | |
| 7 | 6 | iftrued 4487 | . . . . 5 ⊢ ((𝜑 ∧ 𝑋 = 𝑌) → if(𝑋 = 𝑌, ( I ↾ 𝐴), ((pmTrsp‘𝐴)‘{𝑋, 𝑌})) = ( I ↾ 𝐴)) |
| 8 | 5, 7 | eqtrid 2783 | . . . 4 ⊢ ((𝜑 ∧ 𝑋 = 𝑌) → 𝑇 = ( I ↾ 𝐴)) |
| 9 | 8 | fveq1d 6836 | . . 3 ⊢ ((𝜑 ∧ 𝑋 = 𝑌) → (𝑇‘𝑌) = (( I ↾ 𝐴)‘𝑌)) |
| 10 | 4, 9, 6 | 3eqtr4d 2781 | . 2 ⊢ ((𝜑 ∧ 𝑋 = 𝑌) → (𝑇‘𝑌) = 𝑋) |
| 11 | simpr 484 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑋 ≠ 𝑌) → 𝑋 ≠ 𝑌) | |
| 12 | 11 | neneqd 2937 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑋 ≠ 𝑌) → ¬ 𝑋 = 𝑌) |
| 13 | 12 | iffalsed 4490 | . . . . 5 ⊢ ((𝜑 ∧ 𝑋 ≠ 𝑌) → if(𝑋 = 𝑌, ( I ↾ 𝐴), ((pmTrsp‘𝐴)‘{𝑋, 𝑌})) = ((pmTrsp‘𝐴)‘{𝑋, 𝑌})) |
| 14 | 5, 13 | eqtrid 2783 | . . . 4 ⊢ ((𝜑 ∧ 𝑋 ≠ 𝑌) → 𝑇 = ((pmTrsp‘𝐴)‘{𝑋, 𝑌})) |
| 15 | 14 | fveq1d 6836 | . . 3 ⊢ ((𝜑 ∧ 𝑋 ≠ 𝑌) → (𝑇‘𝑌) = (((pmTrsp‘𝐴)‘{𝑋, 𝑌})‘𝑌)) |
| 16 | pmtridf1o.a | . . . . 5 ⊢ (𝜑 → 𝐴 ∈ 𝑉) | |
| 17 | 16 | adantr 480 | . . . 4 ⊢ ((𝜑 ∧ 𝑋 ≠ 𝑌) → 𝐴 ∈ 𝑉) |
| 18 | pmtridf1o.x | . . . . 5 ⊢ (𝜑 → 𝑋 ∈ 𝐴) | |
| 19 | 18 | adantr 480 | . . . 4 ⊢ ((𝜑 ∧ 𝑋 ≠ 𝑌) → 𝑋 ∈ 𝐴) |
| 20 | 1 | adantr 480 | . . . 4 ⊢ ((𝜑 ∧ 𝑋 ≠ 𝑌) → 𝑌 ∈ 𝐴) |
| 21 | eqid 2736 | . . . . 5 ⊢ (pmTrsp‘𝐴) = (pmTrsp‘𝐴) | |
| 22 | 21 | pmtrprfv2 33170 | . . . 4 ⊢ ((𝐴 ∈ 𝑉 ∧ (𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝐴 ∧ 𝑋 ≠ 𝑌)) → (((pmTrsp‘𝐴)‘{𝑋, 𝑌})‘𝑌) = 𝑋) |
| 23 | 17, 19, 20, 11, 22 | syl13anc 1374 | . . 3 ⊢ ((𝜑 ∧ 𝑋 ≠ 𝑌) → (((pmTrsp‘𝐴)‘{𝑋, 𝑌})‘𝑌) = 𝑋) |
| 24 | 15, 23 | eqtrd 2771 | . 2 ⊢ ((𝜑 ∧ 𝑋 ≠ 𝑌) → (𝑇‘𝑌) = 𝑋) |
| 25 | 10, 24 | pm2.61dane 3019 | 1 ⊢ (𝜑 → (𝑇‘𝑌) = 𝑋) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 = wceq 1541 ∈ wcel 2113 ≠ wne 2932 ifcif 4479 {cpr 4582 I cid 5518 ↾ cres 5626 ‘cfv 6492 pmTrspcpmtr 19370 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-10 2146 ax-11 2162 ax-12 2184 ax-ext 2708 ax-rep 5224 ax-sep 5241 ax-nul 5251 ax-pow 5310 ax-pr 5377 ax-un 7680 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2539 df-eu 2569 df-clab 2715 df-cleq 2728 df-clel 2811 df-nfc 2885 df-ne 2933 df-ral 3052 df-rex 3061 df-reu 3351 df-rab 3400 df-v 3442 df-sbc 3741 df-csb 3850 df-dif 3904 df-un 3906 df-in 3908 df-ss 3918 df-nul 4286 df-if 4480 df-pw 4556 df-sn 4581 df-pr 4583 df-op 4587 df-uni 4864 df-iun 4948 df-br 5099 df-opab 5161 df-mpt 5180 df-id 5519 df-xp 5630 df-rel 5631 df-cnv 5632 df-co 5633 df-dm 5634 df-rn 5635 df-res 5636 df-ima 5637 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-1o 8397 df-2o 8398 df-en 8884 df-pmtr 19371 |
| This theorem is referenced by: reprpmtf1o 34783 |
| Copyright terms: Public domain | W3C validator |