Theorem cdlemk56 38671

Description: Part of Lemma K of [Crawley] p. 118. Line 11, p. 120, "tau is in Delta" i.e. 𝑈 is a trace-preserving endormorphism. (Contributed by NM, 31-Jul-2013.)

Hypotheses

Ref	Expression
cdlemk5.b	⊢ 𝐵 = (Base‘𝐾)
cdlemk5.l	⊢ ≤ = (le‘𝐾)
cdlemk5.j	⊢ ∨ = (join‘𝐾)
cdlemk5.m	⊢ ∧ = (meet‘𝐾)
cdlemk5.a	⊢ 𝐴 = (Atoms‘𝐾)
cdlemk5.h	⊢ 𝐻 = (LHyp‘𝐾)
cdlemk5.t	⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊)
cdlemk5.r	⊢ 𝑅 = ((trL‘𝐾)‘𝑊)
cdlemk5.z	⊢ 𝑍 = ((𝑃 ∨ (𝑅‘𝑏)) ∧ ((𝑁‘𝑃) ∨ (𝑅‘(𝑏 ∘ ◡𝐹))))
cdlemk5.y	⊢ 𝑌 = ((𝑃 ∨ (𝑅‘𝑔)) ∧ (𝑍 ∨ (𝑅‘(𝑔 ∘ ◡𝑏))))
cdlemk5.x	⊢ 𝑋 = (℩𝑧 ∈ 𝑇 ∀𝑏 ∈ 𝑇 ((𝑏 ≠ ( I ↾ 𝐵) ∧ (𝑅‘𝑏) ≠ (𝑅‘𝐹) ∧ (𝑅‘𝑏) ≠ (𝑅‘𝑔)) → (𝑧‘𝑃) = 𝑌))
cdlemk5.u	⊢ 𝑈 = (𝑔 ∈ 𝑇 ↦ if(𝐹 = 𝑁, 𝑔, 𝑋))
cdlemk5.e	⊢ 𝐸 = ((TEndo‘𝐾)‘𝑊)

Assertion

Ref	Expression
cdlemk56	⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ 𝑁 ∈ 𝑇) ∧ (𝑅‘𝐹) = (𝑅‘𝑁) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → 𝑈 ∈ 𝐸)

Distinct variable groups:   ∧ ,𝑔   ∨ ,𝑔   𝐵,𝑔   𝑃,𝑔   𝑅,𝑔   𝑇,𝑔   𝑔,𝑍   𝑔,𝑏,𝑧, ∧   ≤ ,𝑏   𝑧,𝑔, ≤   ∨ ,𝑏,𝑧   𝐴,𝑏,𝑔,𝑧   𝐵,𝑏,𝑧   𝐹,𝑏,𝑔,𝑧   𝐻,𝑏,𝑔,𝑧   𝐾,𝑏,𝑔,𝑧   𝑁,𝑏,𝑔,𝑧   𝑃,𝑏,𝑧   𝑅,𝑏,𝑧   𝑇,𝑏,𝑧   𝑊,𝑏,𝑔,𝑧   𝑧,𝑌

Allowed substitution hints:   𝑈(𝑧,𝑔,𝑏)   𝐸(𝑧,𝑔,𝑏)   𝑋(𝑧,𝑔,𝑏)   𝑌(𝑔,𝑏)   𝑍(𝑧,𝑏)

Proof of Theorem cdlemk56

Dummy variables 𝑓 ℎ are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		cdlemk5.l	. 2 ⊢ ≤ = (le‘𝐾)
2		cdlemk5.h	. 2 ⊢ 𝐻 = (LHyp‘𝐾)
3		cdlemk5.t	. 2 ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊)
4		cdlemk5.r	. 2 ⊢ 𝑅 = ((trL‘𝐾)‘𝑊)
5		cdlemk5.e	. 2 ⊢ 𝐸 = ((TEndo‘𝐾)‘𝑊)
6		simp11 1205	. 2 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ 𝑁 ∈ 𝑇) ∧ (𝑅‘𝐹) = (𝑅‘𝑁) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → (𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻))
7		vex 3402	. . . . . 6 ⊢ 𝑔 ∈ V
8		cdlemk5.x	. . . . . . 7 ⊢ 𝑋 = (℩𝑧 ∈ 𝑇 ∀𝑏 ∈ 𝑇 ((𝑏 ≠ ( I ↾ 𝐵) ∧ (𝑅‘𝑏) ≠ (𝑅‘𝐹) ∧ (𝑅‘𝑏) ≠ (𝑅‘𝑔)) → (𝑧‘𝑃) = 𝑌))
9		riotaex 7152	. . . . . . 7 ⊢ (℩𝑧 ∈ 𝑇 ∀𝑏 ∈ 𝑇 ((𝑏 ≠ ( I ↾ 𝐵) ∧ (𝑅‘𝑏) ≠ (𝑅‘𝐹) ∧ (𝑅‘𝑏) ≠ (𝑅‘𝑔)) → (𝑧‘𝑃) = 𝑌)) ∈ V
10	8, 9	eqeltri 2827	. . . . . 6 ⊢ 𝑋 ∈ V
11	7, 10	ifex 4475	. . . . 5 ⊢ if(𝐹 = 𝑁, 𝑔, 𝑋) ∈ V
12	11	rgenw 3063	. . . 4 ⊢ ∀𝑔 ∈ 𝑇 if(𝐹 = 𝑁, 𝑔, 𝑋) ∈ V
13		cdlemk5.u	. . . . 5 ⊢ 𝑈 = (𝑔 ∈ 𝑇 ↦ if(𝐹 = 𝑁, 𝑔, 𝑋))
14	13	fnmpt 6496	. . . 4 ⊢ (∀𝑔 ∈ 𝑇 if(𝐹 = 𝑁, 𝑔, 𝑋) ∈ V → 𝑈 Fn 𝑇)
15	12, 14	mp1i 13	. . 3 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ 𝑁 ∈ 𝑇) ∧ (𝑅‘𝐹) = (𝑅‘𝑁) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → 𝑈 Fn 𝑇)
16		simpl11 1250	. . . . 5 ⊢ (((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ 𝑁 ∈ 𝑇) ∧ (𝑅‘𝐹) = (𝑅‘𝑁) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) ∧ 𝑓 ∈ 𝑇) → (𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻))
17		simpl2 1194	. . . . 5 ⊢ (((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ 𝑁 ∈ 𝑇) ∧ (𝑅‘𝐹) = (𝑅‘𝑁) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) ∧ 𝑓 ∈ 𝑇) → (𝑅‘𝐹) = (𝑅‘𝑁))
18		simpl12 1251	. . . . 5 ⊢ (((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ 𝑁 ∈ 𝑇) ∧ (𝑅‘𝐹) = (𝑅‘𝑁) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) ∧ 𝑓 ∈ 𝑇) → 𝐹 ∈ 𝑇)
19		simpl13 1252	. . . . 5 ⊢ (((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ 𝑁 ∈ 𝑇) ∧ (𝑅‘𝐹) = (𝑅‘𝑁) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) ∧ 𝑓 ∈ 𝑇) → 𝑁 ∈ 𝑇)
20		simpr 488	. . . . 5 ⊢ (((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ 𝑁 ∈ 𝑇) ∧ (𝑅‘𝐹) = (𝑅‘𝑁) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) ∧ 𝑓 ∈ 𝑇) → 𝑓 ∈ 𝑇)
21		simpl3 1195	. . . . 5 ⊢ (((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ 𝑁 ∈ 𝑇) ∧ (𝑅‘𝐹) = (𝑅‘𝑁) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) ∧ 𝑓 ∈ 𝑇) → (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊))
22		cdlemk5.b	. . . . . 6 ⊢ 𝐵 = (Base‘𝐾)
23		cdlemk5.j	. . . . . 6 ⊢ ∨ = (join‘𝐾)
24		cdlemk5.m	. . . . . 6 ⊢ ∧ = (meet‘𝐾)
25		cdlemk5.a	. . . . . 6 ⊢ 𝐴 = (Atoms‘𝐾)
26		cdlemk5.z	. . . . . 6 ⊢ 𝑍 = ((𝑃 ∨ (𝑅‘𝑏)) ∧ ((𝑁‘𝑃) ∨ (𝑅‘(𝑏 ∘ ◡𝐹))))
27		cdlemk5.y	. . . . . 6 ⊢ 𝑌 = ((𝑃 ∨ (𝑅‘𝑔)) ∧ (𝑍 ∨ (𝑅‘(𝑔 ∘ ◡𝑏))))
28	22, 1, 23, 24, 25, 2, 3, 4, 26, 27, 8, 13	cdlemk35u 38664	. . . . 5 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑅‘𝐹) = (𝑅‘𝑁)) ∧ (𝐹 ∈ 𝑇 ∧ 𝑁 ∈ 𝑇 ∧ 𝑓 ∈ 𝑇) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → (𝑈‘𝑓) ∈ 𝑇)
29	16, 17, 18, 19, 20, 21, 28	syl231anc 1392	. . . 4 ⊢ (((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ 𝑁 ∈ 𝑇) ∧ (𝑅‘𝐹) = (𝑅‘𝑁) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) ∧ 𝑓 ∈ 𝑇) → (𝑈‘𝑓) ∈ 𝑇)
30	29	ralrimiva 3095	. . 3 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ 𝑁 ∈ 𝑇) ∧ (𝑅‘𝐹) = (𝑅‘𝑁) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → ∀𝑓 ∈ 𝑇 (𝑈‘𝑓) ∈ 𝑇)
31		ffnfv 6913	. . 3 ⊢ (𝑈:𝑇⟶𝑇 ↔ (𝑈 Fn 𝑇 ∧ ∀𝑓 ∈ 𝑇 (𝑈‘𝑓) ∈ 𝑇))
32	15, 30, 31	sylanbrc 586	. 2 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ 𝑁 ∈ 𝑇) ∧ (𝑅‘𝐹) = (𝑅‘𝑁) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → 𝑈:𝑇⟶𝑇)
33		simp11 1205	. . 3 ⊢ (((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ 𝑁 ∈ 𝑇) ∧ (𝑅‘𝐹) = (𝑅‘𝑁) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) ∧ 𝑓 ∈ 𝑇 ∧ ℎ ∈ 𝑇) → ((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ 𝑁 ∈ 𝑇))
34		simp12 1206	. . 3 ⊢ (((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ 𝑁 ∈ 𝑇) ∧ (𝑅‘𝐹) = (𝑅‘𝑁) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) ∧ 𝑓 ∈ 𝑇 ∧ ℎ ∈ 𝑇) → (𝑅‘𝐹) = (𝑅‘𝑁))
35		simp2 1139	. . 3 ⊢ (((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ 𝑁 ∈ 𝑇) ∧ (𝑅‘𝐹) = (𝑅‘𝑁) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) ∧ 𝑓 ∈ 𝑇 ∧ ℎ ∈ 𝑇) → 𝑓 ∈ 𝑇)
36		simp3 1140	. . 3 ⊢ (((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ 𝑁 ∈ 𝑇) ∧ (𝑅‘𝐹) = (𝑅‘𝑁) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) ∧ 𝑓 ∈ 𝑇 ∧ ℎ ∈ 𝑇) → ℎ ∈ 𝑇)
37		simp13 1207	. . 3 ⊢ (((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ 𝑁 ∈ 𝑇) ∧ (𝑅‘𝐹) = (𝑅‘𝑁) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) ∧ 𝑓 ∈ 𝑇 ∧ ℎ ∈ 𝑇) → (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊))
38	22, 1, 23, 24, 25, 2, 3, 4, 26, 27, 8, 13	cdlemk55u 38666	. . 3 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ 𝑁 ∈ 𝑇) ∧ ((𝑅‘𝐹) = (𝑅‘𝑁) ∧ 𝑓 ∈ 𝑇 ∧ ℎ ∈ 𝑇) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → (𝑈‘(𝑓 ∘ ℎ)) = ((𝑈‘𝑓) ∘ (𝑈‘ℎ)))
39	33, 34, 35, 36, 37, 38	syl131anc 1385	. 2 ⊢ (((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ 𝑁 ∈ 𝑇) ∧ (𝑅‘𝐹) = (𝑅‘𝑁) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) ∧ 𝑓 ∈ 𝑇 ∧ ℎ ∈ 𝑇) → (𝑈‘(𝑓 ∘ ℎ)) = ((𝑈‘𝑓) ∘ (𝑈‘ℎ)))
40		simpl1 1193	. . 3 ⊢ (((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ 𝑁 ∈ 𝑇) ∧ (𝑅‘𝐹) = (𝑅‘𝑁) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) ∧ 𝑓 ∈ 𝑇) → ((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ 𝑁 ∈ 𝑇))
41	22, 1, 23, 24, 25, 2, 3, 4, 26, 27, 8, 13	cdlemk39u 38668	. . 3 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ 𝑁 ∈ 𝑇) ∧ ((𝑅‘𝐹) = (𝑅‘𝑁) ∧ 𝑓 ∈ 𝑇) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → (𝑅‘(𝑈‘𝑓)) ≤ (𝑅‘𝑓))
42	40, 17, 20, 21, 41	syl121anc 1377	. 2 ⊢ (((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ 𝑁 ∈ 𝑇) ∧ (𝑅‘𝐹) = (𝑅‘𝑁) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) ∧ 𝑓 ∈ 𝑇) → (𝑅‘(𝑈‘𝑓)) ≤ (𝑅‘𝑓))
43	1, 2, 3, 4, 5, 6, 32, 39, 42	istendod 38462	1 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ 𝑁 ∈ 𝑇) ∧ (𝑅‘𝐹) = (𝑅‘𝑁) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → 𝑈 ∈ 𝐸)

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 399   ∧ w3a 1089   = wceq 1543   ∈ wcel 2112   ≠ wne 2932  ∀wral 3051  Vcvv 3398  ifcif 4425   class class class wbr 5039   ↦ cmpt 5120   I cid 5439  ^◡ccnv 5535   ↾ cres 5538   ∘ ccom 5540   Fn wfn 6353  ⟶wf 6354  ‘cfv 6358  ℩crio 7147  (class class class)co 7191  Basecbs 16666  lecple 16756  joincjn 17772  meetcmee 17773  Atomscatm 36963  HLchlt 37050  LHypclh 37684  LTrncltrn 37801  trLctrl 37858  TEndoctendo 38452

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1803  ax-4 1817  ax-5 1918  ax-6 1976  ax-7 2018  ax-8 2114  ax-9 2122  ax-10 2143  ax-11 2160  ax-12 2177  ax-ext 2708  ax-rep 5164  ax-sep 5177  ax-nul 5184  ax-pow 5243  ax-pr 5307  ax-un 7501  ax-riotaBAD 36653

This theorem depends on definitions:  df-bi 210  df-an 400  df-or 848  df-3or 1090  df-3an 1091  df-tru 1546  df-fal 1556  df-ex 1788  df-nf 1792  df-sb 2073  df-mo 2539  df-eu 2568  df-clab 2715  df-cleq 2728  df-clel 2809  df-nfc 2879  df-ne 2933  df-ral 3056  df-rex 3057  df-reu 3058  df-rmo 3059  df-rab 3060  df-v 3400  df-sbc 3684  df-csb 3799  df-dif 3856  df-un 3858  df-in 3860  df-ss 3870  df-nul 4224  df-if 4426  df-pw 4501  df-sn 4528  df-pr 4530  df-op 4534  df-uni 4806  df-iun 4892  df-iin 4893  df-br 5040  df-opab 5102  df-mpt 5121  df-id 5440  df-xp 5542  df-rel 5543  df-cnv 5544  df-co 5545  df-dm 5546  df-rn 5547  df-res 5548  df-ima 5549  df-iota 6316  df-fun 6360  df-fn 6361  df-f 6362  df-f1 6363  df-fo 6364  df-f1o 6365  df-fv 6366  df-riota 7148  df-ov 7194  df-oprab 7195  df-mpo 7196  df-1st 7739  df-2nd 7740  df-undef 7993  df-map 8488  df-proset 17756  df-poset 17774  df-plt 17790  df-lub 17806  df-glb 17807  df-join 17808  df-meet 17809  df-p0 17885  df-p1 17886  df-lat 17892  df-clat 17959  df-oposet 36876  df-ol 36878  df-oml 36879  df-covers 36966  df-ats 36967  df-atl 36998  df-cvlat 37022  df-hlat 37051  df-llines 37198  df-lplanes 37199  df-lvols 37200  df-lines 37201  df-psubsp 37203  df-pmap 37204  df-padd 37496  df-lhyp 37688  df-laut 37689  df-ldil 37804  df-ltrn 37805  df-trl 37859  df-tendo 38455

This theorem is referenced by:  cdlemk56w  38673