| 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 42432 | . . 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 1569 ∈ wcel 2146 ∀wral 3080 ifcif 4485 class class class wbr 5106 ‘cfv 6547 ℩crio 7386 (class class class)co 7430 Basecbs 17402 lecple 17450 joincjn 18500 meetcmee 18501 LSSumclsm 19863 LSubSpclss 21221 Atomscatm 40463 LHypclh 41184 DVecHcdvh 42278 DIsoBcdib 42338 DIsoCcdic 42372 DIsoHcdih 42428 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1944 ax-6 2001 ax-7 2042 ax-8 2148 ax-9 2156 ax-10 2179 ax-11 2196 ax-12 2215 ax-ext 2735 ax-rep 5235 ax-sep 5252 ax-nul 5263 ax-pr 5395 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-nf 1816 df-sb 2101 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 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 6501 df-fun 6549 df-fn 6550 df-f 6551 df-f1 6552 df-fo 6553 df-f1o 6554 df-fv 6555 df-riota 7387 df-ov 7433 df-dih 42429 |
| This theorem is used by: dihopelvalbN 42438 dih1dimb 42440 dih2dimb 42444 dih2dimbALTN 42445 dihvalcq2 42447 dihlss 42450 dihord6apre 42456 dihord3 42457 dihord5b 42459 dihord5apre 42462 dih0 42480 dihwN 42489 dihglblem3N 42495 dihmeetlem2N 42499 dih1dimatlem 42529 dihjatcclem4 42621 |
| Copyright terms: Public domain | W3C validator |