| Mathbox for Thierry Arnoux |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > pmtridfv1 | Structured version Visualization version GIF version | ||
| Description: Value at X 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 |
|---|---|
| pmtridfv1 | ⊢ (𝜑 → (𝑇‘𝑋) = 𝑌) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | pmtridf1o.t | . . . . 5 ⊢ 𝑇 = if(𝑋 = 𝑌, ( I ↾ 𝐴), ((pmTrsp‘𝐴)‘{𝑋, 𝑌})) | |
| 2 | simpr 484 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑋 = 𝑌) → 𝑋 = 𝑌) | |
| 3 | 2 | iftrued 4533 | . . . . 5 ⊢ ((𝜑 ∧ 𝑋 = 𝑌) → if(𝑋 = 𝑌, ( I ↾ 𝐴), ((pmTrsp‘𝐴)‘{𝑋, 𝑌})) = ( I ↾ 𝐴)) |
| 4 | 1, 3 | eqtrid 2789 | . . . 4 ⊢ ((𝜑 ∧ 𝑋 = 𝑌) → 𝑇 = ( I ↾ 𝐴)) |
| 5 | 4 | fveq1d 6908 | . . 3 ⊢ ((𝜑 ∧ 𝑋 = 𝑌) → (𝑇‘𝑋) = (( I ↾ 𝐴)‘𝑋)) |
| 6 | pmtridf1o.x | . . . . 5 ⊢ (𝜑 → 𝑋 ∈ 𝐴) | |
| 7 | fvresi 7193 | . . . . 5 ⊢ (𝑋 ∈ 𝐴 → (( I ↾ 𝐴)‘𝑋) = 𝑋) | |
| 8 | 6, 7 | syl 17 | . . . 4 ⊢ (𝜑 → (( I ↾ 𝐴)‘𝑋) = 𝑋) |
| 9 | 8 | adantr 480 | . . 3 ⊢ ((𝜑 ∧ 𝑋 = 𝑌) → (( I ↾ 𝐴)‘𝑋) = 𝑋) |
| 10 | 5, 9, 2 | 3eqtrd 2781 | . 2 ⊢ ((𝜑 ∧ 𝑋 = 𝑌) → (𝑇‘𝑋) = 𝑌) |
| 11 | simpr 484 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑋 ≠ 𝑌) → 𝑋 ≠ 𝑌) | |
| 12 | 11 | neneqd 2945 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑋 ≠ 𝑌) → ¬ 𝑋 = 𝑌) |
| 13 | 12 | iffalsed 4536 | . . . . 5 ⊢ ((𝜑 ∧ 𝑋 ≠ 𝑌) → if(𝑋 = 𝑌, ( I ↾ 𝐴), ((pmTrsp‘𝐴)‘{𝑋, 𝑌})) = ((pmTrsp‘𝐴)‘{𝑋, 𝑌})) |
| 14 | 1, 13 | eqtrid 2789 | . . . 4 ⊢ ((𝜑 ∧ 𝑋 ≠ 𝑌) → 𝑇 = ((pmTrsp‘𝐴)‘{𝑋, 𝑌})) |
| 15 | 14 | fveq1d 6908 | . . 3 ⊢ ((𝜑 ∧ 𝑋 ≠ 𝑌) → (𝑇‘𝑋) = (((pmTrsp‘𝐴)‘{𝑋, 𝑌})‘𝑋)) |
| 16 | pmtridf1o.a | . . . . 5 ⊢ (𝜑 → 𝐴 ∈ 𝑉) | |
| 17 | 16 | adantr 480 | . . . 4 ⊢ ((𝜑 ∧ 𝑋 ≠ 𝑌) → 𝐴 ∈ 𝑉) |
| 18 | 6 | adantr 480 | . . . 4 ⊢ ((𝜑 ∧ 𝑋 ≠ 𝑌) → 𝑋 ∈ 𝐴) |
| 19 | pmtridf1o.y | . . . . 5 ⊢ (𝜑 → 𝑌 ∈ 𝐴) | |
| 20 | 19 | adantr 480 | . . . 4 ⊢ ((𝜑 ∧ 𝑋 ≠ 𝑌) → 𝑌 ∈ 𝐴) |
| 21 | eqid 2737 | . . . . 5 ⊢ (pmTrsp‘𝐴) = (pmTrsp‘𝐴) | |
| 22 | 21 | pmtrprfv 19471 | . . . 4 ⊢ ((𝐴 ∈ 𝑉 ∧ (𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝐴 ∧ 𝑋 ≠ 𝑌)) → (((pmTrsp‘𝐴)‘{𝑋, 𝑌})‘𝑋) = 𝑌) |
| 23 | 17, 18, 20, 11, 22 | syl13anc 1374 | . . 3 ⊢ ((𝜑 ∧ 𝑋 ≠ 𝑌) → (((pmTrsp‘𝐴)‘{𝑋, 𝑌})‘𝑋) = 𝑌) |
| 24 | 15, 23 | eqtrd 2777 | . 2 ⊢ ((𝜑 ∧ 𝑋 ≠ 𝑌) → (𝑇‘𝑋) = 𝑌) |
| 25 | 10, 24 | pm2.61dane 3029 | 1 ⊢ (𝜑 → (𝑇‘𝑋) = 𝑌) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 = wceq 1540 ∈ wcel 2108 ≠ wne 2940 ifcif 4525 {cpr 4628 I cid 5577 ↾ cres 5687 ‘cfv 6561 pmTrspcpmtr 19459 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2007 ax-8 2110 ax-9 2118 ax-10 2141 ax-11 2157 ax-12 2177 ax-ext 2708 ax-rep 5279 ax-sep 5296 ax-nul 5306 ax-pow 5365 ax-pr 5432 ax-un 7755 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3an 1089 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2065 df-mo 2540 df-eu 2569 df-clab 2715 df-cleq 2729 df-clel 2816 df-nfc 2892 df-ne 2941 df-ral 3062 df-rex 3071 df-reu 3381 df-rab 3437 df-v 3482 df-sbc 3789 df-csb 3900 df-dif 3954 df-un 3956 df-in 3958 df-ss 3968 df-nul 4334 df-if 4526 df-pw 4602 df-sn 4627 df-pr 4629 df-op 4633 df-uni 4908 df-iun 4993 df-br 5144 df-opab 5206 df-mpt 5226 df-id 5578 df-xp 5691 df-rel 5692 df-cnv 5693 df-co 5694 df-dm 5695 df-rn 5696 df-res 5697 df-ima 5698 df-suc 6390 df-iota 6514 df-fun 6563 df-fn 6564 df-f 6565 df-f1 6566 df-fo 6567 df-f1o 6568 df-fv 6569 df-1o 8506 df-2o 8507 df-en 8986 df-pmtr 19460 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |