![]() |
Mathbox for Norm Megill |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > Mathboxes > dihord6b | Structured version Visualization version GIF version |
Description: Part of proof that isomorphism H is order-preserving . (Contributed by NM, 7-Mar-2014.) |
Ref | Expression |
---|---|
dihord3.b | ⊢ 𝐵 = (Base‘𝐾) |
dihord3.l | ⊢ ≤ = (le‘𝐾) |
dihord3.h | ⊢ 𝐻 = (LHyp‘𝐾) |
dihord3.i | ⊢ 𝐼 = ((DIsoH‘𝐾)‘𝑊) |
Ref | Expression |
---|---|
dihord6b | ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑋 ∈ 𝐵 ∧ ¬ 𝑋 ≤ 𝑊) ∧ (𝑌 ∈ 𝐵 ∧ 𝑌 ≤ 𝑊)) ∧ 𝑋 ≤ 𝑌) → (𝐼‘𝑋) ⊆ (𝐼‘𝑌)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | simp2r 1180 | . . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑋 ∈ 𝐵 ∧ ¬ 𝑋 ≤ 𝑊) ∧ (𝑌 ∈ 𝐵 ∧ 𝑌 ≤ 𝑊)) → ¬ 𝑋 ≤ 𝑊) | |
2 | simp3r 1182 | . . . . 5 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑋 ∈ 𝐵 ∧ ¬ 𝑋 ≤ 𝑊) ∧ (𝑌 ∈ 𝐵 ∧ 𝑌 ≤ 𝑊)) → 𝑌 ≤ 𝑊) | |
3 | simp1l 1177 | . . . . . . 7 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑋 ∈ 𝐵 ∧ ¬ 𝑋 ≤ 𝑊) ∧ (𝑌 ∈ 𝐵 ∧ 𝑌 ≤ 𝑊)) → 𝐾 ∈ HL) | |
4 | 3 | hllatd 35942 | . . . . . 6 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑋 ∈ 𝐵 ∧ ¬ 𝑋 ≤ 𝑊) ∧ (𝑌 ∈ 𝐵 ∧ 𝑌 ≤ 𝑊)) → 𝐾 ∈ Lat) |
5 | simp2l 1179 | . . . . . 6 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑋 ∈ 𝐵 ∧ ¬ 𝑋 ≤ 𝑊) ∧ (𝑌 ∈ 𝐵 ∧ 𝑌 ≤ 𝑊)) → 𝑋 ∈ 𝐵) | |
6 | simp3l 1181 | . . . . . 6 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑋 ∈ 𝐵 ∧ ¬ 𝑋 ≤ 𝑊) ∧ (𝑌 ∈ 𝐵 ∧ 𝑌 ≤ 𝑊)) → 𝑌 ∈ 𝐵) | |
7 | simp1r 1178 | . . . . . . 7 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑋 ∈ 𝐵 ∧ ¬ 𝑋 ≤ 𝑊) ∧ (𝑌 ∈ 𝐵 ∧ 𝑌 ≤ 𝑊)) → 𝑊 ∈ 𝐻) | |
8 | dihord3.b | . . . . . . . 8 ⊢ 𝐵 = (Base‘𝐾) | |
9 | dihord3.h | . . . . . . . 8 ⊢ 𝐻 = (LHyp‘𝐾) | |
10 | 8, 9 | lhpbase 36576 | . . . . . . 7 ⊢ (𝑊 ∈ 𝐻 → 𝑊 ∈ 𝐵) |
11 | 7, 10 | syl 17 | . . . . . 6 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑋 ∈ 𝐵 ∧ ¬ 𝑋 ≤ 𝑊) ∧ (𝑌 ∈ 𝐵 ∧ 𝑌 ≤ 𝑊)) → 𝑊 ∈ 𝐵) |
12 | dihord3.l | . . . . . . 7 ⊢ ≤ = (le‘𝐾) | |
13 | 8, 12 | lattr 17524 | . . . . . 6 ⊢ ((𝐾 ∈ Lat ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑊 ∈ 𝐵)) → ((𝑋 ≤ 𝑌 ∧ 𝑌 ≤ 𝑊) → 𝑋 ≤ 𝑊)) |
14 | 4, 5, 6, 11, 13 | syl13anc 1352 | . . . . 5 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑋 ∈ 𝐵 ∧ ¬ 𝑋 ≤ 𝑊) ∧ (𝑌 ∈ 𝐵 ∧ 𝑌 ≤ 𝑊)) → ((𝑋 ≤ 𝑌 ∧ 𝑌 ≤ 𝑊) → 𝑋 ≤ 𝑊)) |
15 | 2, 14 | mpan2d 681 | . . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑋 ∈ 𝐵 ∧ ¬ 𝑋 ≤ 𝑊) ∧ (𝑌 ∈ 𝐵 ∧ 𝑌 ≤ 𝑊)) → (𝑋 ≤ 𝑌 → 𝑋 ≤ 𝑊)) |
16 | 1, 15 | mtod 190 | . . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑋 ∈ 𝐵 ∧ ¬ 𝑋 ≤ 𝑊) ∧ (𝑌 ∈ 𝐵 ∧ 𝑌 ≤ 𝑊)) → ¬ 𝑋 ≤ 𝑌) |
17 | 16 | pm2.21d 119 | . 2 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑋 ∈ 𝐵 ∧ ¬ 𝑋 ≤ 𝑊) ∧ (𝑌 ∈ 𝐵 ∧ 𝑌 ≤ 𝑊)) → (𝑋 ≤ 𝑌 → (𝐼‘𝑋) ⊆ (𝐼‘𝑌))) |
18 | 17 | imp 398 | 1 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑋 ∈ 𝐵 ∧ ¬ 𝑋 ≤ 𝑊) ∧ (𝑌 ∈ 𝐵 ∧ 𝑌 ≤ 𝑊)) ∧ 𝑋 ≤ 𝑌) → (𝐼‘𝑋) ⊆ (𝐼‘𝑌)) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ∧ wa 387 ∧ w3a 1068 = wceq 1507 ∈ wcel 2050 ⊆ wss 3830 class class class wbr 4929 ‘cfv 6188 Basecbs 16339 lecple 16428 Latclat 17513 HLchlt 35928 LHypclh 36562 DIsoHcdih 37806 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1758 ax-4 1772 ax-5 1869 ax-6 1928 ax-7 1965 ax-8 2052 ax-9 2059 ax-10 2079 ax-11 2093 ax-12 2106 ax-13 2301 ax-ext 2751 ax-sep 5060 ax-nul 5067 ax-pow 5119 ax-pr 5186 |
This theorem depends on definitions: df-bi 199 df-an 388 df-or 834 df-3an 1070 df-tru 1510 df-ex 1743 df-nf 1747 df-sb 2016 df-mo 2547 df-eu 2584 df-clab 2760 df-cleq 2772 df-clel 2847 df-nfc 2919 df-ne 2969 df-ral 3094 df-rex 3095 df-rab 3098 df-v 3418 df-sbc 3683 df-dif 3833 df-un 3835 df-in 3837 df-ss 3844 df-nul 4180 df-if 4351 df-sn 4442 df-pr 4444 df-op 4448 df-uni 4713 df-br 4930 df-opab 4992 df-mpt 5009 df-id 5312 df-xp 5413 df-rel 5414 df-cnv 5415 df-co 5416 df-dm 5417 df-iota 6152 df-fun 6190 df-fv 6196 df-ov 6979 df-poset 17414 df-lat 17514 df-atl 35876 df-cvlat 35900 df-hlat 35929 df-lhyp 36566 |
This theorem is referenced by: dihord 37842 |
Copyright terms: Public domain | W3C validator |