| 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 40459. (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 4281 | . . . 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 40454 | . . . . . 6 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴) ∧ (𝑋 ⊆ ( ⊥ ‘𝑌) ∧ 𝑋 ≠ ∅ ∧ 𝑝 ∈ 𝐴) ∧ 𝑞 ∈ (𝑌 ∩ 𝑀)) → 𝑝 ∈ (𝑋 + 𝑌)) |
| 11 | 10 | 3expia 1127 | . . . . 5 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴) ∧ (𝑋 ⊆ ( ⊥ ‘𝑌) ∧ 𝑋 ≠ ∅ ∧ 𝑝 ∈ 𝐴)) → (𝑞 ∈ (𝑌 ∩ 𝑀) → 𝑝 ∈ (𝑋 + 𝑌))) |
| 12 | 11 | exlimdv 1940 | . . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴) ∧ (𝑋 ⊆ ( ⊥ ‘𝑌) ∧ 𝑋 ≠ ∅ ∧ 𝑝 ∈ 𝐴)) → (∃𝑞 𝑞 ∈ (𝑌 ∩ 𝑀) → 𝑝 ∈ (𝑋 + 𝑌))) |
| 13 | 1, 12 | biimtrid 243 | . . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴) ∧ (𝑋 ⊆ ( ⊥ ‘𝑌) ∧ 𝑋 ≠ ∅ ∧ 𝑝 ∈ 𝐴)) → ((𝑌 ∩ 𝑀) ≠ ∅ → 𝑝 ∈ (𝑋 + 𝑌))) |
| 14 | 13 | necon1bd 2952 | . 2 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴) ∧ (𝑋 ⊆ ( ⊥ ‘𝑌) ∧ 𝑋 ≠ ∅ ∧ 𝑝 ∈ 𝐴)) → (¬ 𝑝 ∈ (𝑋 + 𝑌) → (𝑌 ∩ 𝑀) = ∅)) |
| 15 | 14 | 3impia 1123 | 1 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴) ∧ (𝑋 ⊆ ( ⊥ ‘𝑌) ∧ 𝑋 ≠ ∅ ∧ 𝑝 ∈ 𝐴) ∧ ¬ 𝑝 ∈ (𝑋 + 𝑌)) → (𝑌 ∩ 𝑀) = ∅) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ∧ wa 396 ∧ w3a 1092 = wceq 1547 ∃wex 1786 ∈ wcel 2119 ≠ wne 2934 ∩ cin 3882 ⊆ wss 3883 ∅c0 4261 {csn 4555 ‘cfv 6485 (class class class)co 7356 lecple 17218 joincjn 18268 Atomscatm 39755 HLchlt 39842 +𝑃cpadd 40287 ⊥𝑃cpolN 40394 PSubClcpscN 40426 |
| 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 2711 ax-rep 5199 ax-sep 5218 ax-nul 5228 ax-pow 5294 ax-pr 5362 ax-un 7678 |
| 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 2718 df-cleq 2731 df-clel 2814 df-nfc 2888 df-ne 2935 df-ral 3054 df-rex 3064 df-rmo 3344 df-reu 3345 df-rab 3392 df-v 3433 df-sbc 3724 df-csb 3832 df-dif 3886 df-un 3888 df-in 3890 df-ss 3900 df-nul 4262 df-if 4455 df-pw 4531 df-sn 4556 df-pr 4558 df-op 4562 df-uni 4839 df-iun 4923 df-iin 4924 df-br 5073 df-opab 5135 df-mpt 5154 df-id 5513 df-xp 5624 df-rel 5625 df-cnv 5626 df-co 5627 df-dm 5628 df-rn 5629 df-res 5630 df-ima 5631 df-iota 6441 df-fun 6487 df-fn 6488 df-f 6489 df-f1 6490 df-fo 6491 df-f1o 6492 df-fv 6493 df-riota 7313 df-ov 7359 df-oprab 7360 df-mpo 7361 df-1st 7931 df-2nd 7932 df-proset 18251 df-poset 18270 df-plt 18285 df-lub 18301 df-glb 18302 df-join 18303 df-meet 18304 df-p0 18380 df-p1 18381 df-lat 18389 df-clat 18456 df-oposet 39668 df-ol 39670 df-oml 39671 df-covers 39758 df-ats 39759 df-atl 39790 df-cvlat 39814 df-hlat 39843 df-pmap 39996 df-padd 40288 df-polarityN 40395 |
| This theorem is referenced by: osumcllem9N 40456 |
| Copyright terms: Public domain | W3C validator |