| 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 2765 | . . 3 ⊢ (Atoms‘𝐾) = (Atoms‘𝐾) | |
| 2 | trlconid.h | . . 3 ⊢ 𝐻 = (LHyp‘𝐾) | |
| 3 | trlconid.t | . . 3 ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊) | |
| 4 | trlconid.r | . . 3 ⊢ 𝑅 = ((trL‘𝐾)‘𝑊) | |
| 5 | 1, 2, 3, 4 | trlcoat 41530 | . 2 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ (𝑅‘𝐹) ≠ (𝑅‘𝐺)) → (𝑅‘(𝐹 ∘ 𝐺)) ∈ (Atoms‘𝐾)) |
| 6 | simp1 1154 | . . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ (𝑅‘𝐹) ≠ (𝑅‘𝐺)) → (𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻)) | |
| 7 | simp2l 1218 | . . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ (𝑅‘𝐹) ≠ (𝑅‘𝐺)) → 𝐹 ∈ 𝑇) | |
| 8 | simp2r 1219 | . . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ (𝑅‘𝐹) ≠ (𝑅‘𝐺)) → 𝐺 ∈ 𝑇) | |
| 9 | 2, 3 | ltrnco 41526 | . . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) → (𝐹 ∘ 𝐺) ∈ 𝑇) |
| 10 | 6, 7, 8, 9 | syl3anc 1398 | . . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ (𝑅‘𝐹) ≠ (𝑅‘𝐺)) → (𝐹 ∘ 𝐺) ∈ 𝑇) |
| 11 | trlconid.b | . . . 4 ⊢ 𝐵 = (Base‘𝐾) | |
| 12 | 11, 1, 2, 3, 4 | trlnidatb 40984 | . . 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 2146 ≠ wne 2960 I cid 5557 ↾ cres 5665 ∘ ccom 5667 ‘cfv 6540 Basecbs 17287 Atomscatm 40070 HLchlt 40157 LHypclh 40791 LTrncltrn 40908 trLctrl 40965 |
| 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 2737 ax-rep 5240 ax-sep 5259 ax-nul 5271 ax-pow 5338 ax-pr 5406 ax-un 7738 ax-riotaBAD 39760 |
| 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 2569 df-eu 2599 df-clab 2744 df-cleq 2757 df-clel 2840 df-nfc 2914 df-ne 2961 df-ral 3082 df-rex 3092 df-rmo 3371 df-reu 3372 df-rab 3419 df-v 3459 df-sbc 3747 df-csb 3855 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-nul 4287 df-if 4490 df-pw 4566 df-sn 4592 df-pr 4594 df-op 4598 df-uni 4875 df-iun 4960 df-iin 4961 df-br 5112 df-opab 5176 df-mpt 5195 df-id 5558 df-xp 5669 df-rel 5670 df-cnv 5671 df-co 5672 df-dm 5673 df-rn 5674 df-res 5675 df-ima 5676 df-iota 6496 df-fun 6542 df-fn 6543 df-f 6544 df-f1 6545 df-fo 6546 df-f1o 6547 df-fv 6548 df-riota 7373 df-ov 7419 df-oprab 7420 df-mpo 7421 df-1st 7988 df-2nd 7989 df-undef 8271 df-map 8828 df-proset 18368 df-poset 18387 df-plt 18402 df-lub 18418 df-glb 18419 df-join 18420 df-meet 18421 df-p0 18497 df-p1 18498 df-lat 18506 df-clat 18573 df-oposet 39983 df-ol 39985 df-oml 39986 df-covers 40073 df-ats 40074 df-atl 40105 df-cvlat 40129 df-hlat 40158 df-llines 40305 df-lplanes 40306 df-lvols 40307 df-lines 40308 df-psubsp 40310 df-pmap 40311 df-padd 40603 df-lhyp 40795 df-laut 40796 df-ldil 40911 df-ltrn 40912 df-trl 40966 |
| This theorem is used by: cdlemk47 41756 cdlemk52 41761 cdlemk53a 41762 |
| Copyright terms: Public domain | W3C validator |