trlcoat - Mathbox for Norm Megill

	Mathbox for Norm Megill		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > Mathboxes > trlcoat		Structured version Visualization version GIF version

Theorem trlcoat 40106

Description: The trace of a composition of two translations is an atom if their traces are different. (Contributed by NM, 15-Jun-2013.)

**Hypotheses**
Ref	Expression
trlcoat.a	⊢ 𝐴 = (Atoms‘𝐾)
trlcoat.h	⊢ 𝐻 = (LHyp‘𝐾)
trlcoat.t	⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊)
trlcoat.r	⊢ 𝑅 = ((trL‘𝐾)‘𝑊)

**Assertion**
Ref	Expression
trlcoat	⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ (𝑅‘𝐹) ≠ (𝑅‘𝐺)) → (𝑅‘(𝐹 ∘ 𝐺)) ∈ 𝐴)

**Proof of Theorem trlcoat**
Step	Hyp	Ref	Expression
1		trlcoat.h	. . . . . . . 8 ⊢ 𝐻 = (LHyp‘𝐾)
2		trlcoat.t	. . . . . . . 8 ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊)
3	1, 2	ltrnco 40102	. . . . . . 7 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) → (𝐹 ∘ 𝐺) ∈ 𝑇)
4	3	3expb 1117	. . . . . 6 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇)) → (𝐹 ∘ 𝐺) ∈ 𝑇)
5		eqid 2726	. . . . . . 7 ⊢ (Base‘𝐾) = (Base‘𝐾)
6		eqid 2726	. . . . . . 7 ⊢ (0.‘𝐾) = (0.‘𝐾)
7		trlcoat.r	. . . . . . 7 ⊢ 𝑅 = ((trL‘𝐾)‘𝑊)
8	5, 6, 1, 2, 7	trlid0b 39561	. . . . . 6 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∘ 𝐺) ∈ 𝑇) → ((𝐹 ∘ 𝐺) = ( I ↾ (Base‘𝐾)) ↔ (𝑅‘(𝐹 ∘ 𝐺)) = (0.‘𝐾)))
9	4, 8	syldan 590	. . . . 5 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇)) → ((𝐹 ∘ 𝐺) = ( I ↾ (Base‘𝐾)) ↔ (𝑅‘(𝐹 ∘ 𝐺)) = (0.‘𝐾)))
10		coass 6257	. . . . . . . . . 10 ⊢ ((^◡𝐹 ∘ 𝐹) ∘ 𝐺) = (^◡𝐹 ∘ (𝐹 ∘ 𝐺))
11		simpll 764	. . . . . . . . . . . . 13 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇)) ∧ (𝐹 ∘ 𝐺) = ( I ↾ (Base‘𝐾))) → (𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻))
12		simplrl 774	. . . . . . . . . . . . 13 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇)) ∧ (𝐹 ∘ 𝐺) = ( I ↾ (Base‘𝐾))) → 𝐹 ∈ 𝑇)
13	5, 1, 2	ltrn1o 39507	. . . . . . . . . . . . 13 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇) → 𝐹:(Base‘𝐾)–1-1-onto→(Base‘𝐾))
14	11, 12, 13	syl2anc 583	. . . . . . . . . . . 12 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇)) ∧ (𝐹 ∘ 𝐺) = ( I ↾ (Base‘𝐾))) → 𝐹:(Base‘𝐾)–1-1-onto→(Base‘𝐾))
15		f1ococnv1 6855	. . . . . . . . . . . 12 ⊢ (𝐹:(Base‘𝐾)–1-1-onto→(Base‘𝐾) → (^◡𝐹 ∘ 𝐹) = ( I ↾ (Base‘𝐾)))
16	14, 15	syl 17	. . . . . . . . . . 11 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇)) ∧ (𝐹 ∘ 𝐺) = ( I ↾ (Base‘𝐾))) → (^◡𝐹 ∘ 𝐹) = ( I ↾ (Base‘𝐾)))
17	16	coeq1d 5854	. . . . . . . . . 10 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇)) ∧ (𝐹 ∘ 𝐺) = ( I ↾ (Base‘𝐾))) → ((^◡𝐹 ∘ 𝐹) ∘ 𝐺) = (( I ↾ (Base‘𝐾)) ∘ 𝐺))
18		coeq2 5851	. . . . . . . . . . 11 ⊢ ((𝐹 ∘ 𝐺) = ( I ↾ (Base‘𝐾)) → (^◡𝐹 ∘ (𝐹 ∘ 𝐺)) = (^◡𝐹 ∘ ( I ↾ (Base‘𝐾))))
19	18	adantl 481	. . . . . . . . . 10 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇)) ∧ (𝐹 ∘ 𝐺) = ( I ↾ (Base‘𝐾))) → (^◡𝐹 ∘ (𝐹 ∘ 𝐺)) = (^◡𝐹 ∘ ( I ↾ (Base‘𝐾))))
20	10, 17, 19	3eqtr3a 2790	. . . . . . . . 9 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇)) ∧ (𝐹 ∘ 𝐺) = ( I ↾ (Base‘𝐾))) → (( I ↾ (Base‘𝐾)) ∘ 𝐺) = (^◡𝐹 ∘ ( I ↾ (Base‘𝐾))))
21		simplrr 775	. . . . . . . . . . 11 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇)) ∧ (𝐹 ∘ 𝐺) = ( I ↾ (Base‘𝐾))) → 𝐺 ∈ 𝑇)
22	5, 1, 2	ltrn1o 39507	. . . . . . . . . . 11 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐺 ∈ 𝑇) → 𝐺:(Base‘𝐾)–1-1-onto→(Base‘𝐾))
23	11, 21, 22	syl2anc 583	. . . . . . . . . 10 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇)) ∧ (𝐹 ∘ 𝐺) = ( I ↾ (Base‘𝐾))) → 𝐺:(Base‘𝐾)–1-1-onto→(Base‘𝐾))
24		f1of 6826	. . . . . . . . . 10 ⊢ (𝐺:(Base‘𝐾)–1-1-onto→(Base‘𝐾) → 𝐺:(Base‘𝐾)⟶(Base‘𝐾))
25		fcoi2 6759	. . . . . . . . . 10 ⊢ (𝐺:(Base‘𝐾)⟶(Base‘𝐾) → (( I ↾ (Base‘𝐾)) ∘ 𝐺) = 𝐺)
26	23, 24, 25	3syl 18	. . . . . . . . 9 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇)) ∧ (𝐹 ∘ 𝐺) = ( I ↾ (Base‘𝐾))) → (( I ↾ (Base‘𝐾)) ∘ 𝐺) = 𝐺)
27	1, 2	ltrncnv 39529	. . . . . . . . . . . 12 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇) → ^◡𝐹 ∈ 𝑇)
28	11, 12, 27	syl2anc 583	. . . . . . . . . . 11 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇)) ∧ (𝐹 ∘ 𝐺) = ( I ↾ (Base‘𝐾))) → ^◡𝐹 ∈ 𝑇)
29	5, 1, 2	ltrn1o 39507	. . . . . . . . . . 11 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ^◡𝐹 ∈ 𝑇) → ^◡𝐹:(Base‘𝐾)–1-1-onto→(Base‘𝐾))
30	11, 28, 29	syl2anc 583	. . . . . . . . . 10 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇)) ∧ (𝐹 ∘ 𝐺) = ( I ↾ (Base‘𝐾))) → ^◡𝐹:(Base‘𝐾)–1-1-onto→(Base‘𝐾))
31		f1of 6826	. . . . . . . . . 10 ⊢ (^◡𝐹:(Base‘𝐾)–1-1-onto→(Base‘𝐾) → ^◡𝐹:(Base‘𝐾)⟶(Base‘𝐾))
32		fcoi1 6758	. . . . . . . . . 10 ⊢ (^◡𝐹:(Base‘𝐾)⟶(Base‘𝐾) → (^◡𝐹 ∘ ( I ↾ (Base‘𝐾))) = ^◡𝐹)
33	30, 31, 32	3syl 18	. . . . . . . . 9 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇)) ∧ (𝐹 ∘ 𝐺) = ( I ↾ (Base‘𝐾))) → (^◡𝐹 ∘ ( I ↾ (Base‘𝐾))) = ^◡𝐹)
34	20, 26, 33	3eqtr3d 2774	. . . . . . . 8 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇)) ∧ (𝐹 ∘ 𝐺) = ( I ↾ (Base‘𝐾))) → 𝐺 = ^◡𝐹)
35	34	fveq2d 6888	. . . . . . 7 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇)) ∧ (𝐹 ∘ 𝐺) = ( I ↾ (Base‘𝐾))) → (𝑅‘𝐺) = (𝑅‘^◡𝐹))
36	1, 2, 7	trlcnv 39548	. . . . . . . 8 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇) → (𝑅‘^◡𝐹) = (𝑅‘𝐹))
37	11, 12, 36	syl2anc 583	. . . . . . 7 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇)) ∧ (𝐹 ∘ 𝐺) = ( I ↾ (Base‘𝐾))) → (𝑅‘^◡𝐹) = (𝑅‘𝐹))
38	35, 37	eqtr2d 2767	. . . . . 6 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇)) ∧ (𝐹 ∘ 𝐺) = ( I ↾ (Base‘𝐾))) → (𝑅‘𝐹) = (𝑅‘𝐺))
39	38	ex 412	. . . . 5 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇)) → ((𝐹 ∘ 𝐺) = ( I ↾ (Base‘𝐾)) → (𝑅‘𝐹) = (𝑅‘𝐺)))
40	9, 39	sylbird 260	. . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇)) → ((𝑅‘(𝐹 ∘ 𝐺)) = (0.‘𝐾) → (𝑅‘𝐹) = (𝑅‘𝐺)))
41	40	necon3d 2955	. . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇)) → ((𝑅‘𝐹) ≠ (𝑅‘𝐺) → (𝑅‘(𝐹 ∘ 𝐺)) ≠ (0.‘𝐾)))
42		trlcoat.a	. . . . 5 ⊢ 𝐴 = (Atoms‘𝐾)
43	6, 42, 1, 2, 7	trlatn0 39555	. . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∘ 𝐺) ∈ 𝑇) → ((𝑅‘(𝐹 ∘ 𝐺)) ∈ 𝐴 ↔ (𝑅‘(𝐹 ∘ 𝐺)) ≠ (0.‘𝐾)))
44	4, 43	syldan 590	. . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇)) → ((𝑅‘(𝐹 ∘ 𝐺)) ∈ 𝐴 ↔ (𝑅‘(𝐹 ∘ 𝐺)) ≠ (0.‘𝐾)))
45	41, 44	sylibrd 259	. 2 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇)) → ((𝑅‘𝐹) ≠ (𝑅‘𝐺) → (𝑅‘(𝐹 ∘ 𝐺)) ∈ 𝐴))
46	45	3impia 1114	1 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ (𝑅‘𝐹) ≠ (𝑅‘𝐺)) → (𝑅‘(𝐹 ∘ 𝐺)) ∈ 𝐴)

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 205 ∧ wa 395 ∧ w3a 1084 = wceq 1533 ∈ wcel 2098 ≠ wne 2934 I cid 5566 ^◡ccnv 5668 ↾ cres 5671 ∘ ccom 5673 ⟶wf 6532 –1-1-onto→wf1o 6535 ‘cfv 6536 Basecbs 17150 0.cp0 18385 Atomscatm 38645 HLchlt 38732 LHypclh 39367 LTrncltrn 39484 trLctrl 39541

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1789 ax-4 1803 ax-5 1905 ax-6 1963 ax-7 2003 ax-8 2100 ax-9 2108 ax-10 2129 ax-11 2146 ax-12 2163 ax-ext 2697 ax-rep 5278 ax-sep 5292 ax-nul 5299 ax-pow 5356 ax-pr 5420 ax-un 7721 ax-riotaBAD 38335

This theorem depends on definitions: df-bi 206 df-an 396 df-or 845 df-3or 1085 df-3an 1086 df-tru 1536 df-fal 1546 df-ex 1774 df-nf 1778 df-sb 2060 df-mo 2528 df-eu 2557 df-clab 2704 df-cleq 2718 df-clel 2804 df-nfc 2879 df-ne 2935 df-ral 3056 df-rex 3065 df-rmo 3370 df-reu 3371 df-rab 3427 df-v 3470 df-sbc 3773 df-csb 3889 df-dif 3946 df-un 3948 df-in 3950 df-ss 3960 df-nul 4318 df-if 4524 df-pw 4599 df-sn 4624 df-pr 4626 df-op 4630 df-uni 4903 df-iun 4992 df-iin 4993 df-br 5142 df-opab 5204 df-mpt 5225 df-id 5567 df-xp 5675 df-rel 5676 df-cnv 5677 df-co 5678 df-dm 5679 df-rn 5680 df-res 5681 df-ima 5682 df-iota 6488 df-fun 6538 df-fn 6539 df-f 6540 df-f1 6541 df-fo 6542 df-f1o 6543 df-fv 6544 df-riota 7360 df-ov 7407 df-oprab 7408 df-mpo 7409 df-1st 7971 df-2nd 7972 df-undef 8256 df-map 8821 df-proset 18257 df-poset 18275 df-plt 18292 df-lub 18308 df-glb 18309 df-join 18310 df-meet 18311 df-p0 18387 df-p1 18388 df-lat 18394 df-clat 18461 df-oposet 38558 df-ol 38560 df-oml 38561 df-covers 38648 df-ats 38649 df-atl 38680 df-cvlat 38704 df-hlat 38733 df-llines 38881 df-lplanes 38882 df-lvols 38883 df-lines 38884 df-psubsp 38886 df-pmap 38887 df-padd 39179 df-lhyp 39371 df-laut 39372 df-ldil 39487 df-ltrn 39488 df-trl 39542

This theorem is referenced by: trlcocnvat 40107 trlconid 40108 trljco 40123 cdlemh2 40199 cdlemh 40200

W3C validator