| Mathbox for Norm Megill |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > atcvrneN | Structured version Visualization version GIF version | ||
| Description: Inequality derived from atom condition. (Contributed by NM, 7-Feb-2012.) (New usage is discouraged.) |
| Ref | Expression |
|---|---|
| atcvrne.j | ⊢ ∨ = (join‘𝐾) |
| atcvrne.c | ⊢ 𝐶 = ( ⋖ ‘𝐾) |
| atcvrne.a | ⊢ 𝐴 = (Atoms‘𝐾) |
| Ref | Expression |
|---|---|
| atcvrneN | ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ 𝑃𝐶(𝑄 ∨ 𝑅)) → 𝑄 ≠ 𝑅) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | hlatl 40112 | . . . 4 ⊢ (𝐾 ∈ HL → 𝐾 ∈ AtLat) | |
| 2 | 1 | 3ad2ant1 1151 | . . 3 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ 𝑃𝐶(𝑄 ∨ 𝑅)) → 𝐾 ∈ AtLat) |
| 3 | simp21 1225 | . . 3 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ 𝑃𝐶(𝑄 ∨ 𝑅)) → 𝑃 ∈ 𝐴) | |
| 4 | eqid 2763 | . . . 4 ⊢ (0.‘𝐾) = (0.‘𝐾) | |
| 5 | atcvrne.a | . . . 4 ⊢ 𝐴 = (Atoms‘𝐾) | |
| 6 | 4, 5 | atn0 40060 | . . 3 ⊢ ((𝐾 ∈ AtLat ∧ 𝑃 ∈ 𝐴) → 𝑃 ≠ (0.‘𝐾)) |
| 7 | 2, 3, 6 | syl2anc 595 | . 2 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ 𝑃𝐶(𝑄 ∨ 𝑅)) → 𝑃 ≠ (0.‘𝐾)) |
| 8 | simp1 1154 | . . . 4 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ 𝑃𝐶(𝑄 ∨ 𝑅)) → 𝐾 ∈ HL) | |
| 9 | eqid 2763 | . . . . . 6 ⊢ (Base‘𝐾) = (Base‘𝐾) | |
| 10 | 9, 5 | atbase 40041 | . . . . 5 ⊢ (𝑃 ∈ 𝐴 → 𝑃 ∈ (Base‘𝐾)) |
| 11 | 3, 10 | syl 18 | . . . 4 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ 𝑃𝐶(𝑄 ∨ 𝑅)) → 𝑃 ∈ (Base‘𝐾)) |
| 12 | simp22 1226 | . . . 4 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ 𝑃𝐶(𝑄 ∨ 𝑅)) → 𝑄 ∈ 𝐴) | |
| 13 | simp23 1227 | . . . 4 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ 𝑃𝐶(𝑄 ∨ 𝑅)) → 𝑅 ∈ 𝐴) | |
| 14 | simp3 1156 | . . . 4 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ 𝑃𝐶(𝑄 ∨ 𝑅)) → 𝑃𝐶(𝑄 ∨ 𝑅)) | |
| 15 | atcvrne.j | . . . . 5 ⊢ ∨ = (join‘𝐾) | |
| 16 | atcvrne.c | . . . . 5 ⊢ 𝐶 = ( ⋖ ‘𝐾) | |
| 17 | 9, 15, 4, 16, 5 | atcvrj0 40180 | . . . 4 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ (Base‘𝐾) ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ 𝑃𝐶(𝑄 ∨ 𝑅)) → (𝑃 = (0.‘𝐾) ↔ 𝑄 = 𝑅)) |
| 18 | 8, 11, 12, 13, 14, 17 | syl131anc 1410 | . . 3 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ 𝑃𝐶(𝑄 ∨ 𝑅)) → (𝑃 = (0.‘𝐾) ↔ 𝑄 = 𝑅)) |
| 19 | 18 | necon3bid 3002 | . 2 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ 𝑃𝐶(𝑄 ∨ 𝑅)) → (𝑃 ≠ (0.‘𝐾) ↔ 𝑄 ≠ 𝑅)) |
| 20 | 7, 19 | mpbid 235 | 1 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ 𝑃𝐶(𝑄 ∨ 𝑅)) → 𝑄 ≠ 𝑅) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 209 ∧ w3a 1103 = wceq 1570 ∈ wcel 2143 ≠ wne 2958 class class class wbr 5110 ‘cfv 6538 (class class class)co 7412 Basecbs 17270 joincjn 18368 0.cp0 18478 ⋖ ccvr 40014 Atomscatm 40015 AtLatcal 40016 HLchlt 40102 |
| 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 5239 ax-sep 5258 ax-nul 5270 ax-pow 5338 ax-pr 5406 ax-un 7734 |
| 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-rmo 3369 df-reu 3370 df-rab 3417 df-v 3457 df-sbc 3746 df-csb 3855 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-nul 4288 df-if 4489 df-pw 4565 df-sn 4591 df-pr 4593 df-op 4597 df-uni 4874 df-iun 4959 df-br 5111 df-opab 5175 df-mpt 5194 df-id 5558 df-xp 5669 df-rel 5670 df-cnv 5671 df-co 5672 df-dm 5673 df-rn 5674 df-res 5675 df-ima 5676 df-iota 6494 df-fun 6540 df-fn 6541 df-f 6542 df-f1 6543 df-fo 6544 df-f1o 6545 df-fv 6546 df-riota 7369 df-ov 7415 df-oprab 7416 df-proset 18351 df-poset 18370 df-plt 18385 df-lub 18401 df-glb 18402 df-join 18403 df-meet 18404 df-p0 18480 df-lat 18489 df-clat 18556 df-oposet 39928 df-ol 39930 df-oml 39931 df-covers 40018 df-ats 40019 df-atl 40050 df-cvlat 40074 df-hlat 40103 |
| This theorem is referenced by: atleneN 40186 |
| Copyright terms: Public domain | W3C validator |