| Mathbox for Norm Megill |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > atexchltN | Structured version Visualization version GIF version | ||
| Description: Atom exchange property. Version of hlatexch2 40277 with less-than ordering. (Contributed by NM, 7-Feb-2012.) (New usage is discouraged.) |
| Ref | Expression |
|---|---|
| atexchlt.s | ⊢ < = (lt‘𝐾) |
| atexchlt.j | ⊢ ∨ = (join‘𝐾) |
| atexchlt.a | ⊢ 𝐴 = (Atoms‘𝐾) |
| Ref | Expression |
|---|---|
| atexchltN | ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ 𝑃 ≠ 𝑅) → (𝑃 < (𝑄 ∨ 𝑅) → 𝑄 < (𝑃 ∨ 𝑅))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | atexchlt.j | . . 3 ⊢ ∨ = (join‘𝐾) | |
| 2 | atexchlt.a | . . 3 ⊢ 𝐴 = (Atoms‘𝐾) | |
| 3 | eqid 2762 | . . 3 ⊢ ( ⋖ ‘𝐾) = ( ⋖ ‘𝐾) | |
| 4 | 1, 2, 3 | atexchcvrN 40321 | . 2 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ 𝑃 ≠ 𝑅) → (𝑃( ⋖ ‘𝐾)(𝑄 ∨ 𝑅) → 𝑄( ⋖ ‘𝐾)(𝑃 ∨ 𝑅))) |
| 5 | atexchlt.s | . . . 4 ⊢ < = (lt‘𝐾) | |
| 6 | 5, 1, 2, 3 | atltcvr 40316 | . . 3 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴)) → (𝑃 < (𝑄 ∨ 𝑅) ↔ 𝑃( ⋖ ‘𝐾)(𝑄 ∨ 𝑅))) |
| 7 | 6 | 3adant3 1150 | . 2 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ 𝑃 ≠ 𝑅) → (𝑃 < (𝑄 ∨ 𝑅) ↔ 𝑃( ⋖ ‘𝐾)(𝑄 ∨ 𝑅))) |
| 8 | simpl 488 | . . . 4 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴)) → 𝐾 ∈ HL) | |
| 9 | simpr2 1214 | . . . 4 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴)) → 𝑄 ∈ 𝐴) | |
| 10 | simpr1 1213 | . . . 4 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴)) → 𝑃 ∈ 𝐴) | |
| 11 | simpr3 1215 | . . . 4 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴)) → 𝑅 ∈ 𝐴) | |
| 12 | 5, 1, 2, 3 | atltcvr 40316 | . . . 4 ⊢ ((𝐾 ∈ HL ∧ (𝑄 ∈ 𝐴 ∧ 𝑃 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴)) → (𝑄 < (𝑃 ∨ 𝑅) ↔ 𝑄( ⋖ ‘𝐾)(𝑃 ∨ 𝑅))) |
| 13 | 8, 9, 10, 11, 12 | syl13anc 1399 | . . 3 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴)) → (𝑄 < (𝑃 ∨ 𝑅) ↔ 𝑄( ⋖ ‘𝐾)(𝑃 ∨ 𝑅))) |
| 14 | 13 | 3adant3 1150 | . 2 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ 𝑃 ≠ 𝑅) → (𝑄 < (𝑃 ∨ 𝑅) ↔ 𝑄( ⋖ ‘𝐾)(𝑃 ∨ 𝑅))) |
| 15 | 4, 7, 14 | 3imtr4d 297 | 1 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ 𝑃 ≠ 𝑅) → (𝑃 < (𝑄 ∨ 𝑅) → 𝑄 < (𝑃 ∨ 𝑅))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 ∧ w3a 1103 = wceq 1570 ∈ wcel 2145 ≠ wne 2957 class class class wbr 5107 ‘cfv 6537 (class class class)co 7417 ltcplt 18402 joincjn 18405 ⋖ ccvr 40143 Atomscatm 40144 HLchlt 40231 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2215 ax-ext 2734 ax-rep 5236 ax-sep 5255 ax-nul 5267 ax-pow 5334 ax-pr 5402 ax-un 7740 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2566 df-eu 2596 df-clab 2741 df-cleq 2754 df-clel 2837 df-nfc 2911 df-ne 2958 df-ral 3079 df-rex 3089 df-rmo 3367 df-reu 3368 df-rab 3415 df-v 3455 df-sbc 3743 df-csb 3851 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-nul 4283 df-if 4486 df-pw 4562 df-sn 4588 df-pr 4590 df-op 4594 df-uni 4871 df-iun 4956 df-br 5108 df-opab 5172 df-mpt 5191 df-id 5554 df-xp 5665 df-rel 5666 df-cnv 5667 df-co 5668 df-dm 5669 df-rn 5670 df-res 5671 df-ima 5672 df-iota 6493 df-fun 6539 df-fn 6540 df-f 6541 df-f1 6542 df-fo 6543 df-f1o 6544 df-fv 6545 df-riota 7374 df-ov 7420 df-oprab 7421 df-proset 18388 df-poset 18407 df-plt 18422 df-lub 18438 df-glb 18439 df-join 18440 df-meet 18441 df-p0 18517 df-lat 18526 df-clat 18593 df-oposet 40057 df-ol 40059 df-oml 40060 df-covers 40147 df-ats 40148 df-atl 40179 df-cvlat 40203 df-hlat 40232 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |