| 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 39258 | . . . . 5 ⊢ ((𝐾 ∈ OP ∧ 𝑋 ∈ 𝐵 ∧ 𝑃 ∈ 𝐴) → (𝑋 ≤ 𝑃 ↔ (𝑋 = 𝑃 ∨ 𝑋 = 0 ))) |
| 6 | orcom 870 | . . . . . 6 ⊢ ((𝑋 = 𝑃 ∨ 𝑋 = 0 ) ↔ (𝑋 = 0 ∨ 𝑋 = 𝑃)) | |
| 7 | neor 3017 | . . . . . 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 1540 ∈ wcel 2109 ≠ wne 2925 class class class wbr 5102 ‘cfv 6499 Basecbs 17155 lecple 17203 0.cp0 18358 OPcops 39138 Atomscatm 39229 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-10 2142 ax-11 2158 ax-12 2178 ax-ext 2701 ax-rep 5229 ax-sep 5246 ax-nul 5256 ax-pow 5315 ax-pr 5382 ax-un 7691 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2533 df-eu 2562 df-clab 2708 df-cleq 2721 df-clel 2803 df-nfc 2878 df-ne 2926 df-ral 3045 df-rex 3054 df-rmo 3351 df-reu 3352 df-rab 3403 df-v 3446 df-sbc 3751 df-csb 3860 df-dif 3914 df-un 3916 df-in 3918 df-ss 3928 df-nul 4293 df-if 4485 df-pw 4561 df-sn 4586 df-pr 4588 df-op 4592 df-uni 4868 df-iun 4953 df-br 5103 df-opab 5165 df-mpt 5184 df-id 5526 df-xp 5637 df-rel 5638 df-cnv 5639 df-co 5640 df-dm 5641 df-rn 5642 df-res 5643 df-ima 5644 df-iota 6452 df-fun 6501 df-fn 6502 df-f 6503 df-f1 6504 df-fo 6505 df-f1o 6506 df-fv 6507 df-riota 7326 df-ov 7372 df-proset 18231 df-poset 18250 df-plt 18265 df-glb 18282 df-p0 18360 df-oposet 39142 df-covers 39232 df-ats 39233 |
| This theorem is referenced by: dalemcea 39627 cdlemg12g 40616 |
| Copyright terms: Public domain | W3C validator |