| 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 2763 | . . 3 ⊢ (le‘𝐾) = (le‘𝐾) | |
| 2 | eqid 2763 | . . 3 ⊢ (Atoms‘𝐾) = (Atoms‘𝐾) | |
| 3 | trlid0.h | . . 3 ⊢ 𝐻 = (LHyp‘𝐾) | |
| 4 | 1, 2, 3 | lhpexnle 41266 | . 2 ⊢ ((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) → ∃𝑝 ∈ (Atoms‘𝐾) ¬ 𝑝(le‘𝐾)𝑊) |
| 5 | simpl 488 | . . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑝 ∈ (Atoms‘𝐾) ∧ ¬ 𝑝(le‘𝐾)𝑊)) → (𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻)) | |
| 6 | simpr 490 | . . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑝 ∈ (Atoms‘𝐾) ∧ ¬ 𝑝(le‘𝐾)𝑊)) → (𝑝 ∈ (Atoms‘𝐾) ∧ ¬ 𝑝(le‘𝐾)𝑊)) | |
| 7 | trlid0.b | . . . . 5 ⊢ 𝐵 = (Base‘𝐾) | |
| 8 | eqid 2763 | . . . . 5 ⊢ ((LTrn‘𝐾)‘𝑊) = ((LTrn‘𝐾)‘𝑊) | |
| 9 | 7, 3, 8 | idltrn 41410 | . . . 4 ⊢ ((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) → ( I ↾ 𝐵) ∈ ((LTrn‘𝐾)‘𝑊)) |
| 10 | 9 | adantr 486 | . . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑝 ∈ (Atoms‘𝐾) ∧ ¬ 𝑝(le‘𝐾)𝑊)) → ( I ↾ 𝐵) ∈ ((LTrn‘𝐾)‘𝑊)) |
| 11 | eqid 2763 | . . . 4 ⊢ ( I ↾ 𝐵) = ( I ↾ 𝐵) | |
| 12 | 7, 1, 2, 3, 8 | ltrnideq 41435 | . . . . 5 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ( I ↾ 𝐵) ∈ ((LTrn‘𝐾)‘𝑊) ∧ (𝑝 ∈ (Atoms‘𝐾) ∧ ¬ 𝑝(le‘𝐾)𝑊)) → (( I ↾ 𝐵) = ( I ↾ 𝐵) ↔ (( I ↾ 𝐵)‘𝑝) = 𝑝)) |
| 13 | 5, 10, 6, 12 | syl3anc 1399 | . . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑝 ∈ (Atoms‘𝐾) ∧ ¬ 𝑝(le‘𝐾)𝑊)) → (( I ↾ 𝐵) = ( I ↾ 𝐵) ↔ (( I ↾ 𝐵)‘𝑝) = 𝑝)) |
| 14 | 11, 13 | mpbii 236 | . . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑝 ∈ (Atoms‘𝐾) ∧ ¬ 𝑝(le‘𝐾)𝑊)) → (( I ↾ 𝐵)‘𝑝) = 𝑝) |
| 15 | trlid0.z | . . . 4 ⊢ 0 = (0.‘𝐾) | |
| 16 | trlid0.r | . . . 4 ⊢ 𝑅 = ((trL‘𝐾)‘𝑊) | |
| 17 | 1, 15, 2, 3, 8, 16 | trl0 41430 | . . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑝 ∈ (Atoms‘𝐾) ∧ ¬ 𝑝(le‘𝐾)𝑊) ∧ (( I ↾ 𝐵) ∈ ((LTrn‘𝐾)‘𝑊) ∧ (( I ↾ 𝐵)‘𝑝) = 𝑝)) → (𝑅‘( I ↾ 𝐵)) = 0 ) |
| 18 | 5, 6, 10, 14, 17 | syl112anc 1402 | . 2 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑝 ∈ (Atoms‘𝐾) ∧ ¬ 𝑝(le‘𝐾)𝑊)) → (𝑅‘( I ↾ 𝐵)) = 0 ) |
| 19 | 4, 18 | rexlimddv 3173 | 1 ⊢ ((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) → (𝑅‘( I ↾ 𝐵)) = 0 ) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 → wi 4 ↔ wb 209 ∧ wa 401 = wceq 1570 ∈ wcel 2147 class class class wbr 5106 I cid 5550 ↾ cres 5658 ‘cfv 6561 Basecbs 17419 lecple 17467 0.cp0 18627 Atomscatm 40523 HLchlt 40610 LHypclh 41244 LTrncltrn 41361 trLctrl 41418 |
| 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-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 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-riota 7403 df-ov 7449 df-oprab 7450 df-mpo 7451 df-map 8880 df-proset 18500 df-poset 18519 df-plt 18534 df-lub 18550 df-glb 18551 df-join 18552 df-meet 18553 df-p0 18629 df-p1 18630 df-lat 18638 df-clat 18705 df-oposet 40436 df-ol 40438 df-oml 40439 df-covers 40526 df-ats 40527 df-atl 40558 df-cvlat 40582 df-hlat 40611 df-lhyp 41248 df-laut 41249 df-ldil 41364 df-ltrn 41365 df-trl 41419 |
| This theorem is used by: tendoid 42033 tendo0tp 42049 cdlemkid2 42184 cdlemk39s-id 42200 dian0 42299 dihmeetlem4preN 42566 |
| Copyright terms: Public domain | W3C validator |