Mathbox for Norm Megill |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > Mathboxes > leatb | Structured version Visualization version GIF version |
Description: A poset element less than or equal to an atom equals either zero or the atom. (atss 29205 analog.) (Contributed by NM, 17-Nov-2011.) |
Ref | Expression |
---|---|
leatom.b | ⊢ 𝐵 = (Base‘𝐾) |
leatom.l | ⊢ ≤ = (le‘𝐾) |
leatom.z | ⊢ 0 = (0.‘𝐾) |
leatom.a | ⊢ 𝐴 = (Atoms‘𝐾) |
Ref | Expression |
---|---|
leatb | ⊢ ((𝐾 ∈ OP ∧ 𝑋 ∈ 𝐵 ∧ 𝑃 ∈ 𝐴) → (𝑋 ≤ 𝑃 ↔ (𝑋 = 𝑃 ∨ 𝑋 = 0 ))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | leatom.b | . . . . . 6 ⊢ 𝐵 = (Base‘𝐾) | |
2 | leatom.l | . . . . . 6 ⊢ ≤ = (le‘𝐾) | |
3 | leatom.z | . . . . . 6 ⊢ 0 = (0.‘𝐾) | |
4 | 1, 2, 3 | op0le 34473 | . . . . 5 ⊢ ((𝐾 ∈ OP ∧ 𝑋 ∈ 𝐵) → 0 ≤ 𝑋) |
5 | 4 | 3adant3 1081 | . . . 4 ⊢ ((𝐾 ∈ OP ∧ 𝑋 ∈ 𝐵 ∧ 𝑃 ∈ 𝐴) → 0 ≤ 𝑋) |
6 | 5 | biantrurd 529 | . . 3 ⊢ ((𝐾 ∈ OP ∧ 𝑋 ∈ 𝐵 ∧ 𝑃 ∈ 𝐴) → (𝑋 ≤ 𝑃 ↔ ( 0 ≤ 𝑋 ∧ 𝑋 ≤ 𝑃))) |
7 | opposet 34468 | . . . . . 6 ⊢ (𝐾 ∈ OP → 𝐾 ∈ Poset) | |
8 | 7 | 3ad2ant1 1082 | . . . . 5 ⊢ ((𝐾 ∈ OP ∧ 𝑋 ∈ 𝐵 ∧ 𝑃 ∈ 𝐴) → 𝐾 ∈ Poset) |
9 | 1, 3 | op0cl 34471 | . . . . . . 7 ⊢ (𝐾 ∈ OP → 0 ∈ 𝐵) |
10 | leatom.a | . . . . . . . 8 ⊢ 𝐴 = (Atoms‘𝐾) | |
11 | 1, 10 | atbase 34576 | . . . . . . 7 ⊢ (𝑃 ∈ 𝐴 → 𝑃 ∈ 𝐵) |
12 | id 22 | . . . . . . 7 ⊢ (𝑋 ∈ 𝐵 → 𝑋 ∈ 𝐵) | |
13 | 9, 11, 12 | 3anim123i 1247 | . . . . . 6 ⊢ ((𝐾 ∈ OP ∧ 𝑃 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵) → ( 0 ∈ 𝐵 ∧ 𝑃 ∈ 𝐵 ∧ 𝑋 ∈ 𝐵)) |
14 | 13 | 3com23 1271 | . . . . 5 ⊢ ((𝐾 ∈ OP ∧ 𝑋 ∈ 𝐵 ∧ 𝑃 ∈ 𝐴) → ( 0 ∈ 𝐵 ∧ 𝑃 ∈ 𝐵 ∧ 𝑋 ∈ 𝐵)) |
15 | eqid 2622 | . . . . . . 7 ⊢ ( ⋖ ‘𝐾) = ( ⋖ ‘𝐾) | |
16 | 3, 15, 10 | atcvr0 34575 | . . . . . 6 ⊢ ((𝐾 ∈ OP ∧ 𝑃 ∈ 𝐴) → 0 ( ⋖ ‘𝐾)𝑃) |
17 | 16 | 3adant2 1080 | . . . . 5 ⊢ ((𝐾 ∈ OP ∧ 𝑋 ∈ 𝐵 ∧ 𝑃 ∈ 𝐴) → 0 ( ⋖ ‘𝐾)𝑃) |
18 | 1, 2, 15 | cvrnbtwn4 34566 | . . . . 5 ⊢ ((𝐾 ∈ Poset ∧ ( 0 ∈ 𝐵 ∧ 𝑃 ∈ 𝐵 ∧ 𝑋 ∈ 𝐵) ∧ 0 ( ⋖ ‘𝐾)𝑃) → (( 0 ≤ 𝑋 ∧ 𝑋 ≤ 𝑃) ↔ ( 0 = 𝑋 ∨ 𝑋 = 𝑃))) |
19 | 8, 14, 17, 18 | syl3anc 1326 | . . . 4 ⊢ ((𝐾 ∈ OP ∧ 𝑋 ∈ 𝐵 ∧ 𝑃 ∈ 𝐴) → (( 0 ≤ 𝑋 ∧ 𝑋 ≤ 𝑃) ↔ ( 0 = 𝑋 ∨ 𝑋 = 𝑃))) |
20 | eqcom 2629 | . . . . 5 ⊢ ( 0 = 𝑋 ↔ 𝑋 = 0 ) | |
21 | 20 | orbi1i 542 | . . . 4 ⊢ (( 0 = 𝑋 ∨ 𝑋 = 𝑃) ↔ (𝑋 = 0 ∨ 𝑋 = 𝑃)) |
22 | 19, 21 | syl6bb 276 | . . 3 ⊢ ((𝐾 ∈ OP ∧ 𝑋 ∈ 𝐵 ∧ 𝑃 ∈ 𝐴) → (( 0 ≤ 𝑋 ∧ 𝑋 ≤ 𝑃) ↔ (𝑋 = 0 ∨ 𝑋 = 𝑃))) |
23 | 6, 22 | bitrd 268 | . 2 ⊢ ((𝐾 ∈ OP ∧ 𝑋 ∈ 𝐵 ∧ 𝑃 ∈ 𝐴) → (𝑋 ≤ 𝑃 ↔ (𝑋 = 0 ∨ 𝑋 = 𝑃))) |
24 | orcom 402 | . 2 ⊢ ((𝑋 = 0 ∨ 𝑋 = 𝑃) ↔ (𝑋 = 𝑃 ∨ 𝑋 = 0 )) | |
25 | 23, 24 | syl6bb 276 | 1 ⊢ ((𝐾 ∈ OP ∧ 𝑋 ∈ 𝐵 ∧ 𝑃 ∈ 𝐴) → (𝑋 ≤ 𝑃 ↔ (𝑋 = 𝑃 ∨ 𝑋 = 0 ))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 196 ∨ wo 383 ∧ wa 384 ∧ w3a 1037 = wceq 1483 ∈ wcel 1990 class class class wbr 4653 ‘cfv 5888 Basecbs 15857 lecple 15948 Posetcpo 16940 0.cp0 17037 OPcops 34459 ⋖ ccvr 34549 Atomscatm 34550 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1722 ax-4 1737 ax-5 1839 ax-6 1888 ax-7 1935 ax-8 1992 ax-9 1999 ax-10 2019 ax-11 2034 ax-12 2047 ax-13 2246 ax-ext 2602 ax-rep 4771 ax-sep 4781 ax-nul 4789 ax-pow 4843 ax-pr 4906 ax-un 6949 |
This theorem depends on definitions: df-bi 197 df-or 385 df-an 386 df-3an 1039 df-tru 1486 df-ex 1705 df-nf 1710 df-sb 1881 df-eu 2474 df-mo 2475 df-clab 2609 df-cleq 2615 df-clel 2618 df-nfc 2753 df-ne 2795 df-ral 2917 df-rex 2918 df-reu 2919 df-rab 2921 df-v 3202 df-sbc 3436 df-csb 3534 df-dif 3577 df-un 3579 df-in 3581 df-ss 3588 df-nul 3916 df-if 4087 df-pw 4160 df-sn 4178 df-pr 4180 df-op 4184 df-uni 4437 df-iun 4522 df-br 4654 df-opab 4713 df-mpt 4730 df-id 5024 df-xp 5120 df-rel 5121 df-cnv 5122 df-co 5123 df-dm 5124 df-rn 5125 df-res 5126 df-ima 5127 df-iota 5851 df-fun 5890 df-fn 5891 df-f 5892 df-f1 5893 df-fo 5894 df-f1o 5895 df-fv 5896 df-riota 6611 df-ov 6653 df-preset 16928 df-poset 16946 df-plt 16958 df-glb 16975 df-p0 17039 df-oposet 34463 df-covers 34553 df-ats 34554 |
This theorem is referenced by: leat 34580 leat2 34581 meetat 34583 |
Copyright terms: Public domain | W3C validator |