![]() |
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 1129 | . . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝐹 ∈ 𝑇 ∧ (𝐹‘𝑃) ≠ 𝑃)) → (𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻)) | |
2 | simp3l 1242 | . . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝐹 ∈ 𝑇 ∧ (𝐹‘𝑃) ≠ 𝑃)) → 𝐹 ∈ 𝑇) | |
3 | simp2 1130 | . . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝐹 ∈ 𝑇 ∧ (𝐹‘𝑃) ≠ 𝑃)) → (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) | |
4 | trlat.l | . . . 4 ⊢ ≤ = (le‘𝐾) | |
5 | eqid 2770 | . . . 4 ⊢ (join‘𝐾) = (join‘𝐾) | |
6 | eqid 2770 | . . . 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 35965 | . . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → (𝑅‘𝐹) = ((𝑃(join‘𝐾)(𝐹‘𝑃))(meet‘𝐾)𝑊)) |
12 | 1, 2, 3, 11 | syl3anc 1475 | . 2 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝐹 ∈ 𝑇 ∧ (𝐹‘𝑃) ≠ 𝑃)) → (𝑅‘𝐹) = ((𝑃(join‘𝐾)(𝐹‘𝑃))(meet‘𝐾)𝑊)) |
13 | simp2l 1240 | . . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝐹 ∈ 𝑇 ∧ (𝐹‘𝑃) ≠ 𝑃)) → 𝑃 ∈ 𝐴) | |
14 | 4, 7, 8, 9 | ltrnat 35941 | . . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ 𝑃 ∈ 𝐴) → (𝐹‘𝑃) ∈ 𝐴) |
15 | 1, 2, 13, 14 | syl3anc 1475 | . . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝐹 ∈ 𝑇 ∧ (𝐹‘𝑃) ≠ 𝑃)) → (𝐹‘𝑃) ∈ 𝐴) |
16 | simp3r 1243 | . . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝐹 ∈ 𝑇 ∧ (𝐹‘𝑃) ≠ 𝑃)) → (𝐹‘𝑃) ≠ 𝑃) | |
17 | 16 | necomd 2997 | . . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝐹 ∈ 𝑇 ∧ (𝐹‘𝑃) ≠ 𝑃)) → 𝑃 ≠ (𝐹‘𝑃)) |
18 | 4, 5, 6, 7, 8 | lhpat 35844 | . . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ ((𝐹‘𝑃) ∈ 𝐴 ∧ 𝑃 ≠ (𝐹‘𝑃))) → ((𝑃(join‘𝐾)(𝐹‘𝑃))(meet‘𝐾)𝑊) ∈ 𝐴) |
19 | 1, 3, 15, 17, 18 | syl112anc 1479 | . 2 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝐹 ∈ 𝑇 ∧ (𝐹‘𝑃) ≠ 𝑃)) → ((𝑃(join‘𝐾)(𝐹‘𝑃))(meet‘𝐾)𝑊) ∈ 𝐴) |
20 | 12, 19 | eqeltrd 2849 | 1 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝐹 ∈ 𝑇 ∧ (𝐹‘𝑃) ≠ 𝑃)) → (𝑅‘𝐹) ∈ 𝐴) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ∧ wa 382 ∧ w3a 1070 = wceq 1630 ∈ wcel 2144 ≠ wne 2942 class class class wbr 4784 ‘cfv 6031 (class class class)co 6792 lecple 16155 joincjn 17151 meetcmee 17152 Atomscatm 35065 HLchlt 35152 LHypclh 35785 LTrncltrn 35902 trLctrl 35960 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1869 ax-4 1884 ax-5 1990 ax-6 2056 ax-7 2092 ax-8 2146 ax-9 2153 ax-10 2173 ax-11 2189 ax-12 2202 ax-13 2407 ax-ext 2750 ax-rep 4902 ax-sep 4912 ax-nul 4920 ax-pow 4971 ax-pr 5034 ax-un 7095 |
This theorem depends on definitions: df-bi 197 df-an 383 df-or 827 df-3an 1072 df-tru 1633 df-ex 1852 df-nf 1857 df-sb 2049 df-eu 2621 df-mo 2622 df-clab 2757 df-cleq 2763 df-clel 2766 df-nfc 2901 df-ne 2943 df-ral 3065 df-rex 3066 df-reu 3067 df-rab 3069 df-v 3351 df-sbc 3586 df-csb 3681 df-dif 3724 df-un 3726 df-in 3728 df-ss 3735 df-nul 4062 df-if 4224 df-pw 4297 df-sn 4315 df-pr 4317 df-op 4321 df-uni 4573 df-iun 4654 df-br 4785 df-opab 4845 df-mpt 4862 df-id 5157 df-xp 5255 df-rel 5256 df-cnv 5257 df-co 5258 df-dm 5259 df-rn 5260 df-res 5261 df-ima 5262 df-iota 5994 df-fun 6033 df-fn 6034 df-f 6035 df-f1 6036 df-fo 6037 df-f1o 6038 df-fv 6039 df-riota 6753 df-ov 6795 df-oprab 6796 df-mpt2 6797 df-map 8010 df-preset 17135 df-poset 17153 df-plt 17165 df-lub 17181 df-glb 17182 df-join 17183 df-meet 17184 df-p0 17246 df-p1 17247 df-lat 17253 df-clat 17315 df-oposet 34978 df-ol 34980 df-oml 34981 df-covers 35068 df-ats 35069 df-atl 35100 df-cvlat 35124 df-hlat 35153 df-lhyp 35789 df-laut 35790 df-ldil 35905 df-ltrn 35906 df-trl 35961 |
This theorem is referenced by: trlator0 35973 trlnidat 35975 trlnle 35988 trlval3 35989 trlval4 35990 cdlemc5 35997 cdlemg17dALTN 36466 cdlemg27a 36494 cdlemg31b0N 36496 cdlemg27b 36498 cdlemg31c 36501 cdlemg35 36515 dia2dimlem1 36867 dia2dimlem2 36868 dia2dimlem3 36869 |
Copyright terms: Public domain | W3C validator |