| Mathbox for Norm Megill |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > trlid0 | Structured version Visualization version GIF version | ||
| Description: The trace of the identity translation is zero. (Contributed by NM, 11-Jun-2013.) |
| Ref | Expression |
|---|---|
| trlid0.b | ⊢ 𝐵 = (Base‘𝐾) |
| trlid0.z | ⊢ 0 = (0.‘𝐾) |
| trlid0.h | ⊢ 𝐻 = (LHyp‘𝐾) |
| trlid0.r | ⊢ 𝑅 = ((trL‘𝐾)‘𝑊) |
| Ref | Expression |
|---|---|
| trlid0 | ⊢ ((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) → (𝑅‘( I ↾ 𝐵)) = 0 ) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eqid 2740 | . . 3 ⊢ (le‘𝐾) = (le‘𝐾) | |
| 2 | eqid 2740 | . . 3 ⊢ (Atoms‘𝐾) = (Atoms‘𝐾) | |
| 3 | trlid0.h | . . 3 ⊢ 𝐻 = (LHyp‘𝐾) | |
| 4 | 1, 2, 3 | lhpexnle 40505 | . 2 ⊢ ((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) → ∃𝑝 ∈ (Atoms‘𝐾) ¬ 𝑝(le‘𝐾)𝑊) |
| 5 | simpl 483 | . . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑝 ∈ (Atoms‘𝐾) ∧ ¬ 𝑝(le‘𝐾)𝑊)) → (𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻)) | |
| 6 | simpr 485 | . . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑝 ∈ (Atoms‘𝐾) ∧ ¬ 𝑝(le‘𝐾)𝑊)) → (𝑝 ∈ (Atoms‘𝐾) ∧ ¬ 𝑝(le‘𝐾)𝑊)) | |
| 7 | trlid0.b | . . . . 5 ⊢ 𝐵 = (Base‘𝐾) | |
| 8 | eqid 2740 | . . . . 5 ⊢ ((LTrn‘𝐾)‘𝑊) = ((LTrn‘𝐾)‘𝑊) | |
| 9 | 7, 3, 8 | idltrn 40649 | . . . 4 ⊢ ((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) → ( I ↾ 𝐵) ∈ ((LTrn‘𝐾)‘𝑊)) |
| 10 | 9 | adantr 481 | . . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑝 ∈ (Atoms‘𝐾) ∧ ¬ 𝑝(le‘𝐾)𝑊)) → ( I ↾ 𝐵) ∈ ((LTrn‘𝐾)‘𝑊)) |
| 11 | eqid 2740 | . . . 4 ⊢ ( I ↾ 𝐵) = ( I ↾ 𝐵) | |
| 12 | 7, 1, 2, 3, 8 | ltrnideq 40674 | . . . . 5 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ( I ↾ 𝐵) ∈ ((LTrn‘𝐾)‘𝑊) ∧ (𝑝 ∈ (Atoms‘𝐾) ∧ ¬ 𝑝(le‘𝐾)𝑊)) → (( I ↾ 𝐵) = ( I ↾ 𝐵) ↔ (( I ↾ 𝐵)‘𝑝) = 𝑝)) |
| 13 | 5, 10, 6, 12 | syl3anc 1379 | . . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑝 ∈ (Atoms‘𝐾) ∧ ¬ 𝑝(le‘𝐾)𝑊)) → (( I ↾ 𝐵) = ( I ↾ 𝐵) ↔ (( I ↾ 𝐵)‘𝑝) = 𝑝)) |
| 14 | 11, 13 | mpbii 234 | . . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑝 ∈ (Atoms‘𝐾) ∧ ¬ 𝑝(le‘𝐾)𝑊)) → (( I ↾ 𝐵)‘𝑝) = 𝑝) |
| 15 | trlid0.z | . . . 4 ⊢ 0 = (0.‘𝐾) | |
| 16 | trlid0.r | . . . 4 ⊢ 𝑅 = ((trL‘𝐾)‘𝑊) | |
| 17 | 1, 15, 2, 3, 8, 16 | trl0 40669 | . . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑝 ∈ (Atoms‘𝐾) ∧ ¬ 𝑝(le‘𝐾)𝑊) ∧ (( I ↾ 𝐵) ∈ ((LTrn‘𝐾)‘𝑊) ∧ (( I ↾ 𝐵)‘𝑝) = 𝑝)) → (𝑅‘( I ↾ 𝐵)) = 0 ) |
| 18 | 5, 6, 10, 14, 17 | syl112anc 1382 | . 2 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑝 ∈ (Atoms‘𝐾) ∧ ¬ 𝑝(le‘𝐾)𝑊)) → (𝑅‘( I ↾ 𝐵)) = 0 ) |
| 19 | 4, 18 | rexlimddv 3147 | 1 ⊢ ((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) → (𝑅‘( I ↾ 𝐵)) = 0 ) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ↔ wb 207 ∧ wa 396 = wceq 1547 ∈ wcel 2119 class class class wbr 5079 I cid 5519 ↾ cres 5627 ‘cfv 6492 Basecbs 17177 lecple 17225 0.cp0 18385 Atomscatm 39762 HLchlt 39849 LHypclh 40483 LTrncltrn 40600 trLctrl 40657 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1802 ax-4 1816 ax-5 1917 ax-6 1974 ax-7 2015 ax-8 2121 ax-9 2129 ax-10 2152 ax-11 2168 ax-12 2189 ax-ext 2712 ax-rep 5206 ax-sep 5225 ax-nul 5235 ax-pow 5301 ax-pr 5369 ax-un 7685 |
| This theorem depends on definitions: df-bi 208 df-an 397 df-or 854 df-3an 1094 df-tru 1550 df-fal 1560 df-ex 1787 df-nf 1791 df-sb 2074 df-mo 2543 df-eu 2573 df-clab 2719 df-cleq 2732 df-clel 2815 df-nfc 2889 df-ne 2936 df-ral 3055 df-rex 3065 df-rmo 3345 df-reu 3346 df-rab 3393 df-v 3434 df-sbc 3731 df-csb 3839 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-nul 4269 df-if 4462 df-pw 4538 df-sn 4563 df-pr 4565 df-op 4569 df-uni 4846 df-iun 4930 df-br 5080 df-opab 5142 df-mpt 5161 df-id 5520 df-xp 5631 df-rel 5632 df-cnv 5633 df-co 5634 df-dm 5635 df-rn 5636 df-res 5637 df-ima 5638 df-iota 6448 df-fun 6494 df-fn 6495 df-f 6496 df-f1 6497 df-fo 6498 df-f1o 6499 df-fv 6500 df-riota 7320 df-ov 7366 df-oprab 7367 df-mpo 7368 df-map 8772 df-proset 18258 df-poset 18277 df-plt 18292 df-lub 18308 df-glb 18309 df-join 18310 df-meet 18311 df-p0 18387 df-p1 18388 df-lat 18396 df-clat 18463 df-oposet 39675 df-ol 39677 df-oml 39678 df-covers 39765 df-ats 39766 df-atl 39797 df-cvlat 39821 df-hlat 39850 df-lhyp 40487 df-laut 40488 df-ldil 40603 df-ltrn 40604 df-trl 40658 |
| This theorem is referenced by: tendoid 41272 tendo0tp 41288 cdlemkid2 41423 cdlemk39s-id 41439 dian0 41538 dihmeetlem4preN 41805 |
| Copyright terms: Public domain | W3C validator |