| Mathbox for Norm Megill |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > osumcllem8N | Structured version Visualization version GIF version | ||
| Description: Lemma for osumclN 40840. (Contributed by NM, 24-Mar-2012.) (New usage is discouraged.) |
| Ref | Expression |
|---|---|
| osumcllem.l | ⊢ ≤ = (le‘𝐾) |
| osumcllem.j | ⊢ ∨ = (join‘𝐾) |
| osumcllem.a | ⊢ 𝐴 = (Atoms‘𝐾) |
| osumcllem.p | ⊢ + = (+𝑃‘𝐾) |
| osumcllem.o | ⊢ ⊥ = (⊥𝑃‘𝐾) |
| osumcllem.c | ⊢ 𝐶 = (PSubCl‘𝐾) |
| osumcllem.m | ⊢ 𝑀 = (𝑋 + {𝑝}) |
| osumcllem.u | ⊢ 𝑈 = ( ⊥ ‘( ⊥ ‘(𝑋 + 𝑌))) |
| Ref | Expression |
|---|---|
| osumcllem8N | ⊢ (((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴) ∧ (𝑋 ⊆ ( ⊥ ‘𝑌) ∧ 𝑋 ≠ ∅ ∧ 𝑝 ∈ 𝐴) ∧ ¬ 𝑝 ∈ (𝑋 + 𝑌)) → (𝑌 ∩ 𝑀) = ∅) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | n0 4300 | . . . 4 ⊢ ((𝑌 ∩ 𝑀) ≠ ∅ ↔ ∃𝑞 𝑞 ∈ (𝑌 ∩ 𝑀)) | |
| 2 | osumcllem.l | . . . . . . 7 ⊢ ≤ = (le‘𝐾) | |
| 3 | osumcllem.j | . . . . . . 7 ⊢ ∨ = (join‘𝐾) | |
| 4 | osumcllem.a | . . . . . . 7 ⊢ 𝐴 = (Atoms‘𝐾) | |
| 5 | osumcllem.p | . . . . . . 7 ⊢ + = (+𝑃‘𝐾) | |
| 6 | osumcllem.o | . . . . . . 7 ⊢ ⊥ = (⊥𝑃‘𝐾) | |
| 7 | osumcllem.c | . . . . . . 7 ⊢ 𝐶 = (PSubCl‘𝐾) | |
| 8 | osumcllem.m | . . . . . . 7 ⊢ 𝑀 = (𝑋 + {𝑝}) | |
| 9 | osumcllem.u | . . . . . . 7 ⊢ 𝑈 = ( ⊥ ‘( ⊥ ‘(𝑋 + 𝑌))) | |
| 10 | 2, 3, 4, 5, 6, 7, 8, 9 | osumcllem7N 40835 | . . . . . 6 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴) ∧ (𝑋 ⊆ ( ⊥ ‘𝑌) ∧ 𝑋 ≠ ∅ ∧ 𝑝 ∈ 𝐴) ∧ 𝑞 ∈ (𝑌 ∩ 𝑀)) → 𝑝 ∈ (𝑋 + 𝑌)) |
| 11 | 10 | 3expia 1139 | . . . . 5 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴) ∧ (𝑋 ⊆ ( ⊥ ‘𝑌) ∧ 𝑋 ≠ ∅ ∧ 𝑝 ∈ 𝐴)) → (𝑞 ∈ (𝑌 ∩ 𝑀) → 𝑝 ∈ (𝑋 + 𝑌))) |
| 12 | 11 | exlimdv 1966 | . . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴) ∧ (𝑋 ⊆ ( ⊥ ‘𝑌) ∧ 𝑋 ≠ ∅ ∧ 𝑝 ∈ 𝐴)) → (∃𝑞 𝑞 ∈ (𝑌 ∩ 𝑀) → 𝑝 ∈ (𝑋 + 𝑌))) |
| 13 | 1, 12 | biimtrid 245 | . . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴) ∧ (𝑋 ⊆ ( ⊥ ‘𝑌) ∧ 𝑋 ≠ ∅ ∧ 𝑝 ∈ 𝐴)) → ((𝑌 ∩ 𝑀) ≠ ∅ → 𝑝 ∈ (𝑋 + 𝑌))) |
| 14 | 13 | necon1bd 2973 | . 2 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴) ∧ (𝑋 ⊆ ( ⊥ ‘𝑌) ∧ 𝑋 ≠ ∅ ∧ 𝑝 ∈ 𝐴)) → (¬ 𝑝 ∈ (𝑋 + 𝑌) → (𝑌 ∩ 𝑀) = ∅)) |
| 15 | 14 | 3impia 1135 | 1 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴) ∧ (𝑋 ⊆ ( ⊥ ‘𝑌) ∧ 𝑋 ≠ ∅ ∧ 𝑝 ∈ 𝐴) ∧ ¬ 𝑝 ∈ (𝑋 + 𝑌)) → (𝑌 ∩ 𝑀) = ∅) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 → wi 4 ∧ wa 401 ∧ w3a 1103 = wceq 1570 ∃wex 1812 ∈ wcel 2145 ≠ wne 2955 ∩ cin 3898 ⊆ wss 3899 ∅c0 4279 {csn 4584 ‘cfv 6533 (class class class)co 7413 lecple 17349 joincjn 18399 Atomscatm 40136 HLchlt 40223 +𝑃cpadd 40668 ⊥𝑃cpolN 40775 PSubClcpscN 40807 |
| 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 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2732 ax-rep 5232 ax-sep 5251 ax-nul 5263 ax-pow 5330 ax-pr 5398 ax-un 7736 |
| 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 2100 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-ral 3077 df-rex 3087 df-rmo 3365 df-reu 3366 df-rab 3413 df-v 3452 df-sbc 3740 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-iun 4953 df-iin 4954 df-br 5104 df-opab 5168 df-mpt 5187 df-id 5550 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-rn 5666 df-res 5667 df-ima 5668 df-iota 6489 df-fun 6535 df-fn 6536 df-f 6537 df-f1 6538 df-fo 6539 df-f1o 6540 df-fv 6541 df-riota 7370 df-ov 7416 df-oprab 7417 df-mpo 7418 df-1st 7986 df-2nd 7987 df-proset 18382 df-poset 18401 df-plt 18416 df-lub 18432 df-glb 18433 df-join 18434 df-meet 18435 df-p0 18511 df-p1 18512 df-lat 18520 df-clat 18587 df-oposet 40049 df-ol 40051 df-oml 40052 df-covers 40139 df-ats 40140 df-atl 40171 df-cvlat 40195 df-hlat 40224 df-pmap 40377 df-padd 40669 df-polarityN 40776 |
| This theorem is used by: osumcllem9N 40837 |
| Copyright terms: Public domain | W3C validator |