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 30123 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 36337 | . . . . 5 ⊢ ((𝐾 ∈ OP ∧ 𝑋 ∈ 𝐵) → 0 ≤ 𝑋) |
5 | 4 | 3adant3 1128 | . . . 4 ⊢ ((𝐾 ∈ OP ∧ 𝑋 ∈ 𝐵 ∧ 𝑃 ∈ 𝐴) → 0 ≤ 𝑋) |
6 | 5 | biantrurd 535 | . . 3 ⊢ ((𝐾 ∈ OP ∧ 𝑋 ∈ 𝐵 ∧ 𝑃 ∈ 𝐴) → (𝑋 ≤ 𝑃 ↔ ( 0 ≤ 𝑋 ∧ 𝑋 ≤ 𝑃))) |
7 | opposet 36332 | . . . . . 6 ⊢ (𝐾 ∈ OP → 𝐾 ∈ Poset) | |
8 | 7 | 3ad2ant1 1129 | . . . . 5 ⊢ ((𝐾 ∈ OP ∧ 𝑋 ∈ 𝐵 ∧ 𝑃 ∈ 𝐴) → 𝐾 ∈ Poset) |
9 | 1, 3 | op0cl 36335 | . . . . . . 7 ⊢ (𝐾 ∈ OP → 0 ∈ 𝐵) |
10 | leatom.a | . . . . . . . 8 ⊢ 𝐴 = (Atoms‘𝐾) | |
11 | 1, 10 | atbase 36440 | . . . . . . 7 ⊢ (𝑃 ∈ 𝐴 → 𝑃 ∈ 𝐵) |
12 | id 22 | . . . . . . 7 ⊢ (𝑋 ∈ 𝐵 → 𝑋 ∈ 𝐵) | |
13 | 9, 11, 12 | 3anim123i 1147 | . . . . . 6 ⊢ ((𝐾 ∈ OP ∧ 𝑃 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵) → ( 0 ∈ 𝐵 ∧ 𝑃 ∈ 𝐵 ∧ 𝑋 ∈ 𝐵)) |
14 | 13 | 3com23 1122 | . . . . 5 ⊢ ((𝐾 ∈ OP ∧ 𝑋 ∈ 𝐵 ∧ 𝑃 ∈ 𝐴) → ( 0 ∈ 𝐵 ∧ 𝑃 ∈ 𝐵 ∧ 𝑋 ∈ 𝐵)) |
15 | eqid 2821 | . . . . . . 7 ⊢ ( ⋖ ‘𝐾) = ( ⋖ ‘𝐾) | |
16 | 3, 15, 10 | atcvr0 36439 | . . . . . 6 ⊢ ((𝐾 ∈ OP ∧ 𝑃 ∈ 𝐴) → 0 ( ⋖ ‘𝐾)𝑃) |
17 | 16 | 3adant2 1127 | . . . . 5 ⊢ ((𝐾 ∈ OP ∧ 𝑋 ∈ 𝐵 ∧ 𝑃 ∈ 𝐴) → 0 ( ⋖ ‘𝐾)𝑃) |
18 | 1, 2, 15 | cvrnbtwn4 36430 | . . . . 5 ⊢ ((𝐾 ∈ Poset ∧ ( 0 ∈ 𝐵 ∧ 𝑃 ∈ 𝐵 ∧ 𝑋 ∈ 𝐵) ∧ 0 ( ⋖ ‘𝐾)𝑃) → (( 0 ≤ 𝑋 ∧ 𝑋 ≤ 𝑃) ↔ ( 0 = 𝑋 ∨ 𝑋 = 𝑃))) |
19 | 8, 14, 17, 18 | syl3anc 1367 | . . . 4 ⊢ ((𝐾 ∈ OP ∧ 𝑋 ∈ 𝐵 ∧ 𝑃 ∈ 𝐴) → (( 0 ≤ 𝑋 ∧ 𝑋 ≤ 𝑃) ↔ ( 0 = 𝑋 ∨ 𝑋 = 𝑃))) |
20 | eqcom 2828 | . . . . 5 ⊢ ( 0 = 𝑋 ↔ 𝑋 = 0 ) | |
21 | 20 | orbi1i 910 | . . . 4 ⊢ (( 0 = 𝑋 ∨ 𝑋 = 𝑃) ↔ (𝑋 = 0 ∨ 𝑋 = 𝑃)) |
22 | 19, 21 | syl6bb 289 | . . 3 ⊢ ((𝐾 ∈ OP ∧ 𝑋 ∈ 𝐵 ∧ 𝑃 ∈ 𝐴) → (( 0 ≤ 𝑋 ∧ 𝑋 ≤ 𝑃) ↔ (𝑋 = 0 ∨ 𝑋 = 𝑃))) |
23 | 6, 22 | bitrd 281 | . 2 ⊢ ((𝐾 ∈ OP ∧ 𝑋 ∈ 𝐵 ∧ 𝑃 ∈ 𝐴) → (𝑋 ≤ 𝑃 ↔ (𝑋 = 0 ∨ 𝑋 = 𝑃))) |
24 | orcom 866 | . 2 ⊢ ((𝑋 = 0 ∨ 𝑋 = 𝑃) ↔ (𝑋 = 𝑃 ∨ 𝑋 = 0 )) | |
25 | 23, 24 | syl6bb 289 | 1 ⊢ ((𝐾 ∈ OP ∧ 𝑋 ∈ 𝐵 ∧ 𝑃 ∈ 𝐴) → (𝑋 ≤ 𝑃 ↔ (𝑋 = 𝑃 ∨ 𝑋 = 0 ))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 208 ∧ wa 398 ∨ wo 843 ∧ w3a 1083 = wceq 1537 ∈ wcel 2114 class class class wbr 5066 ‘cfv 6355 Basecbs 16483 lecple 16572 Posetcpo 17550 0.cp0 17647 OPcops 36323 ⋖ ccvr 36413 Atomscatm 36414 |
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 1970 ax-7 2015 ax-8 2116 ax-9 2124 ax-10 2145 ax-11 2161 ax-12 2177 ax-ext 2793 ax-rep 5190 ax-sep 5203 ax-nul 5210 ax-pow 5266 ax-pr 5330 ax-un 7461 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3an 1085 df-tru 1540 df-ex 1781 df-nf 1785 df-sb 2070 df-mo 2622 df-eu 2654 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-ne 3017 df-ral 3143 df-rex 3144 df-reu 3145 df-rab 3147 df-v 3496 df-sbc 3773 df-csb 3884 df-dif 3939 df-un 3941 df-in 3943 df-ss 3952 df-nul 4292 df-if 4468 df-pw 4541 df-sn 4568 df-pr 4570 df-op 4574 df-uni 4839 df-iun 4921 df-br 5067 df-opab 5129 df-mpt 5147 df-id 5460 df-xp 5561 df-rel 5562 df-cnv 5563 df-co 5564 df-dm 5565 df-rn 5566 df-res 5567 df-ima 5568 df-iota 6314 df-fun 6357 df-fn 6358 df-f 6359 df-f1 6360 df-fo 6361 df-f1o 6362 df-fv 6363 df-riota 7114 df-ov 7159 df-proset 17538 df-poset 17556 df-plt 17568 df-glb 17585 df-p0 17649 df-oposet 36327 df-covers 36417 df-ats 36418 |
This theorem is referenced by: leat 36444 leat2 36445 meetat 36447 |
Copyright terms: Public domain | W3C validator |