![]() |
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 32375 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 39168 | . . . . 5 ⊢ ((𝐾 ∈ OP ∧ 𝑋 ∈ 𝐵) → 0 ≤ 𝑋) |
5 | 4 | 3adant3 1131 | . . . 4 ⊢ ((𝐾 ∈ OP ∧ 𝑋 ∈ 𝐵 ∧ 𝑃 ∈ 𝐴) → 0 ≤ 𝑋) |
6 | 5 | biantrurd 532 | . . 3 ⊢ ((𝐾 ∈ OP ∧ 𝑋 ∈ 𝐵 ∧ 𝑃 ∈ 𝐴) → (𝑋 ≤ 𝑃 ↔ ( 0 ≤ 𝑋 ∧ 𝑋 ≤ 𝑃))) |
7 | opposet 39163 | . . . . . 6 ⊢ (𝐾 ∈ OP → 𝐾 ∈ Poset) | |
8 | 7 | 3ad2ant1 1132 | . . . . 5 ⊢ ((𝐾 ∈ OP ∧ 𝑋 ∈ 𝐵 ∧ 𝑃 ∈ 𝐴) → 𝐾 ∈ Poset) |
9 | 1, 3 | op0cl 39166 | . . . . . . 7 ⊢ (𝐾 ∈ OP → 0 ∈ 𝐵) |
10 | leatom.a | . . . . . . . 8 ⊢ 𝐴 = (Atoms‘𝐾) | |
11 | 1, 10 | atbase 39271 | . . . . . . 7 ⊢ (𝑃 ∈ 𝐴 → 𝑃 ∈ 𝐵) |
12 | id 22 | . . . . . . 7 ⊢ (𝑋 ∈ 𝐵 → 𝑋 ∈ 𝐵) | |
13 | 9, 11, 12 | 3anim123i 1150 | . . . . . 6 ⊢ ((𝐾 ∈ OP ∧ 𝑃 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵) → ( 0 ∈ 𝐵 ∧ 𝑃 ∈ 𝐵 ∧ 𝑋 ∈ 𝐵)) |
14 | 13 | 3com23 1125 | . . . . 5 ⊢ ((𝐾 ∈ OP ∧ 𝑋 ∈ 𝐵 ∧ 𝑃 ∈ 𝐴) → ( 0 ∈ 𝐵 ∧ 𝑃 ∈ 𝐵 ∧ 𝑋 ∈ 𝐵)) |
15 | eqid 2735 | . . . . . . 7 ⊢ ( ⋖ ‘𝐾) = ( ⋖ ‘𝐾) | |
16 | 3, 15, 10 | atcvr0 39270 | . . . . . 6 ⊢ ((𝐾 ∈ OP ∧ 𝑃 ∈ 𝐴) → 0 ( ⋖ ‘𝐾)𝑃) |
17 | 16 | 3adant2 1130 | . . . . 5 ⊢ ((𝐾 ∈ OP ∧ 𝑋 ∈ 𝐵 ∧ 𝑃 ∈ 𝐴) → 0 ( ⋖ ‘𝐾)𝑃) |
18 | 1, 2, 15 | cvrnbtwn4 39261 | . . . . 5 ⊢ ((𝐾 ∈ Poset ∧ ( 0 ∈ 𝐵 ∧ 𝑃 ∈ 𝐵 ∧ 𝑋 ∈ 𝐵) ∧ 0 ( ⋖ ‘𝐾)𝑃) → (( 0 ≤ 𝑋 ∧ 𝑋 ≤ 𝑃) ↔ ( 0 = 𝑋 ∨ 𝑋 = 𝑃))) |
19 | 8, 14, 17, 18 | syl3anc 1370 | . . . 4 ⊢ ((𝐾 ∈ OP ∧ 𝑋 ∈ 𝐵 ∧ 𝑃 ∈ 𝐴) → (( 0 ≤ 𝑋 ∧ 𝑋 ≤ 𝑃) ↔ ( 0 = 𝑋 ∨ 𝑋 = 𝑃))) |
20 | eqcom 2742 | . . . . 5 ⊢ ( 0 = 𝑋 ↔ 𝑋 = 0 ) | |
21 | 20 | orbi1i 913 | . . . 4 ⊢ (( 0 = 𝑋 ∨ 𝑋 = 𝑃) ↔ (𝑋 = 0 ∨ 𝑋 = 𝑃)) |
22 | 19, 21 | bitrdi 287 | . . 3 ⊢ ((𝐾 ∈ OP ∧ 𝑋 ∈ 𝐵 ∧ 𝑃 ∈ 𝐴) → (( 0 ≤ 𝑋 ∧ 𝑋 ≤ 𝑃) ↔ (𝑋 = 0 ∨ 𝑋 = 𝑃))) |
23 | 6, 22 | bitrd 279 | . 2 ⊢ ((𝐾 ∈ OP ∧ 𝑋 ∈ 𝐵 ∧ 𝑃 ∈ 𝐴) → (𝑋 ≤ 𝑃 ↔ (𝑋 = 0 ∨ 𝑋 = 𝑃))) |
24 | orcom 870 | . 2 ⊢ ((𝑋 = 0 ∨ 𝑋 = 𝑃) ↔ (𝑋 = 𝑃 ∨ 𝑋 = 0 )) | |
25 | 23, 24 | bitrdi 287 | 1 ⊢ ((𝐾 ∈ OP ∧ 𝑋 ∈ 𝐵 ∧ 𝑃 ∈ 𝐴) → (𝑋 ≤ 𝑃 ↔ (𝑋 = 𝑃 ∨ 𝑋 = 0 ))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 ∨ wo 847 ∧ w3a 1086 = wceq 1537 ∈ wcel 2106 class class class wbr 5148 ‘cfv 6563 Basecbs 17245 lecple 17305 Posetcpo 18365 0.cp0 18481 OPcops 39154 ⋖ ccvr 39244 Atomscatm 39245 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1908 ax-6 1965 ax-7 2005 ax-8 2108 ax-9 2116 ax-10 2139 ax-11 2155 ax-12 2175 ax-ext 2706 ax-rep 5285 ax-sep 5302 ax-nul 5312 ax-pow 5371 ax-pr 5438 ax-un 7754 |
This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1540 df-fal 1550 df-ex 1777 df-nf 1781 df-sb 2063 df-mo 2538 df-eu 2567 df-clab 2713 df-cleq 2727 df-clel 2814 df-nfc 2890 df-ne 2939 df-ral 3060 df-rex 3069 df-rmo 3378 df-reu 3379 df-rab 3434 df-v 3480 df-sbc 3792 df-csb 3909 df-dif 3966 df-un 3968 df-in 3970 df-ss 3980 df-nul 4340 df-if 4532 df-pw 4607 df-sn 4632 df-pr 4634 df-op 4638 df-uni 4913 df-iun 4998 df-br 5149 df-opab 5211 df-mpt 5232 df-id 5583 df-xp 5695 df-rel 5696 df-cnv 5697 df-co 5698 df-dm 5699 df-rn 5700 df-res 5701 df-ima 5702 df-iota 6516 df-fun 6565 df-fn 6566 df-f 6567 df-f1 6568 df-fo 6569 df-f1o 6570 df-fv 6571 df-riota 7388 df-ov 7434 df-proset 18352 df-poset 18371 df-plt 18388 df-glb 18405 df-p0 18483 df-oposet 39158 df-covers 39248 df-ats 39249 |
This theorem is referenced by: leat 39275 leat2 39276 meetat 39278 |
Copyright terms: Public domain | W3C validator |