| 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 40468. (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 1198 | . . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴 ∧ 𝑝 ∈ 𝐴) ∧ (𝑟 ∈ 𝑋 ∧ 𝑞 ∈ ( ⊥ ‘𝑋) ∧ 𝑝 ≤ (𝑟 ∨ 𝑞))) → 𝐾 ∈ HL) | |
| 2 | 1 | hllatd 39863 | . 2 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴 ∧ 𝑝 ∈ 𝐴) ∧ (𝑟 ∈ 𝑋 ∧ 𝑞 ∈ ( ⊥ ‘𝑋) ∧ 𝑝 ≤ (𝑟 ∨ 𝑞))) → 𝐾 ∈ Lat) |
| 3 | simpl2 1199 | . 2 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴 ∧ 𝑝 ∈ 𝐴) ∧ (𝑟 ∈ 𝑋 ∧ 𝑞 ∈ ( ⊥ ‘𝑋) ∧ 𝑝 ≤ (𝑟 ∨ 𝑞))) → 𝑋 ⊆ 𝐴) | |
| 4 | pexmidlem.a | . . . 4 ⊢ 𝐴 = (Atoms‘𝐾) | |
| 5 | pexmidlem.o | . . . 4 ⊢ ⊥ = (⊥𝑃‘𝐾) | |
| 6 | 4, 5 | polssatN 40407 | . . 3 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴) → ( ⊥ ‘𝑋) ⊆ 𝐴) |
| 7 | 1, 3, 6 | syl2anc 590 | . 2 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴 ∧ 𝑝 ∈ 𝐴) ∧ (𝑟 ∈ 𝑋 ∧ 𝑞 ∈ ( ⊥ ‘𝑋) ∧ 𝑝 ≤ (𝑟 ∨ 𝑞))) → ( ⊥ ‘𝑋) ⊆ 𝐴) |
| 8 | simpr1 1201 | . 2 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴 ∧ 𝑝 ∈ 𝐴) ∧ (𝑟 ∈ 𝑋 ∧ 𝑞 ∈ ( ⊥ ‘𝑋) ∧ 𝑝 ≤ (𝑟 ∨ 𝑞))) → 𝑟 ∈ 𝑋) | |
| 9 | simpr2 1202 | . 2 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴 ∧ 𝑝 ∈ 𝐴) ∧ (𝑟 ∈ 𝑋 ∧ 𝑞 ∈ ( ⊥ ‘𝑋) ∧ 𝑝 ≤ (𝑟 ∨ 𝑞))) → 𝑞 ∈ ( ⊥ ‘𝑋)) | |
| 10 | simpl3 1200 | . 2 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴 ∧ 𝑝 ∈ 𝐴) ∧ (𝑟 ∈ 𝑋 ∧ 𝑞 ∈ ( ⊥ ‘𝑋) ∧ 𝑝 ≤ (𝑟 ∨ 𝑞))) → 𝑝 ∈ 𝐴) | |
| 11 | simpr3 1203 | . 2 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴 ∧ 𝑝 ∈ 𝐴) ∧ (𝑟 ∈ 𝑋 ∧ 𝑞 ∈ ( ⊥ ‘𝑋) ∧ 𝑝 ≤ (𝑟 ∨ 𝑞))) → 𝑝 ≤ (𝑟 ∨ 𝑞)) | |
| 12 | pexmidlem.l | . . 3 ⊢ ≤ = (le‘𝐾) | |
| 13 | pexmidlem.j | . . 3 ⊢ ∨ = (join‘𝐾) | |
| 14 | pexmidlem.p | . . 3 ⊢ + = (+𝑃‘𝐾) | |
| 15 | 12, 13, 4, 14 | elpaddri 40301 | . 2 ⊢ (((𝐾 ∈ Lat ∧ 𝑋 ⊆ 𝐴 ∧ ( ⊥ ‘𝑋) ⊆ 𝐴) ∧ (𝑟 ∈ 𝑋 ∧ 𝑞 ∈ ( ⊥ ‘𝑋)) ∧ (𝑝 ∈ 𝐴 ∧ 𝑝 ≤ (𝑟 ∨ 𝑞))) → 𝑝 ∈ (𝑋 + ( ⊥ ‘𝑋))) |
| 16 | 2, 3, 7, 8, 9, 10, 11, 15 | syl322anc 1406 | 1 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴 ∧ 𝑝 ∈ 𝐴) ∧ (𝑟 ∈ 𝑋 ∧ 𝑞 ∈ ( ⊥ ‘𝑋) ∧ 𝑝 ≤ (𝑟 ∨ 𝑞))) → 𝑝 ∈ (𝑋 + ( ⊥ ‘𝑋))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 396 ∧ w3a 1092 = wceq 1547 ∈ wcel 2119 ⊆ wss 3890 {csn 4562 class class class wbr 5079 ‘cfv 6492 (class class class)co 7363 lecple 17225 joincjn 18275 Latclat 18395 Atomscatm 39762 HLchlt 39849 +𝑃cpadd 40294 ⊥𝑃cpolN 40401 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1802 ax-4 1816 ax-5 1917 ax-6 1974 ax-7 2015 ax-8 2121 ax-9 2129 ax-10 2152 ax-11 2168 ax-12 2189 ax-ext 2712 ax-rep 5206 ax-sep 5225 ax-nul 5235 ax-pow 5301 ax-pr 5369 ax-un 7685 |
| This theorem depends on definitions: df-bi 208 df-an 397 df-or 854 df-3an 1094 df-tru 1550 df-fal 1560 df-ex 1787 df-nf 1791 df-sb 2074 df-mo 2543 df-eu 2573 df-clab 2719 df-cleq 2732 df-clel 2815 df-nfc 2889 df-ne 2936 df-ral 3055 df-rex 3065 df-rmo 3345 df-reu 3346 df-rab 3393 df-v 3434 df-sbc 3731 df-csb 3839 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-nul 4269 df-if 4462 df-pw 4538 df-sn 4563 df-pr 4565 df-op 4569 df-uni 4846 df-iun 4930 df-iin 4931 df-br 5080 df-opab 5142 df-mpt 5161 df-id 5520 df-xp 5631 df-rel 5632 df-cnv 5633 df-co 5634 df-dm 5635 df-rn 5636 df-res 5637 df-ima 5638 df-iota 6448 df-fun 6494 df-fn 6495 df-f 6496 df-f1 6497 df-fo 6498 df-f1o 6499 df-fv 6500 df-riota 7320 df-ov 7366 df-oprab 7367 df-mpo 7368 df-1st 7938 df-2nd 7939 df-proset 18258 df-poset 18277 df-lub 18308 df-glb 18309 df-join 18310 df-meet 18311 df-p1 18388 df-lat 18396 df-clat 18463 df-oposet 39675 df-ol 39677 df-oml 39678 df-ats 39766 df-atl 39797 df-cvlat 39821 df-hlat 39850 df-psubsp 40002 df-pmap 40003 df-padd 40295 df-polarityN 40402 |
| This theorem is referenced by: pexmidlem3N 40471 |
| Copyright terms: Public domain | W3C validator |