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 40228

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 40224	. . . . . . 7 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) → (𝐹 ∘ 𝐺) ∈ 𝑇)
4	3	3expb 1117	. . . . . 6 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇)) → (𝐹 ∘ 𝐺) ∈ 𝑇)
5		eqid 2728	. . . . . . 7 ⊢ (Base‘𝐾) = (Base‘𝐾)
6		eqid 2728	. . . . . . 7 ⊢ (0.‘𝐾) = (0.‘𝐾)
7		trlcoat.r	. . . . . . 7 ⊢ 𝑅 = ((trL‘𝐾)‘𝑊)
8	5, 6, 1, 2, 7	trlid0b 39683	. . . . . 6 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∘ 𝐺) ∈ 𝑇) → ((𝐹 ∘ 𝐺) = ( I ↾ (Base‘𝐾)) ↔ (𝑅‘(𝐹 ∘ 𝐺)) = (0.‘𝐾)))
9	4, 8	syldan 589	. . . . 5 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇)) → ((𝐹 ∘ 𝐺) = ( I ↾ (Base‘𝐾)) ↔ (𝑅‘(𝐹 ∘ 𝐺)) = (0.‘𝐾)))
10		coass 6274	. . . . . . . . . 10 ⊢ ((^◡𝐹 ∘ 𝐹) ∘ 𝐺) = (^◡𝐹 ∘ (𝐹 ∘ 𝐺))
11		simpll 765	. . . . . . . . . . . . 13 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇)) ∧ (𝐹 ∘ 𝐺) = ( I ↾ (Base‘𝐾))) → (𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻))
12		simplrl 775	. . . . . . . . . . . . 13 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇)) ∧ (𝐹 ∘ 𝐺) = ( I ↾ (Base‘𝐾))) → 𝐹 ∈ 𝑇)
13	5, 1, 2	ltrn1o 39629	. . . . . . . . . . . . 13 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇) → 𝐹:(Base‘𝐾)–1-1-onto→(Base‘𝐾))
14	11, 12, 13	syl2anc 582	. . . . . . . . . . . 12 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇)) ∧ (𝐹 ∘ 𝐺) = ( I ↾ (Base‘𝐾))) → 𝐹:(Base‘𝐾)–1-1-onto→(Base‘𝐾))
15		f1ococnv1 6873	. . . . . . . . . . . 12 ⊢ (𝐹:(Base‘𝐾)–1-1-onto→(Base‘𝐾) → (^◡𝐹 ∘ 𝐹) = ( I ↾ (Base‘𝐾)))
16	14, 15	syl 17	. . . . . . . . . . 11 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇)) ∧ (𝐹 ∘ 𝐺) = ( I ↾ (Base‘𝐾))) → (^◡𝐹 ∘ 𝐹) = ( I ↾ (Base‘𝐾)))
17	16	coeq1d 5868	. . . . . . . . . 10 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇)) ∧ (𝐹 ∘ 𝐺) = ( I ↾ (Base‘𝐾))) → ((^◡𝐹 ∘ 𝐹) ∘ 𝐺) = (( I ↾ (Base‘𝐾)) ∘ 𝐺))
18		coeq2 5865	. . . . . . . . . . 11 ⊢ ((𝐹 ∘ 𝐺) = ( I ↾ (Base‘𝐾)) → (^◡𝐹 ∘ (𝐹 ∘ 𝐺)) = (^◡𝐹 ∘ ( I ↾ (Base‘𝐾))))
19	18	adantl 480	. . . . . . . . . 10 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇)) ∧ (𝐹 ∘ 𝐺) = ( I ↾ (Base‘𝐾))) → (^◡𝐹 ∘ (𝐹 ∘ 𝐺)) = (^◡𝐹 ∘ ( I ↾ (Base‘𝐾))))
20	10, 17, 19	3eqtr3a 2792	. . . . . . . . 9 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇)) ∧ (𝐹 ∘ 𝐺) = ( I ↾ (Base‘𝐾))) → (( I ↾ (Base‘𝐾)) ∘ 𝐺) = (^◡𝐹 ∘ ( I ↾ (Base‘𝐾))))
21		simplrr 776	. . . . . . . . . . 11 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇)) ∧ (𝐹 ∘ 𝐺) = ( I ↾ (Base‘𝐾))) → 𝐺 ∈ 𝑇)
22	5, 1, 2	ltrn1o 39629	. . . . . . . . . . 11 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐺 ∈ 𝑇) → 𝐺:(Base‘𝐾)–1-1-onto→(Base‘𝐾))
23	11, 21, 22	syl2anc 582	. . . . . . . . . 10 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇)) ∧ (𝐹 ∘ 𝐺) = ( I ↾ (Base‘𝐾))) → 𝐺:(Base‘𝐾)–1-1-onto→(Base‘𝐾))
24		f1of 6844	. . . . . . . . . 10 ⊢ (𝐺:(Base‘𝐾)–1-1-onto→(Base‘𝐾) → 𝐺:(Base‘𝐾)⟶(Base‘𝐾))
25		fcoi2 6777	. . . . . . . . . 10 ⊢ (𝐺:(Base‘𝐾)⟶(Base‘𝐾) → (( I ↾ (Base‘𝐾)) ∘ 𝐺) = 𝐺)
26	23, 24, 25	3syl 18	. . . . . . . . 9 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇)) ∧ (𝐹 ∘ 𝐺) = ( I ↾ (Base‘𝐾))) → (( I ↾ (Base‘𝐾)) ∘ 𝐺) = 𝐺)
27	1, 2	ltrncnv 39651	. . . . . . . . . . . 12 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇) → ^◡𝐹 ∈ 𝑇)
28	11, 12, 27	syl2anc 582	. . . . . . . . . . 11 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇)) ∧ (𝐹 ∘ 𝐺) = ( I ↾ (Base‘𝐾))) → ^◡𝐹 ∈ 𝑇)
29	5, 1, 2	ltrn1o 39629	. . . . . . . . . . 11 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ^◡𝐹 ∈ 𝑇) → ^◡𝐹:(Base‘𝐾)–1-1-onto→(Base‘𝐾))
30	11, 28, 29	syl2anc 582	. . . . . . . . . 10 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇)) ∧ (𝐹 ∘ 𝐺) = ( I ↾ (Base‘𝐾))) → ^◡𝐹:(Base‘𝐾)–1-1-onto→(Base‘𝐾))
31		f1of 6844	. . . . . . . . . 10 ⊢ (^◡𝐹:(Base‘𝐾)–1-1-onto→(Base‘𝐾) → ^◡𝐹:(Base‘𝐾)⟶(Base‘𝐾))
32		fcoi1 6776	. . . . . . . . . 10 ⊢ (^◡𝐹:(Base‘𝐾)⟶(Base‘𝐾) → (^◡𝐹 ∘ ( I ↾ (Base‘𝐾))) = ^◡𝐹)
33	30, 31, 32	3syl 18	. . . . . . . . 9 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇)) ∧ (𝐹 ∘ 𝐺) = ( I ↾ (Base‘𝐾))) → (^◡𝐹 ∘ ( I ↾ (Base‘𝐾))) = ^◡𝐹)
34	20, 26, 33	3eqtr3d 2776	. . . . . . . 8 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇)) ∧ (𝐹 ∘ 𝐺) = ( I ↾ (Base‘𝐾))) → 𝐺 = ^◡𝐹)
35	34	fveq2d 6906	. . . . . . 7 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇)) ∧ (𝐹 ∘ 𝐺) = ( I ↾ (Base‘𝐾))) → (𝑅‘𝐺) = (𝑅‘^◡𝐹))
36	1, 2, 7	trlcnv 39670	. . . . . . . 8 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇) → (𝑅‘^◡𝐹) = (𝑅‘𝐹))
37	11, 12, 36	syl2anc 582	. . . . . . 7 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇)) ∧ (𝐹 ∘ 𝐺) = ( I ↾ (Base‘𝐾))) → (𝑅‘^◡𝐹) = (𝑅‘𝐹))
38	35, 37	eqtr2d 2769	. . . . . 6 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇)) ∧ (𝐹 ∘ 𝐺) = ( I ↾ (Base‘𝐾))) → (𝑅‘𝐹) = (𝑅‘𝐺))
39	38	ex 411	. . . . 5 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇)) → ((𝐹 ∘ 𝐺) = ( I ↾ (Base‘𝐾)) → (𝑅‘𝐹) = (𝑅‘𝐺)))
40	9, 39	sylbird 259	. . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇)) → ((𝑅‘(𝐹 ∘ 𝐺)) = (0.‘𝐾) → (𝑅‘𝐹) = (𝑅‘𝐺)))
41	40	necon3d 2958	. . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇)) → ((𝑅‘𝐹) ≠ (𝑅‘𝐺) → (𝑅‘(𝐹 ∘ 𝐺)) ≠ (0.‘𝐾)))
42		trlcoat.a	. . . . 5 ⊢ 𝐴 = (Atoms‘𝐾)
43	6, 42, 1, 2, 7	trlatn0 39677	. . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∘ 𝐺) ∈ 𝑇) → ((𝑅‘(𝐹 ∘ 𝐺)) ∈ 𝐴 ↔ (𝑅‘(𝐹 ∘ 𝐺)) ≠ (0.‘𝐾)))
44	4, 43	syldan 589	. . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇)) → ((𝑅‘(𝐹 ∘ 𝐺)) ∈ 𝐴 ↔ (𝑅‘(𝐹 ∘ 𝐺)) ≠ (0.‘𝐾)))
45	41, 44	sylibrd 258	. 2 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇)) → ((𝑅‘𝐹) ≠ (𝑅‘𝐺) → (𝑅‘(𝐹 ∘ 𝐺)) ∈ 𝐴))
46	45	3impia 1114	1 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ (𝑅‘𝐹) ≠ (𝑅‘𝐺)) → (𝑅‘(𝐹 ∘ 𝐺)) ∈ 𝐴)

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 205 ∧ wa 394 ∧ w3a 1084 = wceq 1533 ∈ wcel 2098 ≠ wne 2937 I cid 5579 ^◡ccnv 5681 ↾ cres 5684 ∘ ccom 5686 ⟶wf 6549 –1-1-onto→wf1o 6552 ‘cfv 6553 Basecbs 17187 0.cp0 18422 Atomscatm 38767 HLchlt 38854 LHypclh 39489 LTrncltrn 39606 trLctrl 39663

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 2166 ax-ext 2699 ax-rep 5289 ax-sep 5303 ax-nul 5310 ax-pow 5369 ax-pr 5433 ax-un 7746 ax-riotaBAD 38457

This theorem depends on definitions: df-bi 206 df-an 395 df-or 846 df-3or 1085 df-3an 1086 df-tru 1536 df-fal 1546 df-ex 1774 df-nf 1778 df-sb 2060 df-mo 2529 df-eu 2558 df-clab 2706 df-cleq 2720 df-clel 2806 df-nfc 2881 df-ne 2938 df-ral 3059 df-rex 3068 df-rmo 3374 df-reu 3375 df-rab 3431 df-v 3475 df-sbc 3779 df-csb 3895 df-dif 3952 df-un 3954 df-in 3956 df-ss 3966 df-nul 4327 df-if 4533 df-pw 4608 df-sn 4633 df-pr 4635 df-op 4639 df-uni 4913 df-iun 5002 df-iin 5003 df-br 5153 df-opab 5215 df-mpt 5236 df-id 5580 df-xp 5688 df-rel 5689 df-cnv 5690 df-co 5691 df-dm 5692 df-rn 5693 df-res 5694 df-ima 5695 df-iota 6505 df-fun 6555 df-fn 6556 df-f 6557 df-f1 6558 df-fo 6559 df-f1o 6560 df-fv 6561 df-riota 7382 df-ov 7429 df-oprab 7430 df-mpo 7431 df-1st 7999 df-2nd 8000 df-undef 8285 df-map 8853 df-proset 18294 df-poset 18312 df-plt 18329 df-lub 18345 df-glb 18346 df-join 18347 df-meet 18348 df-p0 18424 df-p1 18425 df-lat 18431 df-clat 18498 df-oposet 38680 df-ol 38682 df-oml 38683 df-covers 38770 df-ats 38771 df-atl 38802 df-cvlat 38826 df-hlat 38855 df-llines 39003 df-lplanes 39004 df-lvols 39005 df-lines 39006 df-psubsp 39008 df-pmap 39009 df-padd 39301 df-lhyp 39493 df-laut 39494 df-ldil 39609 df-ltrn 39610 df-trl 39664

This theorem is referenced by: trlcocnvat 40229 trlconid 40230 trljco 40245 cdlemh2 40321 cdlemh 40322

W3C validator