| 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 40340. (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 4307 | . . . 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 40335 | . . . . . 6 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴) ∧ (𝑋 ⊆ ( ⊥ ‘𝑌) ∧ 𝑋 ≠ ∅ ∧ 𝑝 ∈ 𝐴) ∧ 𝑞 ∈ (𝑌 ∩ 𝑀)) → 𝑝 ∈ (𝑋 + 𝑌)) |
| 11 | 10 | 3expia 1122 | . . . . 5 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴) ∧ (𝑋 ⊆ ( ⊥ ‘𝑌) ∧ 𝑋 ≠ ∅ ∧ 𝑝 ∈ 𝐴)) → (𝑞 ∈ (𝑌 ∩ 𝑀) → 𝑝 ∈ (𝑋 + 𝑌))) |
| 12 | 11 | exlimdv 1935 | . . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴) ∧ (𝑋 ⊆ ( ⊥ ‘𝑌) ∧ 𝑋 ≠ ∅ ∧ 𝑝 ∈ 𝐴)) → (∃𝑞 𝑞 ∈ (𝑌 ∩ 𝑀) → 𝑝 ∈ (𝑋 + 𝑌))) |
| 13 | 1, 12 | biimtrid 242 | . . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴) ∧ (𝑋 ⊆ ( ⊥ ‘𝑌) ∧ 𝑋 ≠ ∅ ∧ 𝑝 ∈ 𝐴)) → ((𝑌 ∩ 𝑀) ≠ ∅ → 𝑝 ∈ (𝑋 + 𝑌))) |
| 14 | 13 | necon1bd 2951 | . 2 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴) ∧ (𝑋 ⊆ ( ⊥ ‘𝑌) ∧ 𝑋 ≠ ∅ ∧ 𝑝 ∈ 𝐴)) → (¬ 𝑝 ∈ (𝑋 + 𝑌) → (𝑌 ∩ 𝑀) = ∅)) |
| 15 | 14 | 3impia 1118 | 1 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴) ∧ (𝑋 ⊆ ( ⊥ ‘𝑌) ∧ 𝑋 ≠ ∅ ∧ 𝑝 ∈ 𝐴) ∧ ¬ 𝑝 ∈ (𝑋 + 𝑌)) → (𝑌 ∩ 𝑀) = ∅) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ∧ wa 395 ∧ w3a 1087 = wceq 1542 ∃wex 1781 ∈ wcel 2114 ≠ wne 2933 ∩ cin 3902 ⊆ wss 3903 ∅c0 4287 {csn 4582 ‘cfv 6500 (class class class)co 7368 lecple 17196 joincjn 18246 Atomscatm 39636 HLchlt 39723 +𝑃cpadd 40168 ⊥𝑃cpolN 40275 PSubClcpscN 40307 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-rep 5226 ax-sep 5243 ax-nul 5253 ax-pow 5312 ax-pr 5379 ax-un 7690 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-ral 3053 df-rex 3063 df-rmo 3352 df-reu 3353 df-rab 3402 df-v 3444 df-sbc 3743 df-csb 3852 df-dif 3906 df-un 3908 df-in 3910 df-ss 3920 df-nul 4288 df-if 4482 df-pw 4558 df-sn 4583 df-pr 4585 df-op 4589 df-uni 4866 df-iun 4950 df-iin 4951 df-br 5101 df-opab 5163 df-mpt 5182 df-id 5527 df-xp 5638 df-rel 5639 df-cnv 5640 df-co 5641 df-dm 5642 df-rn 5643 df-res 5644 df-ima 5645 df-iota 6456 df-fun 6502 df-fn 6503 df-f 6504 df-f1 6505 df-fo 6506 df-f1o 6507 df-fv 6508 df-riota 7325 df-ov 7371 df-oprab 7372 df-mpo 7373 df-1st 7943 df-2nd 7944 df-proset 18229 df-poset 18248 df-plt 18263 df-lub 18279 df-glb 18280 df-join 18281 df-meet 18282 df-p0 18358 df-p1 18359 df-lat 18367 df-clat 18434 df-oposet 39549 df-ol 39551 df-oml 39552 df-covers 39639 df-ats 39640 df-atl 39671 df-cvlat 39695 df-hlat 39724 df-pmap 39877 df-padd 40169 df-polarityN 40276 |
| This theorem is referenced by: osumcllem9N 40337 |
| Copyright terms: Public domain | W3C validator |