| 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 40552. (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 4303 | . . . 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 40547 | . . . . . 6 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴) ∧ (𝑋 ⊆ ( ⊥ ‘𝑌) ∧ 𝑋 ≠ ∅ ∧ 𝑝 ∈ 𝐴) ∧ 𝑞 ∈ (𝑌 ∩ 𝑀)) → 𝑝 ∈ (𝑋 + 𝑌)) |
| 11 | 10 | 3expia 1133 | . . . . 5 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴) ∧ (𝑋 ⊆ ( ⊥ ‘𝑌) ∧ 𝑋 ≠ ∅ ∧ 𝑝 ∈ 𝐴)) → (𝑞 ∈ (𝑌 ∩ 𝑀) → 𝑝 ∈ (𝑋 + 𝑌))) |
| 12 | 11 | exlimdv 1952 | . . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴) ∧ (𝑋 ⊆ ( ⊥ ‘𝑌) ∧ 𝑋 ≠ ∅ ∧ 𝑝 ∈ 𝐴)) → (∃𝑞 𝑞 ∈ (𝑌 ∩ 𝑀) → 𝑝 ∈ (𝑋 + 𝑌))) |
| 13 | 1, 12 | biimtrid 244 | . . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴) ∧ (𝑋 ⊆ ( ⊥ ‘𝑌) ∧ 𝑋 ≠ ∅ ∧ 𝑝 ∈ 𝐴)) → ((𝑌 ∩ 𝑀) ≠ ∅ → 𝑝 ∈ (𝑋 + 𝑌))) |
| 14 | 13 | necon1bd 2974 | . 2 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴) ∧ (𝑋 ⊆ ( ⊥ ‘𝑌) ∧ 𝑋 ≠ ∅ ∧ 𝑝 ∈ 𝐴)) → (¬ 𝑝 ∈ (𝑋 + 𝑌) → (𝑌 ∩ 𝑀) = ∅)) |
| 15 | 14 | 3impia 1129 | 1 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴) ∧ (𝑋 ⊆ ( ⊥ ‘𝑌) ∧ 𝑋 ≠ ∅ ∧ 𝑝 ∈ 𝐴) ∧ ¬ 𝑝 ∈ (𝑋 + 𝑌)) → (𝑌 ∩ 𝑀) = ∅) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ∧ wa 399 ∧ w3a 1097 = wceq 1559 ∃wex 1798 ∈ wcel 2141 ≠ wne 2956 ∩ cin 3901 ⊆ wss 3902 ∅c0 4283 {csn 4579 ‘cfv 6516 (class class class)co 7391 lecple 17284 joincjn 18334 Atomscatm 39848 HLchlt 39935 +𝑃cpadd 40380 ⊥𝑃cpolN 40487 PSubClcpscN 40519 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1814 ax-4 1828 ax-5 1929 ax-6 1986 ax-7 2027 ax-8 2143 ax-9 2151 ax-10 2174 ax-11 2190 ax-12 2211 ax-ext 2733 ax-rep 5224 ax-sep 5243 ax-nul 5253 ax-pow 5319 ax-pr 5387 ax-un 7713 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3an 1099 df-tru 1562 df-fal 1572 df-ex 1799 df-nf 1803 df-sb 2090 df-mo 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-ral 3076 df-rex 3086 df-rmo 3366 df-reu 3367 df-rab 3414 df-v 3455 df-sbc 3743 df-csb 3851 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-nul 4284 df-if 4478 df-pw 4554 df-sn 4580 df-pr 4582 df-op 4586 df-uni 4863 df-iun 4948 df-iin 4949 df-br 5098 df-opab 5160 df-mpt 5179 df-id 5538 df-xp 5649 df-rel 5650 df-cnv 5651 df-co 5652 df-dm 5653 df-rn 5654 df-res 5655 df-ima 5656 df-iota 6472 df-fun 6518 df-fn 6519 df-f 6520 df-f1 6521 df-fo 6522 df-f1o 6523 df-fv 6524 df-riota 7348 df-ov 7394 df-oprab 7395 df-mpo 7396 df-1st 7965 df-2nd 7966 df-proset 18317 df-poset 18336 df-plt 18351 df-lub 18367 df-glb 18368 df-join 18369 df-meet 18370 df-p0 18446 df-p1 18447 df-lat 18455 df-clat 18522 df-oposet 39761 df-ol 39763 df-oml 39764 df-covers 39851 df-ats 39852 df-atl 39883 df-cvlat 39907 df-hlat 39936 df-pmap 40089 df-padd 40381 df-polarityN 40488 |
| This theorem is referenced by: osumcllem9N 40549 |
| Copyright terms: Public domain | W3C validator |