| 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 41292. Use atom exchange hlatexch1 40718 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 1154 | . 2 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴 ∧ 𝑝 ∈ 𝐴) ∧ (𝑟 ∈ 𝑋 ∧ 𝑞 ∈ ( ⊥ ‘𝑋)) ∧ 𝑞 ≤ (𝑟 ∨ 𝑝)) → (𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴 ∧ 𝑝 ∈ 𝐴)) | |
| 2 | simp2l 1218 | . 2 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴 ∧ 𝑝 ∈ 𝐴) ∧ (𝑟 ∈ 𝑋 ∧ 𝑞 ∈ ( ⊥ ‘𝑋)) ∧ 𝑞 ≤ (𝑟 ∨ 𝑝)) → 𝑟 ∈ 𝑋) | |
| 3 | simp2r 1219 | . 2 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴 ∧ 𝑝 ∈ 𝐴) ∧ (𝑟 ∈ 𝑋 ∧ 𝑞 ∈ ( ⊥ ‘𝑋)) ∧ 𝑞 ≤ (𝑟 ∨ 𝑝)) → 𝑞 ∈ ( ⊥ ‘𝑋)) | |
| 4 | simpl1 1210 | . . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴 ∧ 𝑝 ∈ 𝐴) ∧ (𝑟 ∈ 𝑋 ∧ 𝑞 ∈ ( ⊥ ‘𝑋))) → 𝐾 ∈ HL) | |
| 5 | simpl2 1211 | . . . . . 6 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴 ∧ 𝑝 ∈ 𝐴) ∧ (𝑟 ∈ 𝑋 ∧ 𝑞 ∈ ( ⊥ ‘𝑋))) → 𝑋 ⊆ 𝐴) | |
| 6 | pexmidlem.a | . . . . . . 7 ⊢ 𝐴 = (Atoms‘𝐾) | |
| 7 | pexmidlem.o | . . . . . . 7 ⊢ ⊥ = (⊥𝑃‘𝐾) | |
| 8 | 6, 7 | polssatN 41231 | . . . . . 6 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴) → ( ⊥ ‘𝑋) ⊆ 𝐴) |
| 9 | 4, 5, 8 | syl2anc 596 | . . . . 5 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴 ∧ 𝑝 ∈ 𝐴) ∧ (𝑟 ∈ 𝑋 ∧ 𝑞 ∈ ( ⊥ ‘𝑋))) → ( ⊥ ‘𝑋) ⊆ 𝐴) |
| 10 | simprr 785 | . . . . 5 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴 ∧ 𝑝 ∈ 𝐴) ∧ (𝑟 ∈ 𝑋 ∧ 𝑞 ∈ ( ⊥ ‘𝑋))) → 𝑞 ∈ ( ⊥ ‘𝑋)) | |
| 11 | 9, 10 | sseldd 3914 | . . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴 ∧ 𝑝 ∈ 𝐴) ∧ (𝑟 ∈ 𝑋 ∧ 𝑞 ∈ ( ⊥ ‘𝑋))) → 𝑞 ∈ 𝐴) |
| 12 | simpl3 1212 | . . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴 ∧ 𝑝 ∈ 𝐴) ∧ (𝑟 ∈ 𝑋 ∧ 𝑞 ∈ ( ⊥ ‘𝑋))) → 𝑝 ∈ 𝐴) | |
| 13 | simprl 783 | . . . . 5 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴 ∧ 𝑝 ∈ 𝐴) ∧ (𝑟 ∈ 𝑋 ∧ 𝑞 ∈ ( ⊥ ‘𝑋))) → 𝑟 ∈ 𝑋) | |
| 14 | 5, 13 | sseldd 3914 | . . . 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 41293 | . . . . 5 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴) ∧ (𝑟 ∈ 𝑋 ∧ 𝑞 ∈ ( ⊥ ‘𝑋))) → 𝑞 ≠ 𝑟) |
| 20 | 19 | 3adantl3 1187 | . . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴 ∧ 𝑝 ∈ 𝐴) ∧ (𝑟 ∈ 𝑋 ∧ 𝑞 ∈ ( ⊥ ‘𝑋))) → 𝑞 ≠ 𝑟) |
| 21 | 15, 16, 6 | hlatexch1 40718 | . . . 4 ⊢ ((𝐾 ∈ HL ∧ (𝑞 ∈ 𝐴 ∧ 𝑝 ∈ 𝐴 ∧ 𝑟 ∈ 𝐴) ∧ 𝑞 ≠ 𝑟) → (𝑞 ≤ (𝑟 ∨ 𝑝) → 𝑝 ≤ (𝑟 ∨ 𝑞))) |
| 22 | 4, 11, 12, 14, 20, 21 | syl131anc 1411 | . . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴 ∧ 𝑝 ∈ 𝐴) ∧ (𝑟 ∈ 𝑋 ∧ 𝑞 ∈ ( ⊥ ‘𝑋))) → (𝑞 ≤ (𝑟 ∨ 𝑝) → 𝑝 ≤ (𝑟 ∨ 𝑞))) |
| 23 | 22 | 3impia 1135 | . 2 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴 ∧ 𝑝 ∈ 𝐴) ∧ (𝑟 ∈ 𝑋 ∧ 𝑞 ∈ ( ⊥ ‘𝑋)) ∧ 𝑞 ≤ (𝑟 ∨ 𝑝)) → 𝑝 ≤ (𝑟 ∨ 𝑞)) |
| 24 | 15, 16, 6, 17, 7, 18 | pexmidlem2N 41294 | . 2 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴 ∧ 𝑝 ∈ 𝐴) ∧ (𝑟 ∈ 𝑋 ∧ 𝑞 ∈ ( ⊥ ‘𝑋) ∧ 𝑝 ≤ (𝑟 ∨ 𝑞))) → 𝑝 ∈ (𝑋 + ( ⊥ ‘𝑋))) |
| 25 | 1, 2, 3, 23, 24 | syl13anc 1400 | 1 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴 ∧ 𝑝 ∈ 𝐴) ∧ (𝑟 ∈ 𝑋 ∧ 𝑞 ∈ ( ⊥ ‘𝑋)) ∧ 𝑞 ≤ (𝑟 ∨ 𝑝)) → 𝑝 ∈ (𝑋 + ( ⊥ ‘𝑋))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 ∧ w3a 1103 = wceq 1570 ∈ wcel 2147 ≠ wne 2959 ⊆ wss 3900 {csn 4588 class class class wbr 5108 ‘cfv 6566 (class class class)co 7451 lecple 17479 joincjn 18535 Atomscatm 40586 HLchlt 40673 +𝑃cpadd 41118 ⊥𝑃cpolN 41225 |
| 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 5238 ax-sep 5255 ax-nul 5266 ax-pow 5334 ax-pr 5398 ax-un 7783 |
| 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 4841 df-uni 4873 df-iun 4958 df-iin 4959 df-br 5109 df-opab 5174 df-mpt 5193 df-id 5553 df-xp 5664 df-rel 5665 df-cnv 5666 df-co 5667 df-dm 5668 df-rn 5669 df-res 5670 df-ima 5671 df-iota 6520 df-fun 6568 df-fn 6569 df-f 6570 df-f1 6571 df-fo 6572 df-f1o 6573 df-fv 6574 df-riota 7408 df-ov 7454 df-oprab 7455 df-mpo 7456 df-1st 8035 df-2nd 8036 df-proset 18518 df-poset 18537 df-plt 18552 df-lub 18568 df-glb 18569 df-join 18570 df-meet 18571 df-p0 18647 df-p1 18648 df-lat 18656 df-clat 18723 df-oposet 40499 df-ol 40501 df-oml 40502 df-covers 40589 df-ats 40590 df-atl 40621 df-cvlat 40645 df-hlat 40674 df-psubsp 40826 df-pmap 40827 df-padd 41119 df-polarityN 41226 |
| This theorem is used by: pexmidlem4N 41296 |
| Copyright terms: Public domain | W3C validator |