| 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 41118. (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 4299 | . . . 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 41113 | . . . . . 6 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴) ∧ (𝑋 ⊆ ( ⊥ ‘𝑌) ∧ 𝑋 ≠ ∅ ∧ 𝑝 ∈ 𝐴) ∧ 𝑞 ∈ (𝑌 ∩ 𝑀)) → 𝑝 ∈ (𝑋 + 𝑌)) |
| 11 | 10 | 3expia 1139 | . . . . 5 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴) ∧ (𝑋 ⊆ ( ⊥ ‘𝑌) ∧ 𝑋 ≠ ∅ ∧ 𝑝 ∈ 𝐴)) → (𝑞 ∈ (𝑌 ∩ 𝑀) → 𝑝 ∈ (𝑋 + 𝑌))) |
| 12 | 11 | exlimdv 1965 | . . . 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 1569 ∃wex 1811 ∈ wcel 2144 ≠ wne 2955 ⊆ wss 3895 ∩ cin 4089 ∅c0 4278 {csn 4584 ‘cfv 6539 (class class class)co 7421 lecple 17441 joincjn 18491 Atomscatm 40414 HLchlt 40501 +𝑃cpadd 40946 ⊥𝑃cpolN 41053 PSubClcpscN 41085 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1942 ax-6 1999 ax-7 2040 ax-8 2146 ax-9 2154 ax-10 2177 ax-11 2193 ax-12 2212 ax-ext 2732 ax-rep 5231 ax-sep 5248 ax-nul 5259 ax-pow 5326 ax-pr 5390 ax-un 7752 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-nf 1816 df-sb 2099 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 3739 df-csb 3847 df-ss 3896 df-dif 4047 df-in 4091 df-un 4151 df-nul 4279 df-if 4482 df-pw 4558 df-sn 4585 df-pr 4587 df-op 4835 df-uni 4867 df-iun 4952 df-iin 4953 df-br 5103 df-opab 5167 df-mpt 5186 df-id 5545 df-xp 5656 df-rel 5657 df-cnv 5658 df-co 5659 df-dm 5660 df-rn 5661 df-res 5662 df-ima 5663 df-iota 6494 df-fun 6541 df-fn 6542 df-f 6543 df-f1 6544 df-fo 6545 df-f1o 6546 df-fv 6547 df-riota 7378 df-ov 7424 df-oprab 7425 df-mpo 7426 df-1st 8002 df-2nd 8003 df-proset 18474 df-poset 18493 df-plt 18508 df-lub 18524 df-glb 18525 df-join 18526 df-meet 18527 df-p0 18603 df-p1 18604 df-lat 18612 df-clat 18679 df-oposet 40327 df-ol 40329 df-oml 40330 df-covers 40417 df-ats 40418 df-atl 40449 df-cvlat 40473 df-hlat 40502 df-pmap 40655 df-padd 40947 df-polarityN 41054 |
| This theorem is used by: osumcllem9N 41115 |
| Copyright terms: Public domain | W3C validator |