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

Theorem tendoeq2 42022
Description: Condition determining equality of two trace-preserving endomorphisms, showing it is unnecessary to consider the identity translation. In tendocan 42072, we show that we only need to consider a single non-identity translation. (Contributed by NM, 21-Jun-2013.)
Hypotheses
Ref Expression
tendoeq2.b 𝐵 = (Base‘𝐾)
tendoeq2.h 𝐻 = (LHyp‘𝐾)
tendoeq2.t 𝑇 = ((LTrn‘𝐾)‘𝑊)
tendoeq2.e 𝐸 = ((TEndo‘𝐾)‘𝑊)
Assertion
Ref Expression
tendoeq2 (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑈 ∈ 𝐸 ∧ 𝑉 ∈ 𝐸) ∧ ∀𝑓 ∈ 𝑇 (𝑓 ≠ ( I ↾ 𝐵) → (𝑈‘𝑓) = (𝑉‘𝑓))) → 𝑈 = 𝑉)
Distinct variable groups:   𝑓,𝐸   𝑓,𝐻   𝑓,𝐾   𝑇,𝑓   𝑓,𝑊   𝑈,𝑓   𝑓,𝑉
Allowed substitution hint:   𝐵(𝑓)

Proof of Theorem tendoeq2
StepHypRef Expression
1 tendoeq2.b . . . . . . . 8 𝐵 = (Base‘𝐾)
2 tendoeq2.h . . . . . . . 8 𝐻 = (LHyp‘𝐾)
3 tendoeq2.e . . . . . . . 8 𝐸 = ((TEndo‘𝐾)‘𝑊)
41, 2, 3tendoid 42021 . . . . . . 7 (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝑈 ∈ 𝐸) → (𝑈‘( I ↾ 𝐵)) = ( I ↾ 𝐵))
54adantrr 730 . . . . . 6 (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑈 ∈ 𝐸 ∧ 𝑉 ∈ 𝐸)) → (𝑈‘( I ↾ 𝐵)) = ( I ↾ 𝐵))
61, 2, 3tendoid 42021 . . . . . . 7 (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝑉 ∈ 𝐸) → (𝑉‘( I ↾ 𝐵)) = ( I ↾ 𝐵))
76adantrl 729 . . . . . 6 (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑈 ∈ 𝐸 ∧ 𝑉 ∈ 𝐸)) → (𝑉‘( I ↾ 𝐵)) = ( I ↾ 𝐵))
85, 7eqtr4d 2801 . . . . 5 (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑈 ∈ 𝐸 ∧ 𝑉 ∈ 𝐸)) → (𝑈‘( I ↾ 𝐵)) = (𝑉‘( I ↾ 𝐵)))
9 fveq2 6905 . . . . . 6 (𝑓 = ( I ↾ 𝐵) → (𝑈‘𝑓) = (𝑈‘( I ↾ 𝐵)))
10 fveq2 6905 . . . . . 6 (𝑓 = ( I ↾ 𝐵) → (𝑉‘𝑓) = (𝑉‘( I ↾ 𝐵)))
119, 10eqeq12d 2779 . . . . 5 (𝑓 = ( I ↾ 𝐵) → ((𝑈‘𝑓) = (𝑉‘𝑓) ↔ (𝑈‘( I ↾ 𝐵)) = (𝑉‘( I ↾ 𝐵))))
128, 11syl5ibrcom 250 . . . 4 (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑈 ∈ 𝐸 ∧ 𝑉 ∈ 𝐸)) → (𝑓 = ( I ↾ 𝐵) → (𝑈‘𝑓) = (𝑉‘𝑓)))
1312ralrimivw 3162 . . 3 (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑈 ∈ 𝐸 ∧ 𝑉 ∈ 𝐸)) → ∀𝑓 ∈ 𝑇 (𝑓 = ( I ↾ 𝐵) → (𝑈‘𝑓) = (𝑉‘𝑓)))
14 r19.26 3126 . . . . 5 (∀𝑓 ∈ 𝑇 ((𝑓 = ( I ↾ 𝐵) → (𝑈‘𝑓) = (𝑉‘𝑓)) ∧ (𝑓 ≠ ( I ↾ 𝐵) → (𝑈‘𝑓) = (𝑉‘𝑓))) ↔ (∀𝑓 ∈ 𝑇 (𝑓 = ( I ↾ 𝐵) → (𝑈‘𝑓) = (𝑉‘𝑓)) ∧ ∀𝑓 ∈ 𝑇 (𝑓 ≠ ( I ↾ 𝐵) → (𝑈‘𝑓) = (𝑉‘𝑓))))
15 jaob 976 . . . . . . 7 (((𝑓 = ( I ↾ 𝐵) ∨ 𝑓 ≠ ( I ↾ 𝐵)) → (𝑈‘𝑓) = (𝑉‘𝑓)) ↔ ((𝑓 = ( I ↾ 𝐵) → (𝑈‘𝑓) = (𝑉‘𝑓)) ∧ (𝑓 ≠ ( I ↾ 𝐵) → (𝑈‘𝑓) = (𝑉‘𝑓))))
16 exmidne 2969 . . . . . . . 8 (𝑓 = ( I ↾ 𝐵) ∨ 𝑓 ≠ ( I ↾ 𝐵))
17 pm5.5 364 . . . . . . . 8 ((𝑓 = ( I ↾ 𝐵) ∨ 𝑓 ≠ ( I ↾ 𝐵)) → (((𝑓 = ( I ↾ 𝐵) ∨ 𝑓 ≠ ( I ↾ 𝐵)) → (𝑈‘𝑓) = (𝑉‘𝑓)) ↔ (𝑈‘𝑓) = (𝑉‘𝑓)))
1816, 17ax-mp 5 . . . . . . 7 (((𝑓 = ( I ↾ 𝐵) ∨ 𝑓 ≠ ( I ↾ 𝐵)) → (𝑈‘𝑓) = (𝑉‘𝑓)) ↔ (𝑈‘𝑓) = (𝑉‘𝑓))
1915, 18bitr3i 280 . . . . . 6 (((𝑓 = ( I ↾ 𝐵) → (𝑈‘𝑓) = (𝑉‘𝑓)) ∧ (𝑓 ≠ ( I ↾ 𝐵) → (𝑈‘𝑓) = (𝑉‘𝑓))) ↔ (𝑈‘𝑓) = (𝑉‘𝑓))
2019ralbii 3112 . . . . 5 (∀𝑓 ∈ 𝑇 ((𝑓 = ( I ↾ 𝐵) → (𝑈‘𝑓) = (𝑉‘𝑓)) ∧ (𝑓 ≠ ( I ↾ 𝐵) → (𝑈‘𝑓) = (𝑉‘𝑓))) ↔ ∀𝑓 ∈ 𝑇 (𝑈‘𝑓) = (𝑉‘𝑓))
2114, 20bitr3i 280 . . . 4 ((∀𝑓 ∈ 𝑇 (𝑓 = ( I ↾ 𝐵) → (𝑈‘𝑓) = (𝑉‘𝑓)) ∧ ∀𝑓 ∈ 𝑇 (𝑓 ≠ ( I ↾ 𝐵) → (𝑈‘𝑓) = (𝑉‘𝑓))) ↔ ∀𝑓 ∈ 𝑇 (𝑈‘𝑓) = (𝑉‘𝑓))
22 tendoeq2.t . . . . . 6 𝑇 = ((LTrn‘𝐾)‘𝑊)
232, 22, 3tendoeq1 42012 . . . . 5 (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑈 ∈ 𝐸 ∧ 𝑉 ∈ 𝐸) ∧ ∀𝑓 ∈ 𝑇 (𝑈‘𝑓) = (𝑉‘𝑓)) → 𝑈 = 𝑉)
24233expia 1139 . . . 4 (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑈 ∈ 𝐸 ∧ 𝑉 ∈ 𝐸)) → (∀𝑓 ∈ 𝑇 (𝑈‘𝑓) = (𝑉‘𝑓) → 𝑈 = 𝑉))
2521, 24biimtrid 245 . . 3 (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑈 ∈ 𝐸 ∧ 𝑉 ∈ 𝐸)) → ((∀𝑓 ∈ 𝑇 (𝑓 = ( I ↾ 𝐵) → (𝑈‘𝑓) = (𝑉‘𝑓)) ∧ ∀𝑓 ∈ 𝑇 (𝑓 ≠ ( I ↾ 𝐵) → (𝑈‘𝑓) = (𝑉‘𝑓))) → 𝑈 = 𝑉))
2613, 25mpand 708 . 2 (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑈 ∈ 𝐸 ∧ 𝑉 ∈ 𝐸)) → (∀𝑓 ∈ 𝑇 (𝑓 ≠ ( I ↾ 𝐵) → (𝑈‘𝑓) = (𝑉‘𝑓)) → 𝑈 = 𝑉))
27263impia 1135 1 (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑈 ∈ 𝐸 ∧ 𝑉 ∈ 𝐸) ∧ ∀𝑓 ∈ 𝑇 (𝑓 ≠ ( I ↾ 𝐵) → (𝑈‘𝑓) = (𝑉‘𝑓))) → 𝑈 = 𝑉)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∨ wo 861   ∧ w3a 1103   = wceq 1570   ∈ wcel 2147   ≠ wne 2959  ∀wral 3080   I cid 5549   ↾ cres 5657  ‘cfv 6555  Basecbs 17413  HLchlt 40598  LHypclh 41232  LTrncltrn 41349  TEndoctendo 42000
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 5235  ax-sep 5252  ax-nul 5263  ax-pow 5331  ax-pr 5395  ax-un 7772
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-rmo 3369  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 5171  df-mpt 5190  df-id 5550  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-iota 6509  df-fun 6557  df-fn 6558  df-f 6559  df-f1 6560  df-fo 6561  df-f1o 6562  df-fv 6563  df-riota 7397  df-ov 7443  df-oprab 7444  df-mpo 7445  df-map 8874  df-proset 18494  df-poset 18513  df-plt 18528  df-lub 18544  df-glb 18545  df-join 18546  df-meet 18547  df-p0 18623  df-p1 18624  df-lat 18632  df-clat 18699  df-oposet 40424  df-ol 40426  df-oml 40427  df-covers 40514  df-ats 40515  df-atl 40546  df-cvlat 40570  df-hlat 40599  df-lhyp 41236  df-laut 41237  df-ldil 41352  df-ltrn 41353  df-trl 41407  df-tendo 42003
This theorem is used by:  tendocan  42072
  Copyright terms: Public domain W3C validator