![]() |
Mathbox for Norm Megill |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > Mathboxes > dihord2cN | Structured version Visualization version GIF version |
Description: Part of proof after Lemma N of [Crawley] p. 122. Reverse ordering property. TODO: needed? shorten other proof with it? (Contributed by NM, 3-Mar-2014.) (New usage is discouraged.) |
Ref | Expression |
---|---|
dihjust.b | ⊢ 𝐵 = (Base‘𝐾) |
dihjust.l | ⊢ ≤ = (le‘𝐾) |
dihjust.j | ⊢ ∨ = (join‘𝐾) |
dihjust.m | ⊢ ∧ = (meet‘𝐾) |
dihjust.a | ⊢ 𝐴 = (Atoms‘𝐾) |
dihjust.h | ⊢ 𝐻 = (LHyp‘𝐾) |
dihjust.i | ⊢ 𝐼 = ((DIsoB‘𝐾)‘𝑊) |
dihjust.J | ⊢ 𝐽 = ((DIsoC‘𝐾)‘𝑊) |
dihjust.u | ⊢ 𝑈 = ((DVecH‘𝐾)‘𝑊) |
dihjust.s | ⊢ ⊕ = (LSSum‘𝑈) |
dihord2c.t | ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊) |
dihord2c.r | ⊢ 𝑅 = ((trL‘𝐾)‘𝑊) |
dihord2c.o | ⊢ 𝑂 = (ℎ ∈ 𝑇 ↦ ( I ↾ 𝐵)) |
Ref | Expression |
---|---|
dihord2cN | ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝑋 ∈ 𝐵 ∧ (𝑓 ∈ 𝑇 ∧ (𝑅‘𝑓) ≤ (𝑋 ∧ 𝑊))) → 〈𝑓, 𝑂〉 ∈ (𝐼‘(𝑋 ∧ 𝑊))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | simp3 1135 | . 2 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝑋 ∈ 𝐵 ∧ (𝑓 ∈ 𝑇 ∧ (𝑅‘𝑓) ≤ (𝑋 ∧ 𝑊))) → (𝑓 ∈ 𝑇 ∧ (𝑅‘𝑓) ≤ (𝑋 ∧ 𝑊))) | |
2 | eqidd 2799 | . 2 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝑋 ∈ 𝐵 ∧ (𝑓 ∈ 𝑇 ∧ (𝑅‘𝑓) ≤ (𝑋 ∧ 𝑊))) → 𝑂 = 𝑂) | |
3 | simp1 1133 | . . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝑋 ∈ 𝐵 ∧ (𝑓 ∈ 𝑇 ∧ (𝑅‘𝑓) ≤ (𝑋 ∧ 𝑊))) → (𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻)) | |
4 | simp1l 1194 | . . . . 5 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝑋 ∈ 𝐵 ∧ (𝑓 ∈ 𝑇 ∧ (𝑅‘𝑓) ≤ (𝑋 ∧ 𝑊))) → 𝐾 ∈ HL) | |
5 | 4 | hllatd 36660 | . . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝑋 ∈ 𝐵 ∧ (𝑓 ∈ 𝑇 ∧ (𝑅‘𝑓) ≤ (𝑋 ∧ 𝑊))) → 𝐾 ∈ Lat) |
6 | simp2 1134 | . . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝑋 ∈ 𝐵 ∧ (𝑓 ∈ 𝑇 ∧ (𝑅‘𝑓) ≤ (𝑋 ∧ 𝑊))) → 𝑋 ∈ 𝐵) | |
7 | simp1r 1195 | . . . . 5 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝑋 ∈ 𝐵 ∧ (𝑓 ∈ 𝑇 ∧ (𝑅‘𝑓) ≤ (𝑋 ∧ 𝑊))) → 𝑊 ∈ 𝐻) | |
8 | dihjust.b | . . . . . 6 ⊢ 𝐵 = (Base‘𝐾) | |
9 | dihjust.h | . . . . . 6 ⊢ 𝐻 = (LHyp‘𝐾) | |
10 | 8, 9 | lhpbase 37294 | . . . . 5 ⊢ (𝑊 ∈ 𝐻 → 𝑊 ∈ 𝐵) |
11 | 7, 10 | syl 17 | . . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝑋 ∈ 𝐵 ∧ (𝑓 ∈ 𝑇 ∧ (𝑅‘𝑓) ≤ (𝑋 ∧ 𝑊))) → 𝑊 ∈ 𝐵) |
12 | dihjust.m | . . . . 5 ⊢ ∧ = (meet‘𝐾) | |
13 | 8, 12 | latmcl 17654 | . . . 4 ⊢ ((𝐾 ∈ Lat ∧ 𝑋 ∈ 𝐵 ∧ 𝑊 ∈ 𝐵) → (𝑋 ∧ 𝑊) ∈ 𝐵) |
14 | 5, 6, 11, 13 | syl3anc 1368 | . . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝑋 ∈ 𝐵 ∧ (𝑓 ∈ 𝑇 ∧ (𝑅‘𝑓) ≤ (𝑋 ∧ 𝑊))) → (𝑋 ∧ 𝑊) ∈ 𝐵) |
15 | dihjust.l | . . . . 5 ⊢ ≤ = (le‘𝐾) | |
16 | 8, 15, 12 | latmle2 17679 | . . . 4 ⊢ ((𝐾 ∈ Lat ∧ 𝑋 ∈ 𝐵 ∧ 𝑊 ∈ 𝐵) → (𝑋 ∧ 𝑊) ≤ 𝑊) |
17 | 5, 6, 11, 16 | syl3anc 1368 | . . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝑋 ∈ 𝐵 ∧ (𝑓 ∈ 𝑇 ∧ (𝑅‘𝑓) ≤ (𝑋 ∧ 𝑊))) → (𝑋 ∧ 𝑊) ≤ 𝑊) |
18 | dihord2c.t | . . . 4 ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊) | |
19 | dihord2c.r | . . . 4 ⊢ 𝑅 = ((trL‘𝐾)‘𝑊) | |
20 | dihord2c.o | . . . 4 ⊢ 𝑂 = (ℎ ∈ 𝑇 ↦ ( I ↾ 𝐵)) | |
21 | dihjust.i | . . . 4 ⊢ 𝐼 = ((DIsoB‘𝐾)‘𝑊) | |
22 | 8, 15, 9, 18, 19, 20, 21 | dibopelval3 38444 | . . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑋 ∧ 𝑊) ∈ 𝐵 ∧ (𝑋 ∧ 𝑊) ≤ 𝑊)) → (〈𝑓, 𝑂〉 ∈ (𝐼‘(𝑋 ∧ 𝑊)) ↔ ((𝑓 ∈ 𝑇 ∧ (𝑅‘𝑓) ≤ (𝑋 ∧ 𝑊)) ∧ 𝑂 = 𝑂))) |
23 | 3, 14, 17, 22 | syl12anc 835 | . 2 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝑋 ∈ 𝐵 ∧ (𝑓 ∈ 𝑇 ∧ (𝑅‘𝑓) ≤ (𝑋 ∧ 𝑊))) → (〈𝑓, 𝑂〉 ∈ (𝐼‘(𝑋 ∧ 𝑊)) ↔ ((𝑓 ∈ 𝑇 ∧ (𝑅‘𝑓) ≤ (𝑋 ∧ 𝑊)) ∧ 𝑂 = 𝑂))) |
24 | 1, 2, 23 | mpbir2and 712 | 1 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝑋 ∈ 𝐵 ∧ (𝑓 ∈ 𝑇 ∧ (𝑅‘𝑓) ≤ (𝑋 ∧ 𝑊))) → 〈𝑓, 𝑂〉 ∈ (𝐼‘(𝑋 ∧ 𝑊))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 209 ∧ wa 399 ∧ w3a 1084 = wceq 1538 ∈ wcel 2111 〈cop 4531 class class class wbr 5030 ↦ cmpt 5110 I cid 5424 ↾ cres 5521 ‘cfv 6324 (class class class)co 7135 Basecbs 16475 lecple 16564 joincjn 17546 meetcmee 17547 Latclat 17647 LSSumclsm 18751 Atomscatm 36559 HLchlt 36646 LHypclh 37280 LTrncltrn 37397 trLctrl 37454 DVecHcdvh 38374 DIsoBcdib 38434 DIsoCcdic 38468 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2113 ax-9 2121 ax-10 2142 ax-11 2158 ax-12 2175 ax-ext 2770 ax-rep 5154 ax-sep 5167 ax-nul 5174 ax-pow 5231 ax-pr 5295 ax-un 7441 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 845 df-3an 1086 df-tru 1541 df-ex 1782 df-nf 1786 df-sb 2070 df-mo 2598 df-eu 2629 df-clab 2777 df-cleq 2791 df-clel 2870 df-nfc 2938 df-ne 2988 df-ral 3111 df-rex 3112 df-reu 3113 df-rab 3115 df-v 3443 df-sbc 3721 df-csb 3829 df-dif 3884 df-un 3886 df-in 3888 df-ss 3898 df-nul 4244 df-if 4426 df-pw 4499 df-sn 4526 df-pr 4528 df-op 4532 df-uni 4801 df-iun 4883 df-br 5031 df-opab 5093 df-mpt 5111 df-id 5425 df-xp 5525 df-rel 5526 df-cnv 5527 df-co 5528 df-dm 5529 df-rn 5530 df-res 5531 df-ima 5532 df-iota 6283 df-fun 6326 df-fn 6327 df-f 6328 df-f1 6329 df-fo 6330 df-f1o 6331 df-fv 6332 df-riota 7093 df-ov 7138 df-oprab 7139 df-lub 17576 df-glb 17577 df-join 17578 df-meet 17579 df-lat 17648 df-atl 36594 df-cvlat 36618 df-hlat 36647 df-lhyp 37284 df-disoa 38325 df-dib 38435 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |