Users' Mathboxes Mathbox for Norm Megill < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  tendotp Structured version   Visualization version   GIF version

Theorem tendotp 42084
Description: Trace-preserving property of a trace-preserving endomorphism. (Contributed by NM, 9-Jun-2013.)
Hypotheses
Ref Expression
tendoset.l ≤ = (le‘𝐾)
tendoset.h 𝐻 = (LHyp‘𝐾)
tendoset.t 𝑇 = ((LTrn‘𝐾)‘𝑊)
tendoset.r 𝑅 = ((trL‘𝐾)‘𝑊)
tendoset.e 𝐸 = ((TEndo‘𝐾)‘𝑊)
Assertion
Ref Expression
tendotp (((𝐾 ∈ 𝑉 ∧ 𝑊 ∈ 𝐻) ∧ 𝑆 ∈ 𝐸 ∧ 𝐹 ∈ 𝑇) → (𝑅‘(𝑆‘𝐹)) ≤ (𝑅‘𝐹))

Proof of Theorem tendotp
Dummy variables 𝑓 𝑔 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 tendoset.l . . . 4 ≤ = (le‘𝐾)
2 tendoset.h . . . 4 𝐻 = (LHyp‘𝐾)
3 tendoset.t . . . 4 𝑇 = ((LTrn‘𝐾)‘𝑊)
4 tendoset.r . . . 4 𝑅 = ((trL‘𝐾)‘𝑊)
5 tendoset.e . . . 4 𝐸 = ((TEndo‘𝐾)‘𝑊)
61, 2, 3, 4, 5istendo 42083 . . 3 ((𝐾 ∈ 𝑉 ∧ 𝑊 ∈ 𝐻) → (𝑆 ∈ 𝐸 ↔ (𝑆:𝑇⟶𝑇 ∧ ∀𝑓 ∈ 𝑇 ∀𝑔 ∈ 𝑇 (𝑆‘(𝑓 ∘ 𝑔)) = ((𝑆‘𝑓) ∘ (𝑆‘𝑔)) ∧ ∀𝑓 ∈ 𝑇 (𝑅‘(𝑆‘𝑓)) ≤ (𝑅‘𝑓))))
7 2fveq3 6921 . . . . . 6 (𝑓 = 𝐹 → (𝑅‘(𝑆‘𝑓)) = (𝑅‘(𝑆‘𝐹)))
8 fveq2 6916 . . . . . 6 (𝑓 = 𝐹 → (𝑅‘𝑓) = (𝑅‘𝐹))
97, 8breq12d 5121 . . . . 5 (𝑓 = 𝐹 → ((𝑅‘(𝑆‘𝑓)) ≤ (𝑅‘𝑓) ↔ (𝑅‘(𝑆‘𝐹)) ≤ (𝑅‘𝐹)))
109rspccv 3577 . . . 4 (∀𝑓 ∈ 𝑇 (𝑅‘(𝑆‘𝑓)) ≤ (𝑅‘𝑓) → (𝐹 ∈ 𝑇 → (𝑅‘(𝑆‘𝐹)) ≤ (𝑅‘𝐹)))
11103ad2ant3 1153 . . 3 ((𝑆:𝑇⟶𝑇 ∧ ∀𝑓 ∈ 𝑇 ∀𝑔 ∈ 𝑇 (𝑆‘(𝑓 ∘ 𝑔)) = ((𝑆‘𝑓) ∘ (𝑆‘𝑔)) ∧ ∀𝑓 ∈ 𝑇 (𝑅‘(𝑆‘𝑓)) ≤ (𝑅‘𝑓)) → (𝐹 ∈ 𝑇 → (𝑅‘(𝑆‘𝐹)) ≤ (𝑅‘𝐹)))
126, 11biimtrdi 256 . 2 ((𝐾 ∈ 𝑉 ∧ 𝑊 ∈ 𝐻) → (𝑆 ∈ 𝐸 → (𝐹 ∈ 𝑇 → (𝑅‘(𝑆‘𝐹)) ≤ (𝑅‘𝐹))))
13123imp 1128 1 (((𝐾 ∈ 𝑉 ∧ 𝑊 ∈ 𝐻) ∧ 𝑆 ∈ 𝐸 ∧ 𝐹 ∈ 𝑇) → (𝑅‘(𝑆‘𝐹)) ≤ (𝑅‘𝐹))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2147  ∀wral 3080   class class class wbr 5108   ∘ ccom 5662  ⟶wf 6562  ‘cfv 6566  lecple 17479  LHypclh 41307  LTrncltrn 41424  trLctrl 41481  TEndoctendo 42075
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-rep 5238  ax-sep 5255  ax-nul 5266  ax-pow 5334  ax-pr 5398  ax-un 7783
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-iun 4958  df-br 5109  df-opab 5174  df-mpt 5193  df-id 5553  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-res 5670  df-ima 5671  df-iota 6520  df-fun 6568  df-fn 6569  df-f 6570  df-f1 6571  df-fo 6572  df-f1o 6573  df-fv 6574  df-ov 7454  df-oprab 7455  df-mpo 7456  df-map 8887  df-tendo 42078
This theorem is used by:  tendococl  42095  tendoid  42096  tendopltp  42103  tendoicl  42119  cdlemi1  42141  tendotr  42153  cdleml1N  42299  dva1dim  42308  dialss  42369  diblss  42493
  Copyright terms: Public domain W3C validator