![]() |
Mathbox for Norm Megill |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > Mathboxes > leat2 | Structured version Visualization version GIF version |
Description: A nonzero poset element less than or equal to an atom equals the atom. (Contributed by NM, 6-Mar-2013.) |
Ref | Expression |
---|---|
leatom.b | ⊢ 𝐵 = (Base‘𝐾) |
leatom.l | ⊢ ≤ = (le‘𝐾) |
leatom.z | ⊢ 0 = (0.‘𝐾) |
leatom.a | ⊢ 𝐴 = (Atoms‘𝐾) |
Ref | Expression |
---|---|
leat2 | ⊢ (((𝐾 ∈ OP ∧ 𝑋 ∈ 𝐵 ∧ 𝑃 ∈ 𝐴) ∧ (𝑋 ≠ 0 ∧ 𝑋 ≤ 𝑃)) → 𝑋 = 𝑃) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | leatom.b | . . . . . 6 ⊢ 𝐵 = (Base‘𝐾) | |
2 | leatom.l | . . . . . 6 ⊢ ≤ = (le‘𝐾) | |
3 | leatom.z | . . . . . 6 ⊢ 0 = (0.‘𝐾) | |
4 | leatom.a | . . . . . 6 ⊢ 𝐴 = (Atoms‘𝐾) | |
5 | 1, 2, 3, 4 | leatb 35078 | . . . . 5 ⊢ ((𝐾 ∈ OP ∧ 𝑋 ∈ 𝐵 ∧ 𝑃 ∈ 𝐴) → (𝑋 ≤ 𝑃 ↔ (𝑋 = 𝑃 ∨ 𝑋 = 0 ))) |
6 | orcom 401 | . . . . . 6 ⊢ ((𝑋 = 𝑃 ∨ 𝑋 = 0 ) ↔ (𝑋 = 0 ∨ 𝑋 = 𝑃)) | |
7 | neor 3019 | . . . . . 6 ⊢ ((𝑋 = 0 ∨ 𝑋 = 𝑃) ↔ (𝑋 ≠ 0 → 𝑋 = 𝑃)) | |
8 | 6, 7 | bitri 264 | . . . . 5 ⊢ ((𝑋 = 𝑃 ∨ 𝑋 = 0 ) ↔ (𝑋 ≠ 0 → 𝑋 = 𝑃)) |
9 | 5, 8 | syl6bb 276 | . . . 4 ⊢ ((𝐾 ∈ OP ∧ 𝑋 ∈ 𝐵 ∧ 𝑃 ∈ 𝐴) → (𝑋 ≤ 𝑃 ↔ (𝑋 ≠ 0 → 𝑋 = 𝑃))) |
10 | 9 | biimpd 219 | . . 3 ⊢ ((𝐾 ∈ OP ∧ 𝑋 ∈ 𝐵 ∧ 𝑃 ∈ 𝐴) → (𝑋 ≤ 𝑃 → (𝑋 ≠ 0 → 𝑋 = 𝑃))) |
11 | 10 | com23 86 | . 2 ⊢ ((𝐾 ∈ OP ∧ 𝑋 ∈ 𝐵 ∧ 𝑃 ∈ 𝐴) → (𝑋 ≠ 0 → (𝑋 ≤ 𝑃 → 𝑋 = 𝑃))) |
12 | 11 | imp32 448 | 1 ⊢ (((𝐾 ∈ OP ∧ 𝑋 ∈ 𝐵 ∧ 𝑃 ∈ 𝐴) ∧ (𝑋 ≠ 0 ∧ 𝑋 ≤ 𝑃)) → 𝑋 = 𝑃) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∨ wo 382 ∧ wa 383 ∧ w3a 1072 = wceq 1628 ∈ wcel 2135 ≠ wne 2928 class class class wbr 4800 ‘cfv 6045 Basecbs 16055 lecple 16146 0.cp0 17234 OPcops 34958 Atomscatm 35049 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1867 ax-4 1882 ax-5 1984 ax-6 2050 ax-7 2086 ax-8 2137 ax-9 2144 ax-10 2164 ax-11 2179 ax-12 2192 ax-13 2387 ax-ext 2736 ax-rep 4919 ax-sep 4929 ax-nul 4937 ax-pow 4988 ax-pr 5051 ax-un 7110 |
This theorem depends on definitions: df-bi 197 df-or 384 df-an 385 df-3an 1074 df-tru 1631 df-ex 1850 df-nf 1855 df-sb 2043 df-eu 2607 df-mo 2608 df-clab 2743 df-cleq 2749 df-clel 2752 df-nfc 2887 df-ne 2929 df-ral 3051 df-rex 3052 df-reu 3053 df-rab 3055 df-v 3338 df-sbc 3573 df-csb 3671 df-dif 3714 df-un 3716 df-in 3718 df-ss 3725 df-nul 4055 df-if 4227 df-pw 4300 df-sn 4318 df-pr 4320 df-op 4324 df-uni 4585 df-iun 4670 df-br 4801 df-opab 4861 df-mpt 4878 df-id 5170 df-xp 5268 df-rel 5269 df-cnv 5270 df-co 5271 df-dm 5272 df-rn 5273 df-res 5274 df-ima 5275 df-iota 6008 df-fun 6047 df-fn 6048 df-f 6049 df-f1 6050 df-fo 6051 df-f1o 6052 df-fv 6053 df-riota 6770 df-ov 6812 df-preset 17125 df-poset 17143 df-plt 17155 df-glb 17172 df-p0 17236 df-oposet 34962 df-covers 35052 df-ats 35053 |
This theorem is referenced by: dalemcea 35445 cdlemg12g 36435 |
Copyright terms: Public domain | W3C validator |