| Mathbox for Norm Megill |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > osumcllem10N | Structured version Visualization version GIF version | ||
| Description: Lemma for osumclN 40741. Contradict osumcllem9N 40738. (Contributed by NM, 25-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 |
|---|---|
| osumcllem10N | ⊢ (((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴) ∧ 𝑝 ∈ 𝐴 ∧ ¬ 𝑝 ∈ (𝑋 + 𝑌)) → 𝑀 ≠ 𝑋) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | simp11 1222 | . . . . 5 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴) ∧ 𝑝 ∈ 𝐴 ∧ ¬ 𝑝 ∈ (𝑋 + 𝑌)) → 𝐾 ∈ HL) | |
| 2 | simp2 1155 | . . . . . 6 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴) ∧ 𝑝 ∈ 𝐴 ∧ ¬ 𝑝 ∈ (𝑋 + 𝑌)) → 𝑝 ∈ 𝐴) | |
| 3 | 2 | snssd 4752 | . . . . 5 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴) ∧ 𝑝 ∈ 𝐴 ∧ ¬ 𝑝 ∈ (𝑋 + 𝑌)) → {𝑝} ⊆ 𝐴) |
| 4 | simp12 1223 | . . . . 5 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴) ∧ 𝑝 ∈ 𝐴 ∧ ¬ 𝑝 ∈ (𝑋 + 𝑌)) → 𝑋 ⊆ 𝐴) | |
| 5 | osumcllem.a | . . . . . 6 ⊢ 𝐴 = (Atoms‘𝐾) | |
| 6 | osumcllem.p | . . . . . 6 ⊢ + = (+𝑃‘𝐾) | |
| 7 | 5, 6 | sspadd2 40590 | . . . . 5 ⊢ ((𝐾 ∈ HL ∧ {𝑝} ⊆ 𝐴 ∧ 𝑋 ⊆ 𝐴) → {𝑝} ⊆ (𝑋 + {𝑝})) |
| 8 | 1, 3, 4, 7 | syl3anc 1398 | . . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴) ∧ 𝑝 ∈ 𝐴 ∧ ¬ 𝑝 ∈ (𝑋 + 𝑌)) → {𝑝} ⊆ (𝑋 + {𝑝})) |
| 9 | vex 3459 | . . . . 5 ⊢ 𝑝 ∈ V | |
| 10 | 9 | snss 4750 | . . . 4 ⊢ (𝑝 ∈ (𝑋 + {𝑝}) ↔ {𝑝} ⊆ (𝑋 + {𝑝})) |
| 11 | 8, 10 | sylibr 237 | . . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴) ∧ 𝑝 ∈ 𝐴 ∧ ¬ 𝑝 ∈ (𝑋 + 𝑌)) → 𝑝 ∈ (𝑋 + {𝑝})) |
| 12 | osumcllem.m | . . 3 ⊢ 𝑀 = (𝑋 + {𝑝}) | |
| 13 | 11, 12 | eleqtrrdi 2874 | . 2 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴) ∧ 𝑝 ∈ 𝐴 ∧ ¬ 𝑝 ∈ (𝑋 + 𝑌)) → 𝑝 ∈ 𝑀) |
| 14 | 5, 6 | sspadd1 40589 | . . . 4 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴) → 𝑋 ⊆ (𝑋 + 𝑌)) |
| 15 | 14 | 3ad2ant1 1151 | . . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴) ∧ 𝑝 ∈ 𝐴 ∧ ¬ 𝑝 ∈ (𝑋 + 𝑌)) → 𝑋 ⊆ (𝑋 + 𝑌)) |
| 16 | simp3 1156 | . . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴) ∧ 𝑝 ∈ 𝐴 ∧ ¬ 𝑝 ∈ (𝑋 + 𝑌)) → ¬ 𝑝 ∈ (𝑋 + 𝑌)) | |
| 17 | 15, 16 | ssneldd 3940 | . 2 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴) ∧ 𝑝 ∈ 𝐴 ∧ ¬ 𝑝 ∈ (𝑋 + 𝑌)) → ¬ 𝑝 ∈ 𝑋) |
| 18 | nelne1 3055 | . 2 ⊢ ((𝑝 ∈ 𝑀 ∧ ¬ 𝑝 ∈ 𝑋) → 𝑀 ≠ 𝑋) | |
| 19 | 13, 17, 18 | syl2anc 595 | 1 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴) ∧ 𝑝 ∈ 𝐴 ∧ ¬ 𝑝 ∈ (𝑋 + 𝑌)) → 𝑀 ≠ 𝑋) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ∧ w3a 1103 = wceq 1570 ∈ wcel 2143 ≠ wne 2958 ⊆ wss 3905 {csn 4589 ‘cfv 6536 (class class class)co 7410 lecple 17312 joincjn 18362 Atomscatm 40037 HLchlt 40124 +𝑃cpadd 40569 ⊥𝑃cpolN 40676 PSubClcpscN 40708 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1825 ax-4 1839 ax-5 1940 ax-6 1997 ax-7 2038 ax-8 2145 ax-9 2153 ax-10 2176 ax-11 2192 ax-12 2213 ax-ext 2735 ax-rep 5238 ax-sep 5257 ax-nul 5269 ax-pow 5336 ax-pr 5404 ax-un 7732 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1810 df-nf 1814 df-sb 2097 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2838 df-nfc 2912 df-ne 2959 df-ral 3080 df-rex 3090 df-reu 3370 df-rab 3417 df-v 3457 df-sbc 3745 df-csb 3854 df-dif 3908 df-un 3910 df-in 3912 df-ss 3922 df-nul 4287 df-if 4488 df-pw 4564 df-sn 4590 df-pr 4592 df-op 4596 df-uni 4873 df-iun 4958 df-br 5110 df-opab 5174 df-mpt 5193 df-id 5556 df-xp 5667 df-rel 5668 df-cnv 5669 df-co 5670 df-dm 5671 df-rn 5672 df-res 5673 df-ima 5674 df-iota 6492 df-fun 6538 df-fn 6539 df-f 6540 df-f1 6541 df-fo 6542 df-f1o 6543 df-fv 6544 df-ov 7413 df-oprab 7414 df-mpo 7415 df-1st 7982 df-2nd 7983 df-padd 40570 |
| This theorem is referenced by: osumcllem11N 40740 |
| Copyright terms: Public domain | W3C validator |