| Mathbox for Norm Megill |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > istendod | Structured version Visualization version GIF version | ||
| Description: Deduce the predicate "is a trace-preserving endomorphism". (Contributed by NM, 9-Jun-2013.) |
| Ref | Expression |
|---|---|
| tendoset.l | ⊢ ≤ = (le‘𝐾) |
| tendoset.h | ⊢ 𝐻 = (LHyp‘𝐾) |
| tendoset.t | ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊) |
| tendoset.r | ⊢ 𝑅 = ((trL‘𝐾)‘𝑊) |
| tendoset.e | ⊢ 𝐸 = ((TEndo‘𝐾)‘𝑊) |
| istendod.1 | ⊢ (𝜑 → (𝐾 ∈ 𝑉 ∧ 𝑊 ∈ 𝐻)) |
| istendod.2 | ⊢ (𝜑 → 𝑆:𝑇⟶𝑇) |
| istendod.3 | ⊢ ((𝜑 ∧ 𝑓 ∈ 𝑇 ∧ 𝑔 ∈ 𝑇) → (𝑆‘(𝑓 ∘ 𝑔)) = ((𝑆‘𝑓) ∘ (𝑆‘𝑔))) |
| istendod.4 | ⊢ ((𝜑 ∧ 𝑓 ∈ 𝑇) → (𝑅‘(𝑆‘𝑓)) ≤ (𝑅‘𝑓)) |
| Ref | Expression |
|---|---|
| istendod | ⊢ (𝜑 → 𝑆 ∈ 𝐸) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | istendod.2 | . 2 ⊢ (𝜑 → 𝑆:𝑇⟶𝑇) | |
| 2 | istendod.3 | . . . 4 ⊢ ((𝜑 ∧ 𝑓 ∈ 𝑇 ∧ 𝑔 ∈ 𝑇) → (𝑆‘(𝑓 ∘ 𝑔)) = ((𝑆‘𝑓) ∘ (𝑆‘𝑔))) | |
| 3 | 2 | 3expb 1121 | . . 3 ⊢ ((𝜑 ∧ (𝑓 ∈ 𝑇 ∧ 𝑔 ∈ 𝑇)) → (𝑆‘(𝑓 ∘ 𝑔)) = ((𝑆‘𝑓) ∘ (𝑆‘𝑔))) |
| 4 | 3 | ralrimivva 3181 | . 2 ⊢ (𝜑 → ∀𝑓 ∈ 𝑇 ∀𝑔 ∈ 𝑇 (𝑆‘(𝑓 ∘ 𝑔)) = ((𝑆‘𝑓) ∘ (𝑆‘𝑔))) |
| 5 | istendod.4 | . . 3 ⊢ ((𝜑 ∧ 𝑓 ∈ 𝑇) → (𝑅‘(𝑆‘𝑓)) ≤ (𝑅‘𝑓)) | |
| 6 | 5 | ralrimiva 3130 | . 2 ⊢ (𝜑 → ∀𝑓 ∈ 𝑇 (𝑅‘(𝑆‘𝑓)) ≤ (𝑅‘𝑓)) |
| 7 | istendod.1 | . . 3 ⊢ (𝜑 → (𝐾 ∈ 𝑉 ∧ 𝑊 ∈ 𝐻)) | |
| 8 | tendoset.l | . . . 4 ⊢ ≤ = (le‘𝐾) | |
| 9 | tendoset.h | . . . 4 ⊢ 𝐻 = (LHyp‘𝐾) | |
| 10 | tendoset.t | . . . 4 ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊) | |
| 11 | tendoset.r | . . . 4 ⊢ 𝑅 = ((trL‘𝐾)‘𝑊) | |
| 12 | tendoset.e | . . . 4 ⊢ 𝐸 = ((TEndo‘𝐾)‘𝑊) | |
| 13 | 8, 9, 10, 11, 12 | istendo 41125 | . . 3 ⊢ ((𝐾 ∈ 𝑉 ∧ 𝑊 ∈ 𝐻) → (𝑆 ∈ 𝐸 ↔ (𝑆:𝑇⟶𝑇 ∧ ∀𝑓 ∈ 𝑇 ∀𝑔 ∈ 𝑇 (𝑆‘(𝑓 ∘ 𝑔)) = ((𝑆‘𝑓) ∘ (𝑆‘𝑔)) ∧ ∀𝑓 ∈ 𝑇 (𝑅‘(𝑆‘𝑓)) ≤ (𝑅‘𝑓)))) |
| 14 | 7, 13 | syl 17 | . 2 ⊢ (𝜑 → (𝑆 ∈ 𝐸 ↔ (𝑆:𝑇⟶𝑇 ∧ ∀𝑓 ∈ 𝑇 ∀𝑔 ∈ 𝑇 (𝑆‘(𝑓 ∘ 𝑔)) = ((𝑆‘𝑓) ∘ (𝑆‘𝑔)) ∧ ∀𝑓 ∈ 𝑇 (𝑅‘(𝑆‘𝑓)) ≤ (𝑅‘𝑓)))) |
| 15 | 1, 4, 6, 14 | mpbir3and 1344 | 1 ⊢ (𝜑 → 𝑆 ∈ 𝐸) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 ∧ w3a 1087 = wceq 1542 ∈ wcel 2114 ∀wral 3052 class class class wbr 5100 ∘ ccom 5636 ⟶wf 6496 ‘cfv 6500 lecple 17196 LHypclh 40349 LTrncltrn 40466 trLctrl 40523 TEndoctendo 41117 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-rep 5226 ax-sep 5243 ax-nul 5253 ax-pow 5312 ax-pr 5379 ax-un 7690 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-ral 3053 df-rex 3063 df-reu 3353 df-rab 3402 df-v 3444 df-sbc 3743 df-csb 3852 df-dif 3906 df-un 3908 df-in 3910 df-ss 3920 df-nul 4288 df-if 4482 df-pw 4558 df-sn 4583 df-pr 4585 df-op 4589 df-uni 4866 df-iun 4950 df-br 5101 df-opab 5163 df-mpt 5182 df-id 5527 df-xp 5638 df-rel 5639 df-cnv 5640 df-co 5641 df-dm 5642 df-rn 5643 df-res 5644 df-ima 5645 df-iota 6456 df-fun 6502 df-fn 6503 df-f 6504 df-f1 6505 df-fo 6506 df-f1o 6507 df-fv 6508 df-ov 7371 df-oprab 7372 df-mpo 7373 df-map 8777 df-tendo 41120 |
| This theorem is referenced by: tendoidcl 41134 tendococl 41137 tendoplcl 41146 tendo0cl 41155 tendoicl 41161 cdlemk56 41336 |
| Copyright terms: Public domain | W3C validator |