| Mathbox for Norm Megill |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > pexmidlem3N | Structured version Visualization version GIF version | ||
| Description: Lemma for pexmidN 39968. Use atom exchange hlatexch1 39394 to swap 𝑝 and 𝑞. (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 |
|---|---|
| pexmidlem3N | ⊢ (((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴 ∧ 𝑝 ∈ 𝐴) ∧ (𝑟 ∈ 𝑋 ∧ 𝑞 ∈ ( ⊥ ‘𝑋)) ∧ 𝑞 ≤ (𝑟 ∨ 𝑝)) → 𝑝 ∈ (𝑋 + ( ⊥ ‘𝑋))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | simp1 1136 | . 2 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴 ∧ 𝑝 ∈ 𝐴) ∧ (𝑟 ∈ 𝑋 ∧ 𝑞 ∈ ( ⊥ ‘𝑋)) ∧ 𝑞 ≤ (𝑟 ∨ 𝑝)) → (𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴 ∧ 𝑝 ∈ 𝐴)) | |
| 2 | simp2l 1200 | . 2 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴 ∧ 𝑝 ∈ 𝐴) ∧ (𝑟 ∈ 𝑋 ∧ 𝑞 ∈ ( ⊥ ‘𝑋)) ∧ 𝑞 ≤ (𝑟 ∨ 𝑝)) → 𝑟 ∈ 𝑋) | |
| 3 | simp2r 1201 | . 2 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴 ∧ 𝑝 ∈ 𝐴) ∧ (𝑟 ∈ 𝑋 ∧ 𝑞 ∈ ( ⊥ ‘𝑋)) ∧ 𝑞 ≤ (𝑟 ∨ 𝑝)) → 𝑞 ∈ ( ⊥ ‘𝑋)) | |
| 4 | simpl1 1192 | . . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴 ∧ 𝑝 ∈ 𝐴) ∧ (𝑟 ∈ 𝑋 ∧ 𝑞 ∈ ( ⊥ ‘𝑋))) → 𝐾 ∈ HL) | |
| 5 | simpl2 1193 | . . . . . 6 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴 ∧ 𝑝 ∈ 𝐴) ∧ (𝑟 ∈ 𝑋 ∧ 𝑞 ∈ ( ⊥ ‘𝑋))) → 𝑋 ⊆ 𝐴) | |
| 6 | pexmidlem.a | . . . . . . 7 ⊢ 𝐴 = (Atoms‘𝐾) | |
| 7 | pexmidlem.o | . . . . . . 7 ⊢ ⊥ = (⊥𝑃‘𝐾) | |
| 8 | 6, 7 | polssatN 39907 | . . . . . 6 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴) → ( ⊥ ‘𝑋) ⊆ 𝐴) |
| 9 | 4, 5, 8 | syl2anc 584 | . . . . 5 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴 ∧ 𝑝 ∈ 𝐴) ∧ (𝑟 ∈ 𝑋 ∧ 𝑞 ∈ ( ⊥ ‘𝑋))) → ( ⊥ ‘𝑋) ⊆ 𝐴) |
| 10 | simprr 772 | . . . . 5 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴 ∧ 𝑝 ∈ 𝐴) ∧ (𝑟 ∈ 𝑋 ∧ 𝑞 ∈ ( ⊥ ‘𝑋))) → 𝑞 ∈ ( ⊥ ‘𝑋)) | |
| 11 | 9, 10 | sseldd 3938 | . . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴 ∧ 𝑝 ∈ 𝐴) ∧ (𝑟 ∈ 𝑋 ∧ 𝑞 ∈ ( ⊥ ‘𝑋))) → 𝑞 ∈ 𝐴) |
| 12 | simpl3 1194 | . . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴 ∧ 𝑝 ∈ 𝐴) ∧ (𝑟 ∈ 𝑋 ∧ 𝑞 ∈ ( ⊥ ‘𝑋))) → 𝑝 ∈ 𝐴) | |
| 13 | simprl 770 | . . . . 5 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴 ∧ 𝑝 ∈ 𝐴) ∧ (𝑟 ∈ 𝑋 ∧ 𝑞 ∈ ( ⊥ ‘𝑋))) → 𝑟 ∈ 𝑋) | |
| 14 | 5, 13 | sseldd 3938 | . . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴 ∧ 𝑝 ∈ 𝐴) ∧ (𝑟 ∈ 𝑋 ∧ 𝑞 ∈ ( ⊥ ‘𝑋))) → 𝑟 ∈ 𝐴) |
| 15 | pexmidlem.l | . . . . . 6 ⊢ ≤ = (le‘𝐾) | |
| 16 | pexmidlem.j | . . . . . 6 ⊢ ∨ = (join‘𝐾) | |
| 17 | pexmidlem.p | . . . . . 6 ⊢ + = (+𝑃‘𝐾) | |
| 18 | pexmidlem.m | . . . . . 6 ⊢ 𝑀 = (𝑋 + {𝑝}) | |
| 19 | 15, 16, 6, 17, 7, 18 | pexmidlem1N 39969 | . . . . 5 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴) ∧ (𝑟 ∈ 𝑋 ∧ 𝑞 ∈ ( ⊥ ‘𝑋))) → 𝑞 ≠ 𝑟) |
| 20 | 19 | 3adantl3 1169 | . . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴 ∧ 𝑝 ∈ 𝐴) ∧ (𝑟 ∈ 𝑋 ∧ 𝑞 ∈ ( ⊥ ‘𝑋))) → 𝑞 ≠ 𝑟) |
| 21 | 15, 16, 6 | hlatexch1 39394 | . . . 4 ⊢ ((𝐾 ∈ HL ∧ (𝑞 ∈ 𝐴 ∧ 𝑝 ∈ 𝐴 ∧ 𝑟 ∈ 𝐴) ∧ 𝑞 ≠ 𝑟) → (𝑞 ≤ (𝑟 ∨ 𝑝) → 𝑝 ≤ (𝑟 ∨ 𝑞))) |
| 22 | 4, 11, 12, 14, 20, 21 | syl131anc 1385 | . . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴 ∧ 𝑝 ∈ 𝐴) ∧ (𝑟 ∈ 𝑋 ∧ 𝑞 ∈ ( ⊥ ‘𝑋))) → (𝑞 ≤ (𝑟 ∨ 𝑝) → 𝑝 ≤ (𝑟 ∨ 𝑞))) |
| 23 | 22 | 3impia 1117 | . 2 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴 ∧ 𝑝 ∈ 𝐴) ∧ (𝑟 ∈ 𝑋 ∧ 𝑞 ∈ ( ⊥ ‘𝑋)) ∧ 𝑞 ≤ (𝑟 ∨ 𝑝)) → 𝑝 ≤ (𝑟 ∨ 𝑞)) |
| 24 | 15, 16, 6, 17, 7, 18 | pexmidlem2N 39970 | . 2 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴 ∧ 𝑝 ∈ 𝐴) ∧ (𝑟 ∈ 𝑋 ∧ 𝑞 ∈ ( ⊥ ‘𝑋) ∧ 𝑝 ≤ (𝑟 ∨ 𝑞))) → 𝑝 ∈ (𝑋 + ( ⊥ ‘𝑋))) |
| 25 | 1, 2, 3, 23, 24 | syl13anc 1374 | 1 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴 ∧ 𝑝 ∈ 𝐴) ∧ (𝑟 ∈ 𝑋 ∧ 𝑞 ∈ ( ⊥ ‘𝑋)) ∧ 𝑞 ≤ (𝑟 ∨ 𝑝)) → 𝑝 ∈ (𝑋 + ( ⊥ ‘𝑋))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 ∧ w3a 1086 = wceq 1540 ∈ wcel 2109 ≠ wne 2925 ⊆ wss 3905 {csn 4579 class class class wbr 5095 ‘cfv 6486 (class class class)co 7353 lecple 17187 joincjn 18236 Atomscatm 39261 HLchlt 39348 +𝑃cpadd 39794 ⊥𝑃cpolN 39901 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-10 2142 ax-11 2158 ax-12 2178 ax-ext 2701 ax-rep 5221 ax-sep 5238 ax-nul 5248 ax-pow 5307 ax-pr 5374 ax-un 7675 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2533 df-eu 2562 df-clab 2708 df-cleq 2721 df-clel 2803 df-nfc 2878 df-ne 2926 df-ral 3045 df-rex 3054 df-rmo 3345 df-reu 3346 df-rab 3397 df-v 3440 df-sbc 3745 df-csb 3854 df-dif 3908 df-un 3910 df-in 3912 df-ss 3922 df-nul 4287 df-if 4479 df-pw 4555 df-sn 4580 df-pr 4582 df-op 4586 df-uni 4862 df-iun 4946 df-iin 4947 df-br 5096 df-opab 5158 df-mpt 5177 df-id 5518 df-xp 5629 df-rel 5630 df-cnv 5631 df-co 5632 df-dm 5633 df-rn 5634 df-res 5635 df-ima 5636 df-iota 6442 df-fun 6488 df-fn 6489 df-f 6490 df-f1 6491 df-fo 6492 df-f1o 6493 df-fv 6494 df-riota 7310 df-ov 7356 df-oprab 7357 df-mpo 7358 df-1st 7931 df-2nd 7932 df-proset 18219 df-poset 18238 df-plt 18253 df-lub 18269 df-glb 18270 df-join 18271 df-meet 18272 df-p0 18348 df-p1 18349 df-lat 18357 df-clat 18424 df-oposet 39174 df-ol 39176 df-oml 39177 df-covers 39264 df-ats 39265 df-atl 39296 df-cvlat 39320 df-hlat 39349 df-psubsp 39502 df-pmap 39503 df-padd 39795 df-polarityN 39902 |
| This theorem is referenced by: pexmidlem4N 39972 |
| Copyright terms: Public domain | W3C validator |