| Mathbox for Norm Megill |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > trlat | Structured version Visualization version GIF version | ||
| Description: If an atom differs from its translation, the trace is an atom. Equation above Lemma C in [Crawley] p. 112. (Contributed by NM, 23-May-2012.) |
| Ref | Expression |
|---|---|
| trlat.l | ⊢ ≤ = (le‘𝐾) |
| trlat.a | ⊢ 𝐴 = (Atoms‘𝐾) |
| trlat.h | ⊢ 𝐻 = (LHyp‘𝐾) |
| trlat.t | ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊) |
| trlat.r | ⊢ 𝑅 = ((trL‘𝐾)‘𝑊) |
| Ref | Expression |
|---|---|
| trlat | ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝐹 ∈ 𝑇 ∧ (𝐹‘𝑃) ≠ 𝑃)) → (𝑅‘𝐹) ∈ 𝐴) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | simp1 1136 | . . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝐹 ∈ 𝑇 ∧ (𝐹‘𝑃) ≠ 𝑃)) → (𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻)) | |
| 2 | simp3l 1202 | . . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝐹 ∈ 𝑇 ∧ (𝐹‘𝑃) ≠ 𝑃)) → 𝐹 ∈ 𝑇) | |
| 3 | simp2 1137 | . . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝐹 ∈ 𝑇 ∧ (𝐹‘𝑃) ≠ 𝑃)) → (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) | |
| 4 | trlat.l | . . . 4 ⊢ ≤ = (le‘𝐾) | |
| 5 | eqid 2735 | . . . 4 ⊢ (join‘𝐾) = (join‘𝐾) | |
| 6 | eqid 2735 | . . . 4 ⊢ (meet‘𝐾) = (meet‘𝐾) | |
| 7 | trlat.a | . . . 4 ⊢ 𝐴 = (Atoms‘𝐾) | |
| 8 | trlat.h | . . . 4 ⊢ 𝐻 = (LHyp‘𝐾) | |
| 9 | trlat.t | . . . 4 ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊) | |
| 10 | trlat.r | . . . 4 ⊢ 𝑅 = ((trL‘𝐾)‘𝑊) | |
| 11 | 4, 5, 6, 7, 8, 9, 10 | trlval2 40182 | . . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → (𝑅‘𝐹) = ((𝑃(join‘𝐾)(𝐹‘𝑃))(meet‘𝐾)𝑊)) |
| 12 | 1, 2, 3, 11 | syl3anc 1373 | . 2 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝐹 ∈ 𝑇 ∧ (𝐹‘𝑃) ≠ 𝑃)) → (𝑅‘𝐹) = ((𝑃(join‘𝐾)(𝐹‘𝑃))(meet‘𝐾)𝑊)) |
| 13 | simp2l 1200 | . . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝐹 ∈ 𝑇 ∧ (𝐹‘𝑃) ≠ 𝑃)) → 𝑃 ∈ 𝐴) | |
| 14 | 4, 7, 8, 9 | ltrnat 40159 | . . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ 𝑃 ∈ 𝐴) → (𝐹‘𝑃) ∈ 𝐴) |
| 15 | 1, 2, 13, 14 | syl3anc 1373 | . . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝐹 ∈ 𝑇 ∧ (𝐹‘𝑃) ≠ 𝑃)) → (𝐹‘𝑃) ∈ 𝐴) |
| 16 | simp3r 1203 | . . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝐹 ∈ 𝑇 ∧ (𝐹‘𝑃) ≠ 𝑃)) → (𝐹‘𝑃) ≠ 𝑃) | |
| 17 | 16 | necomd 2987 | . . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝐹 ∈ 𝑇 ∧ (𝐹‘𝑃) ≠ 𝑃)) → 𝑃 ≠ (𝐹‘𝑃)) |
| 18 | 4, 5, 6, 7, 8 | lhpat 40062 | . . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ ((𝐹‘𝑃) ∈ 𝐴 ∧ 𝑃 ≠ (𝐹‘𝑃))) → ((𝑃(join‘𝐾)(𝐹‘𝑃))(meet‘𝐾)𝑊) ∈ 𝐴) |
| 19 | 1, 3, 15, 17, 18 | syl112anc 1376 | . 2 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝐹 ∈ 𝑇 ∧ (𝐹‘𝑃) ≠ 𝑃)) → ((𝑃(join‘𝐾)(𝐹‘𝑃))(meet‘𝐾)𝑊) ∈ 𝐴) |
| 20 | 12, 19 | eqeltrd 2834 | 1 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝐹 ∈ 𝑇 ∧ (𝐹‘𝑃) ≠ 𝑃)) → (𝑅‘𝐹) ∈ 𝐴) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ∧ wa 395 ∧ w3a 1086 = wceq 1540 ∈ wcel 2108 ≠ wne 2932 class class class wbr 5119 ‘cfv 6531 (class class class)co 7405 lecple 17278 joincjn 18323 meetcmee 18324 Atomscatm 39281 HLchlt 39368 LHypclh 40003 LTrncltrn 40120 trLctrl 40177 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2007 ax-8 2110 ax-9 2118 ax-10 2141 ax-11 2157 ax-12 2177 ax-ext 2707 ax-rep 5249 ax-sep 5266 ax-nul 5276 ax-pow 5335 ax-pr 5402 ax-un 7729 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2065 df-mo 2539 df-eu 2568 df-clab 2714 df-cleq 2727 df-clel 2809 df-nfc 2885 df-ne 2933 df-ral 3052 df-rex 3061 df-rmo 3359 df-reu 3360 df-rab 3416 df-v 3461 df-sbc 3766 df-csb 3875 df-dif 3929 df-un 3931 df-in 3933 df-ss 3943 df-nul 4309 df-if 4501 df-pw 4577 df-sn 4602 df-pr 4604 df-op 4608 df-uni 4884 df-iun 4969 df-br 5120 df-opab 5182 df-mpt 5202 df-id 5548 df-xp 5660 df-rel 5661 df-cnv 5662 df-co 5663 df-dm 5664 df-rn 5665 df-res 5666 df-ima 5667 df-iota 6484 df-fun 6533 df-fn 6534 df-f 6535 df-f1 6536 df-fo 6537 df-f1o 6538 df-fv 6539 df-riota 7362 df-ov 7408 df-oprab 7409 df-mpo 7410 df-map 8842 df-proset 18306 df-poset 18325 df-plt 18340 df-lub 18356 df-glb 18357 df-join 18358 df-meet 18359 df-p0 18435 df-p1 18436 df-lat 18442 df-clat 18509 df-oposet 39194 df-ol 39196 df-oml 39197 df-covers 39284 df-ats 39285 df-atl 39316 df-cvlat 39340 df-hlat 39369 df-lhyp 40007 df-laut 40008 df-ldil 40123 df-ltrn 40124 df-trl 40178 |
| This theorem is referenced by: trlator0 40190 trlnidat 40192 trlnle 40205 trlval3 40206 trlval4 40207 cdlemc5 40214 cdlemg17dALTN 40683 cdlemg27a 40711 cdlemg31b0N 40713 cdlemg27b 40715 cdlemg31c 40718 cdlemg35 40732 dia2dimlem1 41083 dia2dimlem2 41084 dia2dimlem3 41085 |
| Copyright terms: Public domain | W3C validator |