| Mathbox for Norm Megill |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > dihvalb | Structured version Visualization version GIF version | ||
| Description: Value of isomorphism H for a lattice 𝐾 when 𝑋 ≤ 𝑊. (Contributed by NM, 4-Mar-2014.) |
| Ref | Expression |
|---|---|
| dihvalb.b | ⊢ 𝐵 = (Base‘𝐾) |
| dihvalb.l | ⊢ ≤ = (le‘𝐾) |
| dihvalb.h | ⊢ 𝐻 = (LHyp‘𝐾) |
| dihvalb.i | ⊢ 𝐼 = ((DIsoH‘𝐾)‘𝑊) |
| dihvalb.d | ⊢ 𝐷 = ((DIsoB‘𝐾)‘𝑊) |
| Ref | Expression |
|---|---|
| dihvalb | ⊢ (((𝐾 ∈ 𝑉 ∧ 𝑊 ∈ 𝐻) ∧ (𝑋 ∈ 𝐵 ∧ 𝑋 ≤ 𝑊)) → (𝐼‘𝑋) = (𝐷‘𝑋)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | dihvalb.b | . . . 4 ⊢ 𝐵 = (Base‘𝐾) | |
| 2 | dihvalb.l | . . . 4 ⊢ ≤ = (le‘𝐾) | |
| 3 | eqid 2763 | . . . 4 ⊢ (join‘𝐾) = (join‘𝐾) | |
| 4 | eqid 2763 | . . . 4 ⊢ (meet‘𝐾) = (meet‘𝐾) | |
| 5 | eqid 2763 | . . . 4 ⊢ (Atoms‘𝐾) = (Atoms‘𝐾) | |
| 6 | dihvalb.h | . . . 4 ⊢ 𝐻 = (LHyp‘𝐾) | |
| 7 | dihvalb.i | . . . 4 ⊢ 𝐼 = ((DIsoH‘𝐾)‘𝑊) | |
| 8 | dihvalb.d | . . . 4 ⊢ 𝐷 = ((DIsoB‘𝐾)‘𝑊) | |
| 9 | eqid 2763 | . . . 4 ⊢ ((DIsoC‘𝐾)‘𝑊) = ((DIsoC‘𝐾)‘𝑊) | |
| 10 | eqid 2763 | . . . 4 ⊢ ((DVecH‘𝐾)‘𝑊) = ((DVecH‘𝐾)‘𝑊) | |
| 11 | eqid 2763 | . . . 4 ⊢ (LSubSp‘((DVecH‘𝐾)‘𝑊)) = (LSubSp‘((DVecH‘𝐾)‘𝑊)) | |
| 12 | eqid 2763 | . . . 4 ⊢ (LSSum‘((DVecH‘𝐾)‘𝑊)) = (LSSum‘((DVecH‘𝐾)‘𝑊)) | |
| 13 | 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12 | dihval 42555 | . . 3 ⊢ (((𝐾 ∈ 𝑉 ∧ 𝑊 ∈ 𝐻) ∧ 𝑋 ∈ 𝐵) → (𝐼‘𝑋) = if(𝑋 ≤ 𝑊, (𝐷‘𝑋), (℩𝑢 ∈ (LSubSp‘((DVecH‘𝐾)‘𝑊))∀𝑞 ∈ (Atoms‘𝐾)((¬ 𝑞 ≤ 𝑊 ∧ (𝑞(join‘𝐾)(𝑋(meet‘𝐾)𝑊)) = 𝑋) → 𝑢 = ((((DIsoC‘𝐾)‘𝑊)‘𝑞)(LSSum‘((DVecH‘𝐾)‘𝑊))(𝐷‘(𝑋(meet‘𝐾)𝑊))))))) |
| 14 | iftrue 4491 | . . 3 ⊢ (𝑋 ≤ 𝑊 → if(𝑋 ≤ 𝑊, (𝐷‘𝑋), (℩𝑢 ∈ (LSubSp‘((DVecH‘𝐾)‘𝑊))∀𝑞 ∈ (Atoms‘𝐾)((¬ 𝑞 ≤ 𝑊 ∧ (𝑞(join‘𝐾)(𝑋(meet‘𝐾)𝑊)) = 𝑋) → 𝑢 = ((((DIsoC‘𝐾)‘𝑊)‘𝑞)(LSSum‘((DVecH‘𝐾)‘𝑊))(𝐷‘(𝑋(meet‘𝐾)𝑊)))))) = (𝐷‘𝑋)) | |
| 15 | 13, 14 | sylan9eq 2818 | . 2 ⊢ ((((𝐾 ∈ 𝑉 ∧ 𝑊 ∈ 𝐻) ∧ 𝑋 ∈ 𝐵) ∧ 𝑋 ≤ 𝑊) → (𝐼‘𝑋) = (𝐷‘𝑋)) |
| 16 | 15 | anasss 472 | 1 ⊢ (((𝐾 ∈ 𝑉 ∧ 𝑊 ∈ 𝐻) ∧ (𝑋 ∈ 𝐵 ∧ 𝑋 ≤ 𝑊)) → (𝐼‘𝑋) = (𝐷‘𝑋)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 → wi 4 ∧ wa 401 = wceq 1570 ∈ wcel 2147 ∀wral 3080 ifcif 4485 class class class wbr 5108 ‘cfv 6566 ℩crio 7407 (class class class)co 7451 Basecbs 17431 lecple 17479 joincjn 18535 meetcmee 18536 LSSumclsm 19899 LSubSpclss 21257 Atomscatm 40586 LHypclh 41307 DVecHcdvh 42401 DIsoBcdib 42461 DIsoCcdic 42495 DIsoHcdih 42551 |
| 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 5238 ax-sep 5255 ax-nul 5266 ax-pr 5398 |
| 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-sn 4589 df-pr 4591 df-op 4841 df-uni 4873 df-iun 4958 df-br 5109 df-opab 5174 df-mpt 5193 df-id 5553 df-xp 5664 df-rel 5665 df-cnv 5666 df-co 5667 df-dm 5668 df-rn 5669 df-res 5670 df-ima 5671 df-iota 6520 df-fun 6568 df-fn 6569 df-f 6570 df-f1 6571 df-fo 6572 df-f1o 6573 df-fv 6574 df-riota 7408 df-ov 7454 df-dih 42552 |
| This theorem is used by: dihopelvalbN 42561 dih1dimb 42563 dih2dimb 42567 dih2dimbALTN 42568 dihvalcq2 42570 dihlss 42573 dihord6apre 42579 dihord3 42580 dihord5b 42582 dihord5apre 42585 dih0 42603 dihwN 42612 dihglblem3N 42618 dihmeetlem2N 42622 dih1dimatlem 42652 dihjatcclem4 42744 |
| Copyright terms: Public domain | W3C validator |