| Mathbox for Norm Megill |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > dihvalc | Structured version Visualization version GIF version | ||
| Description: Value of isomorphism H for a lattice 𝐾 when ¬ 𝑋 ≤ 𝑊. (Contributed by NM, 4-Mar-2014.) |
| Ref | Expression |
|---|---|
| dihval.b | ⊢ 𝐵 = (Base‘𝐾) |
| dihval.l | ⊢ ≤ = (le‘𝐾) |
| dihval.j | ⊢ ∨ = (join‘𝐾) |
| dihval.m | ⊢ ∧ = (meet‘𝐾) |
| dihval.a | ⊢ 𝐴 = (Atoms‘𝐾) |
| dihval.h | ⊢ 𝐻 = (LHyp‘𝐾) |
| dihval.i | ⊢ 𝐼 = ((DIsoH‘𝐾)‘𝑊) |
| dihval.d | ⊢ 𝐷 = ((DIsoB‘𝐾)‘𝑊) |
| dihval.c | ⊢ 𝐶 = ((DIsoC‘𝐾)‘𝑊) |
| dihval.u | ⊢ 𝑈 = ((DVecH‘𝐾)‘𝑊) |
| dihval.s | ⊢ 𝑆 = (LSubSp‘𝑈) |
| dihval.p | ⊢ ⊕ = (LSSum‘𝑈) |
| Ref | Expression |
|---|---|
| dihvalc | ⊢ (((𝐾 ∈ 𝑉 ∧ 𝑊 ∈ 𝐻) ∧ (𝑋 ∈ 𝐵 ∧ ¬ 𝑋 ≤ 𝑊)) → (𝐼‘𝑋) = (℩𝑢 ∈ 𝑆 ∀𝑞 ∈ 𝐴 ((¬ 𝑞 ≤ 𝑊 ∧ (𝑞 ∨ (𝑋 ∧ 𝑊)) = 𝑋) → 𝑢 = ((𝐶‘𝑞) ⊕ (𝐷‘(𝑋 ∧ 𝑊)))))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | dihval.b | . . . 4 ⊢ 𝐵 = (Base‘𝐾) | |
| 2 | dihval.l | . . . 4 ⊢ ≤ = (le‘𝐾) | |
| 3 | dihval.j | . . . 4 ⊢ ∨ = (join‘𝐾) | |
| 4 | dihval.m | . . . 4 ⊢ ∧ = (meet‘𝐾) | |
| 5 | dihval.a | . . . 4 ⊢ 𝐴 = (Atoms‘𝐾) | |
| 6 | dihval.h | . . . 4 ⊢ 𝐻 = (LHyp‘𝐾) | |
| 7 | dihval.i | . . . 4 ⊢ 𝐼 = ((DIsoH‘𝐾)‘𝑊) | |
| 8 | dihval.d | . . . 4 ⊢ 𝐷 = ((DIsoB‘𝐾)‘𝑊) | |
| 9 | dihval.c | . . . 4 ⊢ 𝐶 = ((DIsoC‘𝐾)‘𝑊) | |
| 10 | dihval.u | . . . 4 ⊢ 𝑈 = ((DVecH‘𝐾)‘𝑊) | |
| 11 | dihval.s | . . . 4 ⊢ 𝑆 = (LSubSp‘𝑈) | |
| 12 | dihval.p | . . . 4 ⊢ ⊕ = (LSSum‘𝑈) | |
| 13 | 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12 | dihval 42557 | . . 3 ⊢ (((𝐾 ∈ 𝑉 ∧ 𝑊 ∈ 𝐻) ∧ 𝑋 ∈ 𝐵) → (𝐼‘𝑋) = if(𝑋 ≤ 𝑊, (𝐷‘𝑋), (℩𝑢 ∈ 𝑆 ∀𝑞 ∈ 𝐴 ((¬ 𝑞 ≤ 𝑊 ∧ (𝑞 ∨ (𝑋 ∧ 𝑊)) = 𝑋) → 𝑢 = ((𝐶‘𝑞) ⊕ (𝐷‘(𝑋 ∧ 𝑊))))))) |
| 14 | iffalse 4493 | . . 3 ⊢ (¬ 𝑋 ≤ 𝑊 → if(𝑋 ≤ 𝑊, (𝐷‘𝑋), (℩𝑢 ∈ 𝑆 ∀𝑞 ∈ 𝐴 ((¬ 𝑞 ≤ 𝑊 ∧ (𝑞 ∨ (𝑋 ∧ 𝑊)) = 𝑋) → 𝑢 = ((𝐶‘𝑞) ⊕ (𝐷‘(𝑋 ∧ 𝑊)))))) = (℩𝑢 ∈ 𝑆 ∀𝑞 ∈ 𝐴 ((¬ 𝑞 ≤ 𝑊 ∧ (𝑞 ∨ (𝑋 ∧ 𝑊)) = 𝑋) → 𝑢 = ((𝐶‘𝑞) ⊕ (𝐷‘(𝑋 ∧ 𝑊)))))) | |
| 15 | 13, 14 | sylan9eq 2821 | . 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 1572 ∈ wcel 2150 ∀wral 3083 ifcif 4484 class class class wbr 5107 ‘cfv 6565 ℩crio 7406 (class class class)co 7450 Basecbs 17433 lecple 17481 joincjn 18537 meetcmee 18538 LSSumclsm 19901 LSubSpclss 21259 Atomscatm 40588 LHypclh 41309 DVecHcdvh 42403 DIsoBcdib 42463 DIsoCcdic 42497 DIsoHcdih 42553 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1830 ax-4 1844 ax-5 1947 ax-6 2004 ax-7 2045 ax-8 2152 ax-9 2160 ax-10 2183 ax-11 2200 ax-12 2219 ax-ext 2738 ax-rep 5237 ax-sep 5254 ax-nul 5265 ax-pr 5397 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1106 df-tru 1575 df-fal 1585 df-ex 1815 df-nf 1819 df-sb 2104 df-mo 2570 df-eu 2600 df-clab 2745 df-cleq 2758 df-clel 2842 df-nfc 2916 df-ne 2963 df-ral 3084 df-rex 3094 df-reu 3369 df-rab 3416 df-v 3455 df-sbc 3742 df-csb 3851 df-ss 3900 df-dif 4049 df-in 4093 df-un 4153 df-nul 4281 df-if 4485 df-sn 4588 df-pr 4590 df-op 4840 df-uni 4872 df-iun 4957 df-br 5108 df-opab 5173 df-mpt 5192 df-id 5552 df-xp 5663 df-rel 5664 df-cnv 5665 df-co 5666 df-dm 5667 df-rn 5668 df-res 5669 df-ima 5670 df-iota 6519 df-fun 6567 df-fn 6568 df-f 6569 df-f1 6570 df-fo 6571 df-f1o 6572 df-fv 6573 df-riota 7407 df-ov 7453 df-dih 42554 |
| This theorem is used by: dihlsscpre 42559 dihvalcqpre 42560 |
| Copyright terms: Public domain | W3C validator |