| 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 39491 | . . . . 5 ⊢ ((𝐾 ∈ OP ∧ 𝑋 ∈ 𝐵 ∧ 𝑃 ∈ 𝐴) → (𝑋 ≤ 𝑃 ↔ (𝑋 = 𝑃 ∨ 𝑋 = 0 ))) |
| 6 | orcom 870 | . . . . . 6 ⊢ ((𝑋 = 𝑃 ∨ 𝑋 = 0 ) ↔ (𝑋 = 0 ∨ 𝑋 = 𝑃)) | |
| 7 | neor 3022 | . . . . . 6 ⊢ ((𝑋 = 0 ∨ 𝑋 = 𝑃) ↔ (𝑋 ≠ 0 → 𝑋 = 𝑃)) | |
| 8 | 6, 7 | bitri 275 | . . . . 5 ⊢ ((𝑋 = 𝑃 ∨ 𝑋 = 0 ) ↔ (𝑋 ≠ 0 → 𝑋 = 𝑃)) |
| 9 | 5, 8 | bitrdi 287 | . . . 4 ⊢ ((𝐾 ∈ OP ∧ 𝑋 ∈ 𝐵 ∧ 𝑃 ∈ 𝐴) → (𝑋 ≤ 𝑃 ↔ (𝑋 ≠ 0 → 𝑋 = 𝑃))) |
| 10 | 9 | biimpd 229 | . . 3 ⊢ ((𝐾 ∈ OP ∧ 𝑋 ∈ 𝐵 ∧ 𝑃 ∈ 𝐴) → (𝑋 ≤ 𝑃 → (𝑋 ≠ 0 → 𝑋 = 𝑃))) |
| 11 | 10 | com23 86 | . 2 ⊢ ((𝐾 ∈ OP ∧ 𝑋 ∈ 𝐵 ∧ 𝑃 ∈ 𝐴) → (𝑋 ≠ 0 → (𝑋 ≤ 𝑃 → 𝑋 = 𝑃))) |
| 12 | 11 | imp32 418 | 1 ⊢ (((𝐾 ∈ OP ∧ 𝑋 ∈ 𝐵 ∧ 𝑃 ∈ 𝐴) ∧ (𝑋 ≠ 0 ∧ 𝑋 ≤ 𝑃)) → 𝑋 = 𝑃) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 ∨ wo 847 ∧ w3a 1086 = wceq 1541 ∈ wcel 2113 ≠ wne 2930 class class class wbr 5096 ‘cfv 6490 Basecbs 17134 lecple 17182 0.cp0 18342 OPcops 39371 Atomscatm 39462 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-10 2146 ax-11 2162 ax-12 2182 ax-ext 2706 ax-rep 5222 ax-sep 5239 ax-nul 5249 ax-pow 5308 ax-pr 5375 ax-un 7678 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2537 df-eu 2567 df-clab 2713 df-cleq 2726 df-clel 2809 df-nfc 2883 df-ne 2931 df-ral 3050 df-rex 3059 df-rmo 3348 df-reu 3349 df-rab 3398 df-v 3440 df-sbc 3739 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-nul 4284 df-if 4478 df-pw 4554 df-sn 4579 df-pr 4581 df-op 4585 df-uni 4862 df-iun 4946 df-br 5097 df-opab 5159 df-mpt 5178 df-id 5517 df-xp 5628 df-rel 5629 df-cnv 5630 df-co 5631 df-dm 5632 df-rn 5633 df-res 5634 df-ima 5635 df-iota 6446 df-fun 6492 df-fn 6493 df-f 6494 df-f1 6495 df-fo 6496 df-f1o 6497 df-fv 6498 df-riota 7313 df-ov 7359 df-proset 18215 df-poset 18234 df-plt 18249 df-glb 18266 df-p0 18344 df-oposet 39375 df-covers 39465 df-ats 39466 |
| This theorem is referenced by: dalemcea 39859 cdlemg12g 40848 |
| Copyright terms: Public domain | W3C validator |