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 39582

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 39578	. . . . . . 7 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) → (𝐹 ∘ 𝐺) ∈ 𝑇)
4	3	3expb 1120	. . . . . 6 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇)) → (𝐹 ∘ 𝐺) ∈ 𝑇)
5		eqid 2732	. . . . . . 7 ⊢ (Base‘𝐾) = (Base‘𝐾)
6		eqid 2732	. . . . . . 7 ⊢ (0.‘𝐾) = (0.‘𝐾)
7		trlcoat.r	. . . . . . 7 ⊢ 𝑅 = ((trL‘𝐾)‘𝑊)
8	5, 6, 1, 2, 7	trlid0b 39037	. . . . . 6 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∘ 𝐺) ∈ 𝑇) → ((𝐹 ∘ 𝐺) = ( I ↾ (Base‘𝐾)) ↔ (𝑅‘(𝐹 ∘ 𝐺)) = (0.‘𝐾)))
9	4, 8	syldan 591	. . . . 5 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇)) → ((𝐹 ∘ 𝐺) = ( I ↾ (Base‘𝐾)) ↔ (𝑅‘(𝐹 ∘ 𝐺)) = (0.‘𝐾)))
10		coass 6261	. . . . . . . . . 10 ⊢ ((^◡𝐹 ∘ 𝐹) ∘ 𝐺) = (^◡𝐹 ∘ (𝐹 ∘ 𝐺))
11		simpll 765	. . . . . . . . . . . . 13 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇)) ∧ (𝐹 ∘ 𝐺) = ( I ↾ (Base‘𝐾))) → (𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻))
12		simplrl 775	. . . . . . . . . . . . 13 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇)) ∧ (𝐹 ∘ 𝐺) = ( I ↾ (Base‘𝐾))) → 𝐹 ∈ 𝑇)
13	5, 1, 2	ltrn1o 38983	. . . . . . . . . . . . 13 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇) → 𝐹:(Base‘𝐾)–1-1-onto→(Base‘𝐾))
14	11, 12, 13	syl2anc 584	. . . . . . . . . . . 12 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇)) ∧ (𝐹 ∘ 𝐺) = ( I ↾ (Base‘𝐾))) → 𝐹:(Base‘𝐾)–1-1-onto→(Base‘𝐾))
15		f1ococnv1 6859	. . . . . . . . . . . 12 ⊢ (𝐹:(Base‘𝐾)–1-1-onto→(Base‘𝐾) → (^◡𝐹 ∘ 𝐹) = ( I ↾ (Base‘𝐾)))
16	14, 15	syl 17	. . . . . . . . . . 11 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇)) ∧ (𝐹 ∘ 𝐺) = ( I ↾ (Base‘𝐾))) → (^◡𝐹 ∘ 𝐹) = ( I ↾ (Base‘𝐾)))
17	16	coeq1d 5859	. . . . . . . . . 10 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇)) ∧ (𝐹 ∘ 𝐺) = ( I ↾ (Base‘𝐾))) → ((^◡𝐹 ∘ 𝐹) ∘ 𝐺) = (( I ↾ (Base‘𝐾)) ∘ 𝐺))
18		coeq2 5856	. . . . . . . . . . 11 ⊢ ((𝐹 ∘ 𝐺) = ( I ↾ (Base‘𝐾)) → (^◡𝐹 ∘ (𝐹 ∘ 𝐺)) = (^◡𝐹 ∘ ( I ↾ (Base‘𝐾))))
19	18	adantl 482	. . . . . . . . . 10 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇)) ∧ (𝐹 ∘ 𝐺) = ( I ↾ (Base‘𝐾))) → (^◡𝐹 ∘ (𝐹 ∘ 𝐺)) = (^◡𝐹 ∘ ( I ↾ (Base‘𝐾))))
20	10, 17, 19	3eqtr3a 2796	. . . . . . . . 9 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇)) ∧ (𝐹 ∘ 𝐺) = ( I ↾ (Base‘𝐾))) → (( I ↾ (Base‘𝐾)) ∘ 𝐺) = (^◡𝐹 ∘ ( I ↾ (Base‘𝐾))))
21		simplrr 776	. . . . . . . . . . 11 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇)) ∧ (𝐹 ∘ 𝐺) = ( I ↾ (Base‘𝐾))) → 𝐺 ∈ 𝑇)
22	5, 1, 2	ltrn1o 38983	. . . . . . . . . . 11 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐺 ∈ 𝑇) → 𝐺:(Base‘𝐾)–1-1-onto→(Base‘𝐾))
23	11, 21, 22	syl2anc 584	. . . . . . . . . 10 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇)) ∧ (𝐹 ∘ 𝐺) = ( I ↾ (Base‘𝐾))) → 𝐺:(Base‘𝐾)–1-1-onto→(Base‘𝐾))
24		f1of 6830	. . . . . . . . . 10 ⊢ (𝐺:(Base‘𝐾)–1-1-onto→(Base‘𝐾) → 𝐺:(Base‘𝐾)⟶(Base‘𝐾))
25		fcoi2 6763	. . . . . . . . . 10 ⊢ (𝐺:(Base‘𝐾)⟶(Base‘𝐾) → (( I ↾ (Base‘𝐾)) ∘ 𝐺) = 𝐺)
26	23, 24, 25	3syl 18	. . . . . . . . 9 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇)) ∧ (𝐹 ∘ 𝐺) = ( I ↾ (Base‘𝐾))) → (( I ↾ (Base‘𝐾)) ∘ 𝐺) = 𝐺)
27	1, 2	ltrncnv 39005	. . . . . . . . . . . 12 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇) → ^◡𝐹 ∈ 𝑇)
28	11, 12, 27	syl2anc 584	. . . . . . . . . . 11 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇)) ∧ (𝐹 ∘ 𝐺) = ( I ↾ (Base‘𝐾))) → ^◡𝐹 ∈ 𝑇)
29	5, 1, 2	ltrn1o 38983	. . . . . . . . . . 11 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ^◡𝐹 ∈ 𝑇) → ^◡𝐹:(Base‘𝐾)–1-1-onto→(Base‘𝐾))
30	11, 28, 29	syl2anc 584	. . . . . . . . . 10 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇)) ∧ (𝐹 ∘ 𝐺) = ( I ↾ (Base‘𝐾))) → ^◡𝐹:(Base‘𝐾)–1-1-onto→(Base‘𝐾))
31		f1of 6830	. . . . . . . . . 10 ⊢ (^◡𝐹:(Base‘𝐾)–1-1-onto→(Base‘𝐾) → ^◡𝐹:(Base‘𝐾)⟶(Base‘𝐾))
32		fcoi1 6762	. . . . . . . . . 10 ⊢ (^◡𝐹:(Base‘𝐾)⟶(Base‘𝐾) → (^◡𝐹 ∘ ( I ↾ (Base‘𝐾))) = ^◡𝐹)
33	30, 31, 32	3syl 18	. . . . . . . . 9 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇)) ∧ (𝐹 ∘ 𝐺) = ( I ↾ (Base‘𝐾))) → (^◡𝐹 ∘ ( I ↾ (Base‘𝐾))) = ^◡𝐹)
34	20, 26, 33	3eqtr3d 2780	. . . . . . . 8 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇)) ∧ (𝐹 ∘ 𝐺) = ( I ↾ (Base‘𝐾))) → 𝐺 = ^◡𝐹)
35	34	fveq2d 6892	. . . . . . 7 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇)) ∧ (𝐹 ∘ 𝐺) = ( I ↾ (Base‘𝐾))) → (𝑅‘𝐺) = (𝑅‘^◡𝐹))
36	1, 2, 7	trlcnv 39024	. . . . . . . 8 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇) → (𝑅‘^◡𝐹) = (𝑅‘𝐹))
37	11, 12, 36	syl2anc 584	. . . . . . 7 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇)) ∧ (𝐹 ∘ 𝐺) = ( I ↾ (Base‘𝐾))) → (𝑅‘^◡𝐹) = (𝑅‘𝐹))
38	35, 37	eqtr2d 2773	. . . . . 6 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇)) ∧ (𝐹 ∘ 𝐺) = ( I ↾ (Base‘𝐾))) → (𝑅‘𝐹) = (𝑅‘𝐺))
39	38	ex 413	. . . . 5 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇)) → ((𝐹 ∘ 𝐺) = ( I ↾ (Base‘𝐾)) → (𝑅‘𝐹) = (𝑅‘𝐺)))
40	9, 39	sylbird 259	. . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇)) → ((𝑅‘(𝐹 ∘ 𝐺)) = (0.‘𝐾) → (𝑅‘𝐹) = (𝑅‘𝐺)))
41	40	necon3d 2961	. . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇)) → ((𝑅‘𝐹) ≠ (𝑅‘𝐺) → (𝑅‘(𝐹 ∘ 𝐺)) ≠ (0.‘𝐾)))
42		trlcoat.a	. . . . 5 ⊢ 𝐴 = (Atoms‘𝐾)
43	6, 42, 1, 2, 7	trlatn0 39031	. . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∘ 𝐺) ∈ 𝑇) → ((𝑅‘(𝐹 ∘ 𝐺)) ∈ 𝐴 ↔ (𝑅‘(𝐹 ∘ 𝐺)) ≠ (0.‘𝐾)))
44	4, 43	syldan 591	. . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇)) → ((𝑅‘(𝐹 ∘ 𝐺)) ∈ 𝐴 ↔ (𝑅‘(𝐹 ∘ 𝐺)) ≠ (0.‘𝐾)))
45	41, 44	sylibrd 258	. 2 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇)) → ((𝑅‘𝐹) ≠ (𝑅‘𝐺) → (𝑅‘(𝐹 ∘ 𝐺)) ∈ 𝐴))
46	45	3impia 1117	1 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ (𝑅‘𝐹) ≠ (𝑅‘𝐺)) → (𝑅‘(𝐹 ∘ 𝐺)) ∈ 𝐴)

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 205 ∧ wa 396 ∧ w3a 1087 = wceq 1541 ∈ wcel 2106 ≠ wne 2940 I cid 5572 ^◡ccnv 5674 ↾ cres 5677 ∘ ccom 5679 ⟶wf 6536 –1-1-onto→wf1o 6539 ‘cfv 6540 Basecbs 17140 0.cp0 18372 Atomscatm 38121 HLchlt 38208 LHypclh 38843 LTrncltrn 38960 trLctrl 39017

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2703 ax-rep 5284 ax-sep 5298 ax-nul 5305 ax-pow 5362 ax-pr 5426 ax-un 7721 ax-riotaBAD 37811

This theorem depends on definitions: df-bi 206 df-an 397 df-or 846 df-3or 1088 df-3an 1089 df-tru 1544 df-fal 1554 df-ex 1782 df-nf 1786 df-sb 2068 df-mo 2534 df-eu 2563 df-clab 2710 df-cleq 2724 df-clel 2810 df-nfc 2885 df-ne 2941 df-ral 3062 df-rex 3071 df-rmo 3376 df-reu 3377 df-rab 3433 df-v 3476 df-sbc 3777 df-csb 3893 df-dif 3950 df-un 3952 df-in 3954 df-ss 3964 df-nul 4322 df-if 4528 df-pw 4603 df-sn 4628 df-pr 4630 df-op 4634 df-uni 4908 df-iun 4998 df-iin 4999 df-br 5148 df-opab 5210 df-mpt 5231 df-id 5573 df-xp 5681 df-rel 5682 df-cnv 5683 df-co 5684 df-dm 5685 df-rn 5686 df-res 5687 df-ima 5688 df-iota 6492 df-fun 6542 df-fn 6543 df-f 6544 df-f1 6545 df-fo 6546 df-f1o 6547 df-fv 6548 df-riota 7361 df-ov 7408 df-oprab 7409 df-mpo 7410 df-1st 7971 df-2nd 7972 df-undef 8254 df-map 8818 df-proset 18244 df-poset 18262 df-plt 18279 df-lub 18295 df-glb 18296 df-join 18297 df-meet 18298 df-p0 18374 df-p1 18375 df-lat 18381 df-clat 18448 df-oposet 38034 df-ol 38036 df-oml 38037 df-covers 38124 df-ats 38125 df-atl 38156 df-cvlat 38180 df-hlat 38209 df-llines 38357 df-lplanes 38358 df-lvols 38359 df-lines 38360 df-psubsp 38362 df-pmap 38363 df-padd 38655 df-lhyp 38847 df-laut 38848 df-ldil 38963 df-ltrn 38964 df-trl 39018

This theorem is referenced by: trlcocnvat 39583 trlconid 39584 trljco 39599 cdlemh2 39675 cdlemh 39676

W3C validator