| Mathbox for Norm Megill |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > pexmidlem2N | Structured version Visualization version GIF version | ||
| Description: Lemma for pexmidN 41229. (Contributed by NM, 2-Feb-2012.) (New usage is discouraged.) |
| Ref | Expression |
|---|---|
| pexmidlem.l | ⊢ ≤ = (le‘𝐾) |
| pexmidlem.j | ⊢ ∨ = (join‘𝐾) |
| pexmidlem.a | ⊢ 𝐴 = (Atoms‘𝐾) |
| pexmidlem.p | ⊢ + = (+𝑃‘𝐾) |
| pexmidlem.o | ⊢ ⊥ = (⊥𝑃‘𝐾) |
| pexmidlem.m | ⊢ 𝑀 = (𝑋 + {𝑝}) |
| Ref | Expression |
|---|---|
| pexmidlem2N | ⊢ (((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴 ∧ 𝑝 ∈ 𝐴) ∧ (𝑟 ∈ 𝑋 ∧ 𝑞 ∈ ( ⊥ ‘𝑋) ∧ 𝑝 ≤ (𝑟 ∨ 𝑞))) → 𝑝 ∈ (𝑋 + ( ⊥ ‘𝑋))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | simpl1 1210 | . . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴 ∧ 𝑝 ∈ 𝐴) ∧ (𝑟 ∈ 𝑋 ∧ 𝑞 ∈ ( ⊥ ‘𝑋) ∧ 𝑝 ≤ (𝑟 ∨ 𝑞))) → 𝐾 ∈ HL) | |
| 2 | 1 | hllatd 40624 | . 2 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴 ∧ 𝑝 ∈ 𝐴) ∧ (𝑟 ∈ 𝑋 ∧ 𝑞 ∈ ( ⊥ ‘𝑋) ∧ 𝑝 ≤ (𝑟 ∨ 𝑞))) → 𝐾 ∈ Lat) |
| 3 | simpl2 1211 | . 2 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴 ∧ 𝑝 ∈ 𝐴) ∧ (𝑟 ∈ 𝑋 ∧ 𝑞 ∈ ( ⊥ ‘𝑋) ∧ 𝑝 ≤ (𝑟 ∨ 𝑞))) → 𝑋 ⊆ 𝐴) | |
| 4 | pexmidlem.a | . . . 4 ⊢ 𝐴 = (Atoms‘𝐾) | |
| 5 | pexmidlem.o | . . . 4 ⊢ ⊥ = (⊥𝑃‘𝐾) | |
| 6 | 4, 5 | polssatN 41168 | . . 3 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴) → ( ⊥ ‘𝑋) ⊆ 𝐴) |
| 7 | 1, 3, 6 | syl2anc 596 | . 2 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴 ∧ 𝑝 ∈ 𝐴) ∧ (𝑟 ∈ 𝑋 ∧ 𝑞 ∈ ( ⊥ ‘𝑋) ∧ 𝑝 ≤ (𝑟 ∨ 𝑞))) → ( ⊥ ‘𝑋) ⊆ 𝐴) |
| 8 | simpr1 1213 | . 2 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴 ∧ 𝑝 ∈ 𝐴) ∧ (𝑟 ∈ 𝑋 ∧ 𝑞 ∈ ( ⊥ ‘𝑋) ∧ 𝑝 ≤ (𝑟 ∨ 𝑞))) → 𝑟 ∈ 𝑋) | |
| 9 | simpr2 1214 | . 2 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴 ∧ 𝑝 ∈ 𝐴) ∧ (𝑟 ∈ 𝑋 ∧ 𝑞 ∈ ( ⊥ ‘𝑋) ∧ 𝑝 ≤ (𝑟 ∨ 𝑞))) → 𝑞 ∈ ( ⊥ ‘𝑋)) | |
| 10 | simpl3 1212 | . 2 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴 ∧ 𝑝 ∈ 𝐴) ∧ (𝑟 ∈ 𝑋 ∧ 𝑞 ∈ ( ⊥ ‘𝑋) ∧ 𝑝 ≤ (𝑟 ∨ 𝑞))) → 𝑝 ∈ 𝐴) | |
| 11 | simpr3 1215 | . 2 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴 ∧ 𝑝 ∈ 𝐴) ∧ (𝑟 ∈ 𝑋 ∧ 𝑞 ∈ ( ⊥ ‘𝑋) ∧ 𝑝 ≤ (𝑟 ∨ 𝑞))) → 𝑝 ≤ (𝑟 ∨ 𝑞)) | |
| 12 | pexmidlem.l | . . 3 ⊢ ≤ = (le‘𝐾) | |
| 13 | pexmidlem.j | . . 3 ⊢ ∨ = (join‘𝐾) | |
| 14 | pexmidlem.p | . . 3 ⊢ + = (+𝑃‘𝐾) | |
| 15 | 12, 13, 4, 14 | elpaddri 41062 | . 2 ⊢ (((𝐾 ∈ Lat ∧ 𝑋 ⊆ 𝐴 ∧ ( ⊥ ‘𝑋) ⊆ 𝐴) ∧ (𝑟 ∈ 𝑋 ∧ 𝑞 ∈ ( ⊥ ‘𝑋)) ∧ (𝑝 ∈ 𝐴 ∧ 𝑝 ≤ (𝑟 ∨ 𝑞))) → 𝑝 ∈ (𝑋 + ( ⊥ ‘𝑋))) |
| 16 | 2, 3, 7, 8, 9, 10, 11, 15 | syl322anc 1426 | 1 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴 ∧ 𝑝 ∈ 𝐴) ∧ (𝑟 ∈ 𝑋 ∧ 𝑞 ∈ ( ⊥ ‘𝑋) ∧ 𝑝 ≤ (𝑟 ∨ 𝑞))) → 𝑝 ∈ (𝑋 + ( ⊥ ‘𝑋))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 ∧ w3a 1103 = wceq 1570 ∈ wcel 2147 ⊆ wss 3900 {csn 4588 class class class wbr 5106 ‘cfv 6561 (class class class)co 7446 lecple 17467 joincjn 18517 Latclat 18637 Atomscatm 40523 HLchlt 40610 +𝑃cpadd 41055 ⊥𝑃cpolN 41162 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-rep 5236 ax-sep 5253 ax-nul 5264 ax-pow 5332 ax-pr 5396 ax-un 7778 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2102 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-rmo 3369 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-pw 4562 df-sn 4589 df-pr 4591 df-op 4839 df-uni 4871 df-iun 4956 df-iin 4957 df-br 5107 df-opab 5172 df-mpt 5191 df-id 5551 df-xp 5662 df-rel 5663 df-cnv 5664 df-co 5665 df-dm 5666 df-rn 5667 df-res 5668 df-ima 5669 df-iota 6515 df-fun 6563 df-fn 6564 df-f 6565 df-f1 6566 df-fo 6567 df-f1o 6568 df-fv 6569 df-riota 7403 df-ov 7449 df-oprab 7450 df-mpo 7451 df-1st 8028 df-2nd 8029 df-proset 18500 df-poset 18519 df-lub 18550 df-glb 18551 df-join 18552 df-meet 18553 df-p1 18630 df-lat 18638 df-clat 18705 df-oposet 40436 df-ol 40438 df-oml 40439 df-ats 40527 df-atl 40558 df-cvlat 40582 df-hlat 40611 df-psubsp 40763 df-pmap 40764 df-padd 41056 df-polarityN 41163 |
| This theorem is used by: pexmidlem3N 41232 |
| Copyright terms: Public domain | W3C validator |