| Mathbox for Norm Megill |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > trlconid | Structured version Visualization version GIF version | ||
| Description: The composition of two different translations is not the identity translation. (Contributed by NM, 22-Jul-2013.) |
| Ref | Expression |
|---|---|
| trlconid.b | ⊢ 𝐵 = (Base‘𝐾) |
| trlconid.h | ⊢ 𝐻 = (LHyp‘𝐾) |
| trlconid.t | ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊) |
| trlconid.r | ⊢ 𝑅 = ((trL‘𝐾)‘𝑊) |
| Ref | Expression |
|---|---|
| trlconid | ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ (𝑅‘𝐹) ≠ (𝑅‘𝐺)) → (𝐹 ∘ 𝐺) ≠ ( I ↾ 𝐵)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eqid 2760 | . . 3 ⊢ (Atoms‘𝐾) = (Atoms‘𝐾) | |
| 2 | trlconid.h | . . 3 ⊢ 𝐻 = (LHyp‘𝐾) | |
| 3 | trlconid.t | . . 3 ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊) | |
| 4 | trlconid.r | . . 3 ⊢ 𝑅 = ((trL‘𝐾)‘𝑊) | |
| 5 | 1, 2, 3, 4 | trlcoat 41596 | . 2 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ (𝑅‘𝐹) ≠ (𝑅‘𝐺)) → (𝑅‘(𝐹 ∘ 𝐺)) ∈ (Atoms‘𝐾)) |
| 6 | simp1 1154 | . . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ (𝑅‘𝐹) ≠ (𝑅‘𝐺)) → (𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻)) | |
| 7 | simp2l 1218 | . . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ (𝑅‘𝐹) ≠ (𝑅‘𝐺)) → 𝐹 ∈ 𝑇) | |
| 8 | simp2r 1219 | . . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ (𝑅‘𝐹) ≠ (𝑅‘𝐺)) → 𝐺 ∈ 𝑇) | |
| 9 | 2, 3 | ltrnco 41592 | . . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) → (𝐹 ∘ 𝐺) ∈ 𝑇) |
| 10 | 6, 7, 8, 9 | syl3anc 1398 | . . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ (𝑅‘𝐹) ≠ (𝑅‘𝐺)) → (𝐹 ∘ 𝐺) ∈ 𝑇) |
| 11 | trlconid.b | . . . 4 ⊢ 𝐵 = (Base‘𝐾) | |
| 12 | 11, 1, 2, 3, 4 | trlnidatb 41050 | . . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∘ 𝐺) ∈ 𝑇) → ((𝐹 ∘ 𝐺) ≠ ( I ↾ 𝐵) ↔ (𝑅‘(𝐹 ∘ 𝐺)) ∈ (Atoms‘𝐾))) |
| 13 | 6, 10, 12 | syl2anc 596 | . 2 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ (𝑅‘𝐹) ≠ (𝑅‘𝐺)) → ((𝐹 ∘ 𝐺) ≠ ( I ↾ 𝐵) ↔ (𝑅‘(𝐹 ∘ 𝐺)) ∈ (Atoms‘𝐾))) |
| 14 | 5, 13 | mpbird 260 | 1 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ (𝑅‘𝐹) ≠ (𝑅‘𝐺)) → (𝐹 ∘ 𝐺) ≠ ( I ↾ 𝐵)) |
| 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 2955 I cid 5549 ↾ cres 5657 ∘ ccom 5659 ‘cfv 6533 Basecbs 17301 Atomscatm 40136 HLchlt 40223 LHypclh 40857 LTrncltrn 40974 trLctrl 41031 |
| 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 2213 ax-ext 2732 ax-rep 5232 ax-sep 5251 ax-nul 5263 ax-pow 5330 ax-pr 5398 ax-un 7736 ax-riotaBAD 39826 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-ral 3077 df-rex 3087 df-rmo 3365 df-reu 3366 df-rab 3413 df-v 3452 df-sbc 3740 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-iun 4953 df-iin 4954 df-br 5104 df-opab 5168 df-mpt 5187 df-id 5550 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-rn 5666 df-res 5667 df-ima 5668 df-iota 6489 df-fun 6535 df-fn 6536 df-f 6537 df-f1 6538 df-fo 6539 df-f1o 6540 df-fv 6541 df-riota 7370 df-ov 7416 df-oprab 7417 df-mpo 7418 df-1st 7986 df-2nd 7987 df-undef 8271 df-map 8828 df-proset 18382 df-poset 18401 df-plt 18416 df-lub 18432 df-glb 18433 df-join 18434 df-meet 18435 df-p0 18511 df-p1 18512 df-lat 18520 df-clat 18587 df-oposet 40049 df-ol 40051 df-oml 40052 df-covers 40139 df-ats 40140 df-atl 40171 df-cvlat 40195 df-hlat 40224 df-llines 40371 df-lplanes 40372 df-lvols 40373 df-lines 40374 df-psubsp 40376 df-pmap 40377 df-padd 40669 df-lhyp 40861 df-laut 40862 df-ldil 40977 df-ltrn 40978 df-trl 41032 |
| This theorem is used by: cdlemk47 41822 cdlemk52 41827 cdlemk53a 41828 |
| Copyright terms: Public domain | W3C validator |