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

Theorem istendo 37890
Description: The predicate "is a trace-preserving endomorphism". Similar to definition of trace-preserving endomorphism in [Crawley] p. 117, penultimate line. (Contributed by NM, 8-Jun-2013.)
Hypotheses
Ref Expression
tendoset.l = (le‘𝐾)
tendoset.h 𝐻 = (LHyp‘𝐾)
tendoset.t 𝑇 = ((LTrn‘𝐾)‘𝑊)
tendoset.r 𝑅 = ((trL‘𝐾)‘𝑊)
tendoset.e 𝐸 = ((TEndo‘𝐾)‘𝑊)
Assertion
Ref Expression
istendo ((𝐾𝑉𝑊𝐻) → (𝑆𝐸 ↔ (𝑆:𝑇𝑇 ∧ ∀𝑓𝑇𝑔𝑇 (𝑆‘(𝑓𝑔)) = ((𝑆𝑓) ∘ (𝑆𝑔)) ∧ ∀𝑓𝑇 (𝑅‘(𝑆𝑓)) (𝑅𝑓))))
Distinct variable groups:   𝑓,𝑔,𝐾   𝑇,𝑓,𝑔   𝑓,𝑊,𝑔   𝑆,𝑓,𝑔
Allowed substitution hints:   𝑅(𝑓,𝑔)   𝐸(𝑓,𝑔)   𝐻(𝑓,𝑔)   (𝑓,𝑔)   𝑉(𝑓,𝑔)

Proof of Theorem istendo
Dummy variable 𝑠 is 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, 5tendoset 37889 . . 3 ((𝐾𝑉𝑊𝐻) → 𝐸 = {𝑠 ∣ (𝑠:𝑇𝑇 ∧ ∀𝑓𝑇𝑔𝑇 (𝑠‘(𝑓𝑔)) = ((𝑠𝑓) ∘ (𝑠𝑔)) ∧ ∀𝑓𝑇 (𝑅‘(𝑠𝑓)) (𝑅𝑓))})
76eleq2d 2898 . 2 ((𝐾𝑉𝑊𝐻) → (𝑆𝐸𝑆 ∈ {𝑠 ∣ (𝑠:𝑇𝑇 ∧ ∀𝑓𝑇𝑔𝑇 (𝑠‘(𝑓𝑔)) = ((𝑠𝑓) ∘ (𝑠𝑔)) ∧ ∀𝑓𝑇 (𝑅‘(𝑠𝑓)) (𝑅𝑓))}))
83fvexi 6678 . . . . 5 𝑇 ∈ V
9 fex 6983 . . . . 5 ((𝑆:𝑇𝑇𝑇 ∈ V) → 𝑆 ∈ V)
108, 9mpan2 689 . . . 4 (𝑆:𝑇𝑇𝑆 ∈ V)
11103ad2ant1 1129 . . 3 ((𝑆:𝑇𝑇 ∧ ∀𝑓𝑇𝑔𝑇 (𝑆‘(𝑓𝑔)) = ((𝑆𝑓) ∘ (𝑆𝑔)) ∧ ∀𝑓𝑇 (𝑅‘(𝑆𝑓)) (𝑅𝑓)) → 𝑆 ∈ V)
12 feq1 6489 . . . 4 (𝑠 = 𝑆 → (𝑠:𝑇𝑇𝑆:𝑇𝑇))
13 fveq1 6663 . . . . . 6 (𝑠 = 𝑆 → (𝑠‘(𝑓𝑔)) = (𝑆‘(𝑓𝑔)))
14 fveq1 6663 . . . . . . 7 (𝑠 = 𝑆 → (𝑠𝑓) = (𝑆𝑓))
15 fveq1 6663 . . . . . . 7 (𝑠 = 𝑆 → (𝑠𝑔) = (𝑆𝑔))
1614, 15coeq12d 5729 . . . . . 6 (𝑠 = 𝑆 → ((𝑠𝑓) ∘ (𝑠𝑔)) = ((𝑆𝑓) ∘ (𝑆𝑔)))
1713, 16eqeq12d 2837 . . . . 5 (𝑠 = 𝑆 → ((𝑠‘(𝑓𝑔)) = ((𝑠𝑓) ∘ (𝑠𝑔)) ↔ (𝑆‘(𝑓𝑔)) = ((𝑆𝑓) ∘ (𝑆𝑔))))
18172ralbidv 3199 . . . 4 (𝑠 = 𝑆 → (∀𝑓𝑇𝑔𝑇 (𝑠‘(𝑓𝑔)) = ((𝑠𝑓) ∘ (𝑠𝑔)) ↔ ∀𝑓𝑇𝑔𝑇 (𝑆‘(𝑓𝑔)) = ((𝑆𝑓) ∘ (𝑆𝑔))))
1914fveq2d 6668 . . . . . 6 (𝑠 = 𝑆 → (𝑅‘(𝑠𝑓)) = (𝑅‘(𝑆𝑓)))
2019breq1d 5068 . . . . 5 (𝑠 = 𝑆 → ((𝑅‘(𝑠𝑓)) (𝑅𝑓) ↔ (𝑅‘(𝑆𝑓)) (𝑅𝑓)))
2120ralbidv 3197 . . . 4 (𝑠 = 𝑆 → (∀𝑓𝑇 (𝑅‘(𝑠𝑓)) (𝑅𝑓) ↔ ∀𝑓𝑇 (𝑅‘(𝑆𝑓)) (𝑅𝑓)))
2212, 18, 213anbi123d 1432 . . 3 (𝑠 = 𝑆 → ((𝑠:𝑇𝑇 ∧ ∀𝑓𝑇𝑔𝑇 (𝑠‘(𝑓𝑔)) = ((𝑠𝑓) ∘ (𝑠𝑔)) ∧ ∀𝑓𝑇 (𝑅‘(𝑠𝑓)) (𝑅𝑓)) ↔ (𝑆:𝑇𝑇 ∧ ∀𝑓𝑇𝑔𝑇 (𝑆‘(𝑓𝑔)) = ((𝑆𝑓) ∘ (𝑆𝑔)) ∧ ∀𝑓𝑇 (𝑅‘(𝑆𝑓)) (𝑅𝑓))))
2311, 22elab3 3673 . 2 (𝑆 ∈ {𝑠 ∣ (𝑠:𝑇𝑇 ∧ ∀𝑓𝑇𝑔𝑇 (𝑠‘(𝑓𝑔)) = ((𝑠𝑓) ∘ (𝑠𝑔)) ∧ ∀𝑓𝑇 (𝑅‘(𝑠𝑓)) (𝑅𝑓))} ↔ (𝑆:𝑇𝑇 ∧ ∀𝑓𝑇𝑔𝑇 (𝑆‘(𝑓𝑔)) = ((𝑆𝑓) ∘ (𝑆𝑔)) ∧ ∀𝑓𝑇 (𝑅‘(𝑆𝑓)) (𝑅𝑓)))
247, 23syl6bb 289 1 ((𝐾𝑉𝑊𝐻) → (𝑆𝐸 ↔ (𝑆:𝑇𝑇 ∧ ∀𝑓𝑇𝑔𝑇 (𝑆‘(𝑓𝑔)) = ((𝑆𝑓) ∘ (𝑆𝑔)) ∧ ∀𝑓𝑇 (𝑅‘(𝑆𝑓)) (𝑅𝑓))))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 208  wa 398  w3a 1083   = wceq 1533  wcel 2110  {cab 2799  wral 3138  Vcvv 3494   class class class wbr 5058  ccom 5553  wf 6345  cfv 6349  lecple 16566  LHypclh 37114  LTrncltrn 37231  trLctrl 37288  TEndoctendo 37882
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1792  ax-4 1806  ax-5 1907  ax-6 1966  ax-7 2011  ax-8 2112  ax-9 2120  ax-10 2141  ax-11 2157  ax-12 2173  ax-ext 2793  ax-rep 5182  ax-sep 5195  ax-nul 5202  ax-pow 5258  ax-pr 5321  ax-un 7455
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3an 1085  df-tru 1536  df-ex 1777  df-nf 1781  df-sb 2066  df-mo 2618  df-eu 2650  df-clab 2800  df-cleq 2814  df-clel 2893  df-nfc 2963  df-ne 3017  df-ral 3143  df-rex 3144  df-reu 3145  df-rab 3147  df-v 3496  df-sbc 3772  df-csb 3883  df-dif 3938  df-un 3940  df-in 3942  df-ss 3951  df-nul 4291  df-if 4467  df-pw 4540  df-sn 4561  df-pr 4563  df-op 4567  df-uni 4832  df-iun 4913  df-br 5059  df-opab 5121  df-mpt 5139  df-id 5454  df-xp 5555  df-rel 5556  df-cnv 5557  df-co 5558  df-dm 5559  df-rn 5560  df-res 5561  df-ima 5562  df-iota 6308  df-fun 6351  df-fn 6352  df-f 6353  df-f1 6354  df-fo 6355  df-f1o 6356  df-fv 6357  df-ov 7153  df-oprab 7154  df-mpo 7155  df-map 8402  df-tendo 37885
This theorem is referenced by:  tendotp  37891  istendod  37892  tendof  37893  tendovalco  37895
  Copyright terms: Public domain W3C validator