| 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 40203 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 2766 | . . 3 ⊢ ( ⋖ ‘𝐾) = ( ⋖ ‘𝐾) | |
| 4 | 1, 2, 3 | atexchcvrN 40247 | . 2 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ 𝑃 ≠ 𝑅) → (𝑃( ⋖ ‘𝐾)(𝑄 ∨ 𝑅) → 𝑄( ⋖ ‘𝐾)(𝑃 ∨ 𝑅))) |
| 5 | atexchlt.s | . . . 4 ⊢ < = (lt‘𝐾) | |
| 6 | 5, 1, 2, 3 | atltcvr 40242 | . . 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 40242 | . . . 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 2146 ≠ wne 2961 class class class wbr 5114 ‘cfv 6543 (class class class)co 7423 ltcplt 18389 joincjn 18392 ⋖ ccvr 40069 Atomscatm 40070 HLchlt 40157 |
| 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 2148 ax-9 2156 ax-10 2179 ax-11 2195 ax-12 2216 ax-ext 2738 ax-rep 5243 ax-sep 5262 ax-nul 5274 ax-pow 5341 ax-pr 5409 ax-un 7745 |
| 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 2570 df-eu 2600 df-clab 2745 df-cleq 2758 df-clel 2841 df-nfc 2915 df-ne 2962 df-ral 3083 df-rex 3093 df-rmo 3372 df-reu 3373 df-rab 3420 df-v 3460 df-sbc 3748 df-csb 3857 df-dif 3911 df-un 3913 df-in 3915 df-ss 3925 df-nul 4290 df-if 4493 df-pw 4569 df-sn 4595 df-pr 4597 df-op 4601 df-uni 4878 df-iun 4963 df-br 5115 df-opab 5179 df-mpt 5198 df-id 5561 df-xp 5672 df-rel 5673 df-cnv 5674 df-co 5675 df-dm 5676 df-rn 5677 df-res 5678 df-ima 5679 df-iota 6499 df-fun 6545 df-fn 6546 df-f 6547 df-f1 6548 df-fo 6549 df-f1o 6550 df-fv 6551 df-riota 7380 df-ov 7426 df-oprab 7427 df-proset 18375 df-poset 18394 df-plt 18409 df-lub 18425 df-glb 18426 df-join 18427 df-meet 18428 df-p0 18504 df-lat 18513 df-clat 18580 df-oposet 39983 df-ol 39985 df-oml 39986 df-covers 40073 df-ats 40074 df-atl 40105 df-cvlat 40129 df-hlat 40158 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |