![]() |
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 4529 | . . . . 5 ⊢ ((𝜑 ∧ 𝑋 = 𝑌) → if(𝑋 = 𝑌, ( I ↾ 𝐴), ((pmTrsp‘𝐴)‘{𝑋, 𝑌})) = ( I ↾ 𝐴)) |
4 | 1, 3 | eqtrid 2776 | . . . 4 ⊢ ((𝜑 ∧ 𝑋 = 𝑌) → 𝑇 = ( I ↾ 𝐴)) |
5 | 4 | fveq1d 6884 | . . 3 ⊢ ((𝜑 ∧ 𝑋 = 𝑌) → (𝑇‘𝑋) = (( I ↾ 𝐴)‘𝑋)) |
6 | pmtridf1o.x | . . . . 5 ⊢ (𝜑 → 𝑋 ∈ 𝐴) | |
7 | fvresi 7164 | . . . . 5 ⊢ (𝑋 ∈ 𝐴 → (( I ↾ 𝐴)‘𝑋) = 𝑋) | |
8 | 6, 7 | syl 17 | . . . 4 ⊢ (𝜑 → (( I ↾ 𝐴)‘𝑋) = 𝑋) |
9 | 8 | adantr 480 | . . 3 ⊢ ((𝜑 ∧ 𝑋 = 𝑌) → (( I ↾ 𝐴)‘𝑋) = 𝑋) |
10 | 5, 9, 2 | 3eqtrd 2768 | . 2 ⊢ ((𝜑 ∧ 𝑋 = 𝑌) → (𝑇‘𝑋) = 𝑌) |
11 | simpr 484 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑋 ≠ 𝑌) → 𝑋 ≠ 𝑌) | |
12 | 11 | neneqd 2937 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑋 ≠ 𝑌) → ¬ 𝑋 = 𝑌) |
13 | 12 | iffalsed 4532 | . . . . 5 ⊢ ((𝜑 ∧ 𝑋 ≠ 𝑌) → if(𝑋 = 𝑌, ( I ↾ 𝐴), ((pmTrsp‘𝐴)‘{𝑋, 𝑌})) = ((pmTrsp‘𝐴)‘{𝑋, 𝑌})) |
14 | 1, 13 | eqtrid 2776 | . . . 4 ⊢ ((𝜑 ∧ 𝑋 ≠ 𝑌) → 𝑇 = ((pmTrsp‘𝐴)‘{𝑋, 𝑌})) |
15 | 14 | fveq1d 6884 | . . 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 2724 | . . . . 5 ⊢ (pmTrsp‘𝐴) = (pmTrsp‘𝐴) | |
22 | 21 | pmtrprfv 19365 | . . . 4 ⊢ ((𝐴 ∈ 𝑉 ∧ (𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝐴 ∧ 𝑋 ≠ 𝑌)) → (((pmTrsp‘𝐴)‘{𝑋, 𝑌})‘𝑋) = 𝑌) |
23 | 17, 18, 20, 11, 22 | syl13anc 1369 | . . 3 ⊢ ((𝜑 ∧ 𝑋 ≠ 𝑌) → (((pmTrsp‘𝐴)‘{𝑋, 𝑌})‘𝑋) = 𝑌) |
24 | 15, 23 | eqtrd 2764 | . 2 ⊢ ((𝜑 ∧ 𝑋 ≠ 𝑌) → (𝑇‘𝑋) = 𝑌) |
25 | 10, 24 | pm2.61dane 3021 | 1 ⊢ (𝜑 → (𝑇‘𝑋) = 𝑌) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 395 = wceq 1533 ∈ wcel 2098 ≠ wne 2932 ifcif 4521 {cpr 4623 I cid 5564 ↾ cres 5669 ‘cfv 6534 pmTrspcpmtr 19353 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1789 ax-4 1803 ax-5 1905 ax-6 1963 ax-7 2003 ax-8 2100 ax-9 2108 ax-10 2129 ax-11 2146 ax-12 2163 ax-ext 2695 ax-rep 5276 ax-sep 5290 ax-nul 5297 ax-pow 5354 ax-pr 5418 ax-un 7719 |
This theorem depends on definitions: df-bi 206 df-an 396 df-or 845 df-3an 1086 df-tru 1536 df-fal 1546 df-ex 1774 df-nf 1778 df-sb 2060 df-mo 2526 df-eu 2555 df-clab 2702 df-cleq 2716 df-clel 2802 df-nfc 2877 df-ne 2933 df-ral 3054 df-rex 3063 df-reu 3369 df-rab 3425 df-v 3468 df-sbc 3771 df-csb 3887 df-dif 3944 df-un 3946 df-in 3948 df-ss 3958 df-nul 4316 df-if 4522 df-pw 4597 df-sn 4622 df-pr 4624 df-op 4628 df-uni 4901 df-iun 4990 df-br 5140 df-opab 5202 df-mpt 5223 df-id 5565 df-xp 5673 df-rel 5674 df-cnv 5675 df-co 5676 df-dm 5677 df-rn 5678 df-res 5679 df-ima 5680 df-suc 6361 df-iota 6486 df-fun 6536 df-fn 6537 df-f 6538 df-f1 6539 df-fo 6540 df-f1o 6541 df-fv 6542 df-1o 8462 df-2o 8463 df-en 8937 df-pmtr 19354 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |