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

Theorem istendod 42022
Description: Deduce the predicate "is 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‘𝐾)‘𝑊)
istendod.1 (𝜑 → (𝐾 ∈ 𝑉 ∧ 𝑊 ∈ 𝐻))
istendod.2 (𝜑 → 𝑆:𝑇⟶𝑇)
istendod.3 ((𝜑 ∧ 𝑓 ∈ 𝑇 ∧ 𝑔 ∈ 𝑇) → (𝑆‘(𝑓 ∘ 𝑔)) = ((𝑆‘𝑓) ∘ (𝑆‘𝑔)))
istendod.4 ((𝜑 ∧ 𝑓 ∈ 𝑇) → (𝑅‘(𝑆‘𝑓)) ≤ (𝑅‘𝑓))
Assertion
Ref Expression
istendod (𝜑 → 𝑆 ∈ 𝐸)
Distinct variable groups:   𝑓,𝑔,𝐾   𝑇,𝑓,𝑔   𝑓,𝑊,𝑔   𝑆,𝑓,𝑔   ≤ ,𝑓   𝑅,𝑓   𝜑,𝑓,𝑔
Allowed substitution hints:   𝑅(𝑔)   𝐸(𝑓, 𝑔)   𝐻(𝑓, 𝑔)   ≤ (𝑔)   𝑉(𝑓, 𝑔)

Proof of Theorem istendod
StepHypRef Expression
1 istendod.2 . 2 (𝜑 → 𝑆:𝑇⟶𝑇)
2 istendod.3 . . . 4 ((𝜑 ∧ 𝑓 ∈ 𝑇 ∧ 𝑔 ∈ 𝑇) → (𝑆‘(𝑓 ∘ 𝑔)) = ((𝑆‘𝑓) ∘ (𝑆‘𝑔)))
323expb 1138 . . 3 ((𝜑 ∧ (𝑓 ∈ 𝑇 ∧ 𝑔 ∈ 𝑇)) → (𝑆‘(𝑓 ∘ 𝑔)) = ((𝑆‘𝑓) ∘ (𝑆‘𝑔)))
43ralrimivva 3209 . 2 (𝜑 → ∀𝑓 ∈ 𝑇 ∀𝑔 ∈ 𝑇 (𝑆‘(𝑓 ∘ 𝑔)) = ((𝑆‘𝑓) ∘ (𝑆‘𝑔)))
5 istendod.4 . . 3 ((𝜑 ∧ 𝑓 ∈ 𝑇) → (𝑅‘(𝑆‘𝑓)) ≤ (𝑅‘𝑓))
65ralrimiva 3158 . 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‘𝐾)‘𝑊)
138, 9, 10, 11, 12istendo 42020 . . 3 ((𝐾 ∈ 𝑉 ∧ 𝑊 ∈ 𝐻) → (𝑆 ∈ 𝐸 ↔ (𝑆:𝑇⟶𝑇 ∧ ∀𝑓 ∈ 𝑇 ∀𝑔 ∈ 𝑇 (𝑆‘(𝑓 ∘ 𝑔)) = ((𝑆‘𝑓) ∘ (𝑆‘𝑔)) ∧ ∀𝑓 ∈ 𝑇 (𝑅‘(𝑆‘𝑓)) ≤ (𝑅‘𝑓))))
147, 13syl 18 . 2 (𝜑 → (𝑆 ∈ 𝐸 ↔ (𝑆:𝑇⟶𝑇 ∧ ∀𝑓 ∈ 𝑇 ∀𝑔 ∈ 𝑇 (𝑆‘(𝑓 ∘ 𝑔)) = ((𝑆‘𝑓) ∘ (𝑆‘𝑔)) ∧ ∀𝑓 ∈ 𝑇 (𝑅‘(𝑆‘𝑓)) ≤ (𝑅‘𝑓))))
151, 4, 6, 14mpbir3and 1361 1 (𝜑 → 𝑆 ∈ 𝐸)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2147  ∀wral 3080   class class class wbr 5106   ∘ ccom 5660  ⟶wf 6557  ‘cfv 6561  lecple 17467  LHypclh 41244  LTrncltrn 41361  trLctrl 41418  TEndoctendo 42012
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 5236  ax-sep 5253  ax-nul 5264  ax-pow 5332  ax-pr 5396  ax-un 7778
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 4839  df-uni 4871  df-iun 4956  df-br 5107  df-opab 5172  df-mpt 5191  df-id 5551  df-xp 5662  df-rel 5663  df-cnv 5664  df-co 5665  df-dm 5666  df-rn 5667  df-res 5668  df-ima 5669  df-iota 6515  df-fun 6563  df-fn 6564  df-f 6565  df-f1 6566  df-fo 6567  df-f1o 6568  df-fv 6569  df-ov 7449  df-oprab 7450  df-mpo 7451  df-map 8880  df-tendo 42015
This theorem is used by:  tendoidcl  42029  tendococl  42032  tendoplcl  42041  tendo0cl  42050  tendoicl  42056  cdlemk56  42231
  Copyright terms: Public domain W3C validator