Theorem cdlemk 40918

Description: Lemma K of [Crawley] p. 118. Final result, lines 11 and 12 on p. 120: given two translations f and k with the same trace, there exists a trace-preserving endomorphism tau whose value at f is k. We use 𝐹, 𝑁, and 𝑢 to represent f, k, and tau. (Contributed by NM, 1-Aug-2013.)

Hypotheses

Ref	Expression
cdlemk7.h	⊢ 𝐻 = (LHyp‘𝐾)
cdlemk7.t	⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊)
cdlemk7.r	⊢ 𝑅 = ((trL‘𝐾)‘𝑊)
cdlemk7.e	⊢ 𝐸 = ((TEndo‘𝐾)‘𝑊)

Assertion

Ref	Expression
cdlemk	⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝑁 ∈ 𝑇) ∧ (𝑅‘𝐹) = (𝑅‘𝑁)) → ∃𝑢 ∈ 𝐸 (𝑢‘𝐹) = 𝑁)

Distinct variable groups:   𝑢,𝐸   𝑢,𝐹   𝑢,𝐾   𝑢,𝑁   𝑢,𝑅   𝑢,𝑇   𝑢,𝑊

Allowed substitution hint:   𝐻(𝑢)

Proof of Theorem cdlemk

Dummy variables 𝑓 𝑏 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		eqid 2733	. . 3 ⊢ (Base‘𝐾) = (Base‘𝐾)
2		eqid 2733	. . 3 ⊢ (join‘𝐾) = (join‘𝐾)
3		eqid 2733	. . 3 ⊢ (meet‘𝐾) = (meet‘𝐾)
4		eqid 2733	. . 3 ⊢ (oc‘𝐾) = (oc‘𝐾)
5		eqid 2733	. . 3 ⊢ (Atoms‘𝐾) = (Atoms‘𝐾)
6		cdlemk7.h	. . 3 ⊢ 𝐻 = (LHyp‘𝐾)
7		cdlemk7.t	. . 3 ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊)
8		cdlemk7.r	. . 3 ⊢ 𝑅 = ((trL‘𝐾)‘𝑊)
9		eqid 2733	. . 3 ⊢ ((oc‘𝐾)‘𝑊) = ((oc‘𝐾)‘𝑊)
10		eqid 2733	. . 3 ⊢ ((((oc‘𝐾)‘𝑊)(join‘𝐾)(𝑅‘𝑏))(meet‘𝐾)((𝑁‘((oc‘𝐾)‘𝑊))(join‘𝐾)(𝑅‘(𝑏 ∘ ◡𝐹)))) = ((((oc‘𝐾)‘𝑊)(join‘𝐾)(𝑅‘𝑏))(meet‘𝐾)((𝑁‘((oc‘𝐾)‘𝑊))(join‘𝐾)(𝑅‘(𝑏 ∘ ◡𝐹))))
11		eqid 2733	. . 3 ⊢ ((((oc‘𝐾)‘𝑊)(join‘𝐾)(𝑅‘𝑓))(meet‘𝐾)(((((oc‘𝐾)‘𝑊)(join‘𝐾)(𝑅‘𝑏))(meet‘𝐾)((𝑁‘((oc‘𝐾)‘𝑊))(join‘𝐾)(𝑅‘(𝑏 ∘ ◡𝐹))))(join‘𝐾)(𝑅‘(𝑓 ∘ ◡𝑏)))) = ((((oc‘𝐾)‘𝑊)(join‘𝐾)(𝑅‘𝑓))(meet‘𝐾)(((((oc‘𝐾)‘𝑊)(join‘𝐾)(𝑅‘𝑏))(meet‘𝐾)((𝑁‘((oc‘𝐾)‘𝑊))(join‘𝐾)(𝑅‘(𝑏 ∘ ◡𝐹))))(join‘𝐾)(𝑅‘(𝑓 ∘ ◡𝑏))))
12		eqid 2733	. . 3 ⊢ (℩𝑧 ∈ 𝑇 ∀𝑏 ∈ 𝑇 ((𝑏 ≠ ( I ↾ (Base‘𝐾)) ∧ (𝑅‘𝑏) ≠ (𝑅‘𝐹) ∧ (𝑅‘𝑏) ≠ (𝑅‘𝑓)) → (𝑧‘((oc‘𝐾)‘𝑊)) = ((((oc‘𝐾)‘𝑊)(join‘𝐾)(𝑅‘𝑓))(meet‘𝐾)(((((oc‘𝐾)‘𝑊)(join‘𝐾)(𝑅‘𝑏))(meet‘𝐾)((𝑁‘((oc‘𝐾)‘𝑊))(join‘𝐾)(𝑅‘(𝑏 ∘ ◡𝐹))))(join‘𝐾)(𝑅‘(𝑓 ∘ ◡𝑏)))))) = (℩𝑧 ∈ 𝑇 ∀𝑏 ∈ 𝑇 ((𝑏 ≠ ( I ↾ (Base‘𝐾)) ∧ (𝑅‘𝑏) ≠ (𝑅‘𝐹) ∧ (𝑅‘𝑏) ≠ (𝑅‘𝑓)) → (𝑧‘((oc‘𝐾)‘𝑊)) = ((((oc‘𝐾)‘𝑊)(join‘𝐾)(𝑅‘𝑓))(meet‘𝐾)(((((oc‘𝐾)‘𝑊)(join‘𝐾)(𝑅‘𝑏))(meet‘𝐾)((𝑁‘((oc‘𝐾)‘𝑊))(join‘𝐾)(𝑅‘(𝑏 ∘ ◡𝐹))))(join‘𝐾)(𝑅‘(𝑓 ∘ ◡𝑏))))))
13		eqid 2733	. . 3 ⊢ (𝑓 ∈ 𝑇 ↦ if(𝐹 = 𝑁, 𝑓, (℩𝑧 ∈ 𝑇 ∀𝑏 ∈ 𝑇 ((𝑏 ≠ ( I ↾ (Base‘𝐾)) ∧ (𝑅‘𝑏) ≠ (𝑅‘𝐹) ∧ (𝑅‘𝑏) ≠ (𝑅‘𝑓)) → (𝑧‘((oc‘𝐾)‘𝑊)) = ((((oc‘𝐾)‘𝑊)(join‘𝐾)(𝑅‘𝑓))(meet‘𝐾)(((((oc‘𝐾)‘𝑊)(join‘𝐾)(𝑅‘𝑏))(meet‘𝐾)((𝑁‘((oc‘𝐾)‘𝑊))(join‘𝐾)(𝑅‘(𝑏 ∘ ◡𝐹))))(join‘𝐾)(𝑅‘(𝑓 ∘ ◡𝑏)))))))) = (𝑓 ∈ 𝑇 ↦ if(𝐹 = 𝑁, 𝑓, (℩𝑧 ∈ 𝑇 ∀𝑏 ∈ 𝑇 ((𝑏 ≠ ( I ↾ (Base‘𝐾)) ∧ (𝑅‘𝑏) ≠ (𝑅‘𝐹) ∧ (𝑅‘𝑏) ≠ (𝑅‘𝑓)) → (𝑧‘((oc‘𝐾)‘𝑊)) = ((((oc‘𝐾)‘𝑊)(join‘𝐾)(𝑅‘𝑓))(meet‘𝐾)(((((oc‘𝐾)‘𝑊)(join‘𝐾)(𝑅‘𝑏))(meet‘𝐾)((𝑁‘((oc‘𝐾)‘𝑊))(join‘𝐾)(𝑅‘(𝑏 ∘ ◡𝐹))))(join‘𝐾)(𝑅‘(𝑓 ∘ ◡𝑏))))))))
14		cdlemk7.e	. . 3 ⊢ 𝐸 = ((TEndo‘𝐾)‘𝑊)
15	1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14	cdlemk56w 40917	. 2 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝑁 ∈ 𝑇) ∧ (𝑅‘𝐹) = (𝑅‘𝑁)) → ((𝑓 ∈ 𝑇 ↦ if(𝐹 = 𝑁, 𝑓, (℩𝑧 ∈ 𝑇 ∀𝑏 ∈ 𝑇 ((𝑏 ≠ ( I ↾ (Base‘𝐾)) ∧ (𝑅‘𝑏) ≠ (𝑅‘𝐹) ∧ (𝑅‘𝑏) ≠ (𝑅‘𝑓)) → (𝑧‘((oc‘𝐾)‘𝑊)) = ((((oc‘𝐾)‘𝑊)(join‘𝐾)(𝑅‘𝑓))(meet‘𝐾)(((((oc‘𝐾)‘𝑊)(join‘𝐾)(𝑅‘𝑏))(meet‘𝐾)((𝑁‘((oc‘𝐾)‘𝑊))(join‘𝐾)(𝑅‘(𝑏 ∘ ◡𝐹))))(join‘𝐾)(𝑅‘(𝑓 ∘ ◡𝑏)))))))) ∈ 𝐸 ∧ ((𝑓 ∈ 𝑇 ↦ if(𝐹 = 𝑁, 𝑓, (℩𝑧 ∈ 𝑇 ∀𝑏 ∈ 𝑇 ((𝑏 ≠ ( I ↾ (Base‘𝐾)) ∧ (𝑅‘𝑏) ≠ (𝑅‘𝐹) ∧ (𝑅‘𝑏) ≠ (𝑅‘𝑓)) → (𝑧‘((oc‘𝐾)‘𝑊)) = ((((oc‘𝐾)‘𝑊)(join‘𝐾)(𝑅‘𝑓))(meet‘𝐾)(((((oc‘𝐾)‘𝑊)(join‘𝐾)(𝑅‘𝑏))(meet‘𝐾)((𝑁‘((oc‘𝐾)‘𝑊))(join‘𝐾)(𝑅‘(𝑏 ∘ ◡𝐹))))(join‘𝐾)(𝑅‘(𝑓 ∘ ◡𝑏))))))))‘𝐹) = 𝑁))
16		fveq1 6900	. . . 4 ⊢ (𝑢 = (𝑓 ∈ 𝑇 ↦ if(𝐹 = 𝑁, 𝑓, (℩𝑧 ∈ 𝑇 ∀𝑏 ∈ 𝑇 ((𝑏 ≠ ( I ↾ (Base‘𝐾)) ∧ (𝑅‘𝑏) ≠ (𝑅‘𝐹) ∧ (𝑅‘𝑏) ≠ (𝑅‘𝑓)) → (𝑧‘((oc‘𝐾)‘𝑊)) = ((((oc‘𝐾)‘𝑊)(join‘𝐾)(𝑅‘𝑓))(meet‘𝐾)(((((oc‘𝐾)‘𝑊)(join‘𝐾)(𝑅‘𝑏))(meet‘𝐾)((𝑁‘((oc‘𝐾)‘𝑊))(join‘𝐾)(𝑅‘(𝑏 ∘ ◡𝐹))))(join‘𝐾)(𝑅‘(𝑓 ∘ ◡𝑏)))))))) → (𝑢‘𝐹) = ((𝑓 ∈ 𝑇 ↦ if(𝐹 = 𝑁, 𝑓, (℩𝑧 ∈ 𝑇 ∀𝑏 ∈ 𝑇 ((𝑏 ≠ ( I ↾ (Base‘𝐾)) ∧ (𝑅‘𝑏) ≠ (𝑅‘𝐹) ∧ (𝑅‘𝑏) ≠ (𝑅‘𝑓)) → (𝑧‘((oc‘𝐾)‘𝑊)) = ((((oc‘𝐾)‘𝑊)(join‘𝐾)(𝑅‘𝑓))(meet‘𝐾)(((((oc‘𝐾)‘𝑊)(join‘𝐾)(𝑅‘𝑏))(meet‘𝐾)((𝑁‘((oc‘𝐾)‘𝑊))(join‘𝐾)(𝑅‘(𝑏 ∘ ◡𝐹))))(join‘𝐾)(𝑅‘(𝑓 ∘ ◡𝑏))))))))‘𝐹))
17	16	eqeq1d 2735	. . 3 ⊢ (𝑢 = (𝑓 ∈ 𝑇 ↦ if(𝐹 = 𝑁, 𝑓, (℩𝑧 ∈ 𝑇 ∀𝑏 ∈ 𝑇 ((𝑏 ≠ ( I ↾ (Base‘𝐾)) ∧ (𝑅‘𝑏) ≠ (𝑅‘𝐹) ∧ (𝑅‘𝑏) ≠ (𝑅‘𝑓)) → (𝑧‘((oc‘𝐾)‘𝑊)) = ((((oc‘𝐾)‘𝑊)(join‘𝐾)(𝑅‘𝑓))(meet‘𝐾)(((((oc‘𝐾)‘𝑊)(join‘𝐾)(𝑅‘𝑏))(meet‘𝐾)((𝑁‘((oc‘𝐾)‘𝑊))(join‘𝐾)(𝑅‘(𝑏 ∘ ◡𝐹))))(join‘𝐾)(𝑅‘(𝑓 ∘ ◡𝑏)))))))) → ((𝑢‘𝐹) = 𝑁 ↔ ((𝑓 ∈ 𝑇 ↦ if(𝐹 = 𝑁, 𝑓, (℩𝑧 ∈ 𝑇 ∀𝑏 ∈ 𝑇 ((𝑏 ≠ ( I ↾ (Base‘𝐾)) ∧ (𝑅‘𝑏) ≠ (𝑅‘𝐹) ∧ (𝑅‘𝑏) ≠ (𝑅‘𝑓)) → (𝑧‘((oc‘𝐾)‘𝑊)) = ((((oc‘𝐾)‘𝑊)(join‘𝐾)(𝑅‘𝑓))(meet‘𝐾)(((((oc‘𝐾)‘𝑊)(join‘𝐾)(𝑅‘𝑏))(meet‘𝐾)((𝑁‘((oc‘𝐾)‘𝑊))(join‘𝐾)(𝑅‘(𝑏 ∘ ◡𝐹))))(join‘𝐾)(𝑅‘(𝑓 ∘ ◡𝑏))))))))‘𝐹) = 𝑁))
18	17	rspcev 3622	. 2 ⊢ (((𝑓 ∈ 𝑇 ↦ if(𝐹 = 𝑁, 𝑓, (℩𝑧 ∈ 𝑇 ∀𝑏 ∈ 𝑇 ((𝑏 ≠ ( I ↾ (Base‘𝐾)) ∧ (𝑅‘𝑏) ≠ (𝑅‘𝐹) ∧ (𝑅‘𝑏) ≠ (𝑅‘𝑓)) → (𝑧‘((oc‘𝐾)‘𝑊)) = ((((oc‘𝐾)‘𝑊)(join‘𝐾)(𝑅‘𝑓))(meet‘𝐾)(((((oc‘𝐾)‘𝑊)(join‘𝐾)(𝑅‘𝑏))(meet‘𝐾)((𝑁‘((oc‘𝐾)‘𝑊))(join‘𝐾)(𝑅‘(𝑏 ∘ ◡𝐹))))(join‘𝐾)(𝑅‘(𝑓 ∘ ◡𝑏)))))))) ∈ 𝐸 ∧ ((𝑓 ∈ 𝑇 ↦ if(𝐹 = 𝑁, 𝑓, (℩𝑧 ∈ 𝑇 ∀𝑏 ∈ 𝑇 ((𝑏 ≠ ( I ↾ (Base‘𝐾)) ∧ (𝑅‘𝑏) ≠ (𝑅‘𝐹) ∧ (𝑅‘𝑏) ≠ (𝑅‘𝑓)) → (𝑧‘((oc‘𝐾)‘𝑊)) = ((((oc‘𝐾)‘𝑊)(join‘𝐾)(𝑅‘𝑓))(meet‘𝐾)(((((oc‘𝐾)‘𝑊)(join‘𝐾)(𝑅‘𝑏))(meet‘𝐾)((𝑁‘((oc‘𝐾)‘𝑊))(join‘𝐾)(𝑅‘(𝑏 ∘ ◡𝐹))))(join‘𝐾)(𝑅‘(𝑓 ∘ ◡𝑏))))))))‘𝐹) = 𝑁) → ∃𝑢 ∈ 𝐸 (𝑢‘𝐹) = 𝑁)
19	15, 18	syl 17	1 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝑁 ∈ 𝑇) ∧ (𝑅‘𝐹) = (𝑅‘𝑁)) → ∃𝑢 ∈ 𝐸 (𝑢‘𝐹) = 𝑁)

Syntax hints:   → wi 4   ∧ wa 395   ∧ w3a 1085   = wceq 1535   ∈ wcel 2104   ≠ wne 2936  ∀wral 3057  ∃wrex 3066  ifcif 4530   ↦ cmpt 5232   I cid 5575  ^◡ccnv 5682   ↾ cres 5685   ∘ ccom 5687  ‘cfv 6558  ℩crio 7380  (class class class)co 7425  Basecbs 17234  occoc 17295  joincjn 18357  meetcmee 18358  Atomscatm 39206  HLchlt 39293  LHypclh 39928  LTrncltrn 40045  trLctrl 40102  TEndoctendo 40696

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1790  ax-4 1804  ax-5 1906  ax-6 1963  ax-7 2003  ax-8 2106  ax-9 2114  ax-10 2137  ax-11 2153  ax-12 2173  ax-ext 2704  ax-rep 5286  ax-sep 5300  ax-nul 5307  ax-pow 5366  ax-pr 5430  ax-un 7747  ax-riotaBAD 38896

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 847  df-3or 1086  df-3an 1087  df-tru 1538  df-fal 1548  df-ex 1775  df-nf 1779  df-sb 2061  df-mo 2536  df-eu 2565  df-clab 2711  df-cleq 2725  df-clel 2812  df-nfc 2888  df-ne 2937  df-ral 3058  df-rex 3067  df-rmo 3376  df-reu 3377  df-rab 3433  df-v 3479  df-sbc 3792  df-csb 3909  df-dif 3966  df-un 3968  df-in 3970  df-ss 3980  df-nul 4340  df-if 4531  df-pw 4606  df-sn 4631  df-pr 4633  df-op 4637  df-uni 4915  df-iun 5000  df-iin 5001  df-br 5150  df-opab 5212  df-mpt 5233  df-id 5576  df-xp 5689  df-rel 5690  df-cnv 5691  df-co 5692  df-dm 5693  df-rn 5694  df-res 5695  df-ima 5696  df-iota 6510  df-fun 6560  df-fn 6561  df-f 6562  df-f1 6563  df-fo 6564  df-f1o 6565  df-fv 6566  df-riota 7381  df-ov 7428  df-oprab 7429  df-mpo 7430  df-1st 8007  df-2nd 8008  df-undef 8291  df-map 8861  df-proset 18341  df-poset 18359  df-plt 18376  df-lub 18392  df-glb 18393  df-join 18394  df-meet 18395  df-p0 18471  df-p1 18472  df-lat 18478  df-clat 18545  df-oposet 39119  df-ol 39121  df-oml 39122  df-covers 39209  df-ats 39210  df-atl 39241  df-cvlat 39265  df-hlat 39294  df-llines 39442  df-lplanes 39443  df-lvols 39444  df-lines 39445  df-psubsp 39447  df-pmap 39448  df-padd 39740  df-lhyp 39932  df-laut 39933  df-ldil 40048  df-ltrn 40049  df-trl 40103  df-tendo 40699

This theorem is referenced by:  tendoex  40919  cdleml2N  40921