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 1192 | . . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑋 ∈ 𝐵 ∧ ¬ 𝑋 ≤ 𝑊) ∧ (𝑌 ∈ 𝐵 ∧ 𝑌 ≤ 𝑊)) → ¬ 𝑋 ≤ 𝑊) | |
2 | simp3r 1194 | . . . . 5 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑋 ∈ 𝐵 ∧ ¬ 𝑋 ≤ 𝑊) ∧ (𝑌 ∈ 𝐵 ∧ 𝑌 ≤ 𝑊)) → 𝑌 ≤ 𝑊) | |
3 | simp1l 1189 | . . . . . . 7 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑋 ∈ 𝐵 ∧ ¬ 𝑋 ≤ 𝑊) ∧ (𝑌 ∈ 𝐵 ∧ 𝑌 ≤ 𝑊)) → 𝐾 ∈ HL) | |
4 | 3 | hllatd 36380 | . . . . . 6 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑋 ∈ 𝐵 ∧ ¬ 𝑋 ≤ 𝑊) ∧ (𝑌 ∈ 𝐵 ∧ 𝑌 ≤ 𝑊)) → 𝐾 ∈ Lat) |
5 | simp2l 1191 | . . . . . 6 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑋 ∈ 𝐵 ∧ ¬ 𝑋 ≤ 𝑊) ∧ (𝑌 ∈ 𝐵 ∧ 𝑌 ≤ 𝑊)) → 𝑋 ∈ 𝐵) | |
6 | simp3l 1193 | . . . . . 6 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑋 ∈ 𝐵 ∧ ¬ 𝑋 ≤ 𝑊) ∧ (𝑌 ∈ 𝐵 ∧ 𝑌 ≤ 𝑊)) → 𝑌 ∈ 𝐵) | |
7 | simp1r 1190 | . . . . . . 7 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑋 ∈ 𝐵 ∧ ¬ 𝑋 ≤ 𝑊) ∧ (𝑌 ∈ 𝐵 ∧ 𝑌 ≤ 𝑊)) → 𝑊 ∈ 𝐻) | |
8 | dihord3.b | . . . . . . . 8 ⊢ 𝐵 = (Base‘𝐾) | |
9 | dihord3.h | . . . . . . . 8 ⊢ 𝐻 = (LHyp‘𝐾) | |
10 | 8, 9 | lhpbase 37014 | . . . . . . 7 ⊢ (𝑊 ∈ 𝐻 → 𝑊 ∈ 𝐵) |
11 | 7, 10 | syl 17 | . . . . . 6 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑋 ∈ 𝐵 ∧ ¬ 𝑋 ≤ 𝑊) ∧ (𝑌 ∈ 𝐵 ∧ 𝑌 ≤ 𝑊)) → 𝑊 ∈ 𝐵) |
12 | dihord3.l | . . . . . . 7 ⊢ ≤ = (le‘𝐾) | |
13 | 8, 12 | lattr 17654 | . . . . . 6 ⊢ ((𝐾 ∈ Lat ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑊 ∈ 𝐵)) → ((𝑋 ≤ 𝑌 ∧ 𝑌 ≤ 𝑊) → 𝑋 ≤ 𝑊)) |
14 | 4, 5, 6, 11, 13 | syl13anc 1364 | . . . . 5 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑋 ∈ 𝐵 ∧ ¬ 𝑋 ≤ 𝑊) ∧ (𝑌 ∈ 𝐵 ∧ 𝑌 ≤ 𝑊)) → ((𝑋 ≤ 𝑌 ∧ 𝑌 ≤ 𝑊) → 𝑋 ≤ 𝑊)) |
15 | 2, 14 | mpan2d 690 | . . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑋 ∈ 𝐵 ∧ ¬ 𝑋 ≤ 𝑊) ∧ (𝑌 ∈ 𝐵 ∧ 𝑌 ≤ 𝑊)) → (𝑋 ≤ 𝑌 → 𝑋 ≤ 𝑊)) |
16 | 1, 15 | mtod 199 | . . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑋 ∈ 𝐵 ∧ ¬ 𝑋 ≤ 𝑊) ∧ (𝑌 ∈ 𝐵 ∧ 𝑌 ≤ 𝑊)) → ¬ 𝑋 ≤ 𝑌) |
17 | 16 | pm2.21d 121 | . 2 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑋 ∈ 𝐵 ∧ ¬ 𝑋 ≤ 𝑊) ∧ (𝑌 ∈ 𝐵 ∧ 𝑌 ≤ 𝑊)) → (𝑋 ≤ 𝑌 → (𝐼‘𝑋) ⊆ (𝐼‘𝑌))) |
18 | 17 | imp 407 | 1 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑋 ∈ 𝐵 ∧ ¬ 𝑋 ≤ 𝑊) ∧ (𝑌 ∈ 𝐵 ∧ 𝑌 ≤ 𝑊)) ∧ 𝑋 ≤ 𝑌) → (𝐼‘𝑋) ⊆ (𝐼‘𝑌)) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ∧ wa 396 ∧ w3a 1079 = wceq 1528 ∈ wcel 2105 ⊆ wss 3933 class class class wbr 5057 ‘cfv 6348 Basecbs 16471 lecple 16560 Latclat 17643 HLchlt 36366 LHypclh 37000 DIsoHcdih 38244 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1787 ax-4 1801 ax-5 1902 ax-6 1961 ax-7 2006 ax-8 2107 ax-9 2115 ax-10 2136 ax-11 2151 ax-12 2167 ax-ext 2790 ax-sep 5194 ax-nul 5201 ax-pow 5257 ax-pr 5320 |
This theorem depends on definitions: df-bi 208 df-an 397 df-or 842 df-3an 1081 df-tru 1531 df-ex 1772 df-nf 1776 df-sb 2061 df-mo 2615 df-eu 2647 df-clab 2797 df-cleq 2811 df-clel 2890 df-nfc 2960 df-ne 3014 df-ral 3140 df-rex 3141 df-rab 3144 df-v 3494 df-sbc 3770 df-dif 3936 df-un 3938 df-in 3940 df-ss 3949 df-nul 4289 df-if 4464 df-sn 4558 df-pr 4560 df-op 4564 df-uni 4831 df-br 5058 df-opab 5120 df-mpt 5138 df-id 5453 df-xp 5554 df-rel 5555 df-cnv 5556 df-co 5557 df-dm 5558 df-iota 6307 df-fun 6350 df-fv 6356 df-ov 7148 df-poset 17544 df-lat 17644 df-atl 36314 df-cvlat 36338 df-hlat 36367 df-lhyp 37004 |
This theorem is referenced by: dihord 38280 |
Copyright terms: Public domain | W3C validator |