Theorem cdlemk56 42168

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 1222	. 2 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ 𝑁 ∈ 𝑇) ∧ (𝑅‘𝐹) = (𝑅‘𝑁) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → (𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻))
7		vex 3457	. . . . . 6 ⊢ 𝑔 ∈ V
8		cdlemk5.x	. . . . . . 7 ⊢ 𝑋 = (℩𝑧 ∈ 𝑇 ∀𝑏 ∈ 𝑇 ((𝑏 ≠ ( I ↾ 𝐵) ∧ (𝑅‘𝑏) ≠ (𝑅‘𝐹) ∧ (𝑅‘𝑏) ≠ (𝑅‘𝑔)) → (𝑧‘𝑃) = 𝑌))
9		riotaex 7388	. . . . . . 7 ⊢ (℩𝑧 ∈ 𝑇 ∀𝑏 ∈ 𝑇 ((𝑏 ≠ ( I ↾ 𝐵) ∧ (𝑅‘𝑏) ≠ (𝑅‘𝐹) ∧ (𝑅‘𝑏) ≠ (𝑅‘𝑔)) → (𝑧‘𝑃) = 𝑌)) ∈ V
10	8, 9	eqeltri 2859	. . . . . 6 ⊢ 𝑋 ∈ V
11	7, 10	ifex 4535	. . . . 5 ⊢ if(𝐹 = 𝑁, 𝑔, 𝑋) ∈ V
12	11	rgenw 3083	. . . 4 ⊢ ∀𝑔 ∈ 𝑇 if(𝐹 = 𝑁, 𝑔, 𝑋) ∈ V
13		cdlemk5.u	. . . . 5 ⊢ 𝑈 = (𝑔 ∈ 𝑇 ↦ if(𝐹 = 𝑁, 𝑔, 𝑋))
14	13	fnmpt 6687	. . . 4 ⊢ (∀𝑔 ∈ 𝑇 if(𝐹 = 𝑁, 𝑔, 𝑋) ∈ V → 𝑈 Fn 𝑇)
15	12, 14	mp1i 14	. . 3 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ 𝑁 ∈ 𝑇) ∧ (𝑅‘𝐹) = (𝑅‘𝑁) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → 𝑈 Fn 𝑇)
16		simpl11 1267	. . . . 5 ⊢ (((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ 𝑁 ∈ 𝑇) ∧ (𝑅‘𝐹) = (𝑅‘𝑁) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) ∧ 𝑓 ∈ 𝑇) → (𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻))
17		simpl2 1211	. . . . 5 ⊢ (((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ 𝑁 ∈ 𝑇) ∧ (𝑅‘𝐹) = (𝑅‘𝑁) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) ∧ 𝑓 ∈ 𝑇) → (𝑅‘𝐹) = (𝑅‘𝑁))
18		simpl12 1268	. . . . 5 ⊢ (((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ 𝑁 ∈ 𝑇) ∧ (𝑅‘𝐹) = (𝑅‘𝑁) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) ∧ 𝑓 ∈ 𝑇) → 𝐹 ∈ 𝑇)
19		simpl13 1269	. . . . 5 ⊢ (((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ 𝑁 ∈ 𝑇) ∧ (𝑅‘𝐹) = (𝑅‘𝑁) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) ∧ 𝑓 ∈ 𝑇) → 𝑁 ∈ 𝑇)
20		simpr 490	. . . . 5 ⊢ (((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ 𝑁 ∈ 𝑇) ∧ (𝑅‘𝐹) = (𝑅‘𝑁) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) ∧ 𝑓 ∈ 𝑇) → 𝑓 ∈ 𝑇)
21		simpl3 1212	. . . . 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 42161	. . . . 5 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑅‘𝐹) = (𝑅‘𝑁)) ∧ (𝐹 ∈ 𝑇 ∧ 𝑁 ∈ 𝑇 ∧ 𝑓 ∈ 𝑇) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → (𝑈‘𝑓) ∈ 𝑇)
29	16, 17, 18, 19, 20, 21, 28	syl231anc 1417	. . . 4 ⊢ (((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ 𝑁 ∈ 𝑇) ∧ (𝑅‘𝐹) = (𝑅‘𝑁) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) ∧ 𝑓 ∈ 𝑇) → (𝑈‘𝑓) ∈ 𝑇)
30	29	ralrimiva 3157	. . 3 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ 𝑁 ∈ 𝑇) ∧ (𝑅‘𝐹) = (𝑅‘𝑁) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → ∀𝑓 ∈ 𝑇 (𝑈‘𝑓) ∈ 𝑇)
31		ffnfv 7127	. . 3 ⊢ (𝑈:𝑇⟶𝑇 ↔ (𝑈 Fn 𝑇 ∧ ∀𝑓 ∈ 𝑇 (𝑈‘𝑓) ∈ 𝑇))
32	15, 30, 31	sylanbrc 595	. 2 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ 𝑁 ∈ 𝑇) ∧ (𝑅‘𝐹) = (𝑅‘𝑁) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → 𝑈:𝑇⟶𝑇)
33		simp11 1222	. . 3 ⊢ (((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ 𝑁 ∈ 𝑇) ∧ (𝑅‘𝐹) = (𝑅‘𝑁) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) ∧ 𝑓 ∈ 𝑇 ∧ ℎ ∈ 𝑇) → ((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ 𝑁 ∈ 𝑇))
34		simp12 1223	. . 3 ⊢ (((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ 𝑁 ∈ 𝑇) ∧ (𝑅‘𝐹) = (𝑅‘𝑁) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) ∧ 𝑓 ∈ 𝑇 ∧ ℎ ∈ 𝑇) → (𝑅‘𝐹) = (𝑅‘𝑁))
35		simp2 1155	. . 3 ⊢ (((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ 𝑁 ∈ 𝑇) ∧ (𝑅‘𝐹) = (𝑅‘𝑁) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) ∧ 𝑓 ∈ 𝑇 ∧ ℎ ∈ 𝑇) → 𝑓 ∈ 𝑇)
36		simp3 1156	. . 3 ⊢ (((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ 𝑁 ∈ 𝑇) ∧ (𝑅‘𝐹) = (𝑅‘𝑁) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) ∧ 𝑓 ∈ 𝑇 ∧ ℎ ∈ 𝑇) → ℎ ∈ 𝑇)
37		simp13 1224	. . 3 ⊢ (((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ 𝑁 ∈ 𝑇) ∧ (𝑅‘𝐹) = (𝑅‘𝑁) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) ∧ 𝑓 ∈ 𝑇 ∧ ℎ ∈ 𝑇) → (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊))
38	22, 1, 23, 24, 25, 2, 3, 4, 26, 27, 8, 13	cdlemk55u 42163	. . 3 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ 𝑁 ∈ 𝑇) ∧ ((𝑅‘𝐹) = (𝑅‘𝑁) ∧ 𝑓 ∈ 𝑇 ∧ ℎ ∈ 𝑇) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → (𝑈‘(𝑓 ∘ ℎ)) = ((𝑈‘𝑓) ∘ (𝑈‘ℎ)))
39	33, 34, 35, 36, 37, 38	syl131anc 1410	. 2 ⊢ (((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ 𝑁 ∈ 𝑇) ∧ (𝑅‘𝐹) = (𝑅‘𝑁) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) ∧ 𝑓 ∈ 𝑇 ∧ ℎ ∈ 𝑇) → (𝑈‘(𝑓 ∘ ℎ)) = ((𝑈‘𝑓) ∘ (𝑈‘ℎ)))
40		simpl1 1210	. . 3 ⊢ (((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ 𝑁 ∈ 𝑇) ∧ (𝑅‘𝐹) = (𝑅‘𝑁) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) ∧ 𝑓 ∈ 𝑇) → ((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ 𝑁 ∈ 𝑇))
41	22, 1, 23, 24, 25, 2, 3, 4, 26, 27, 8, 13	cdlemk39u 42165	. . 3 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ 𝑁 ∈ 𝑇) ∧ ((𝑅‘𝐹) = (𝑅‘𝑁) ∧ 𝑓 ∈ 𝑇) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → (𝑅‘(𝑈‘𝑓)) ≤ (𝑅‘𝑓))
42	40, 17, 20, 21, 41	syl121anc 1402	. 2 ⊢ (((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ 𝑁 ∈ 𝑇) ∧ (𝑅‘𝐹) = (𝑅‘𝑁) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) ∧ 𝑓 ∈ 𝑇) → (𝑅‘(𝑈‘𝑓)) ≤ (𝑅‘𝑓))
43	1, 2, 3, 4, 5, 6, 32, 39, 42	istendod 41959	1 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ 𝑁 ∈ 𝑇) ∧ (𝑅‘𝐹) = (𝑅‘𝑁) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → 𝑈 ∈ 𝐸)

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ∧ wa 401   ∧ w3a 1103   = wceq 1569   ∈ wcel 2146   ≠ wne 2958  ∀wral 3079  Vcvv 3453  ifcif 4484   class class class wbr 5105   ↦ cmpt 5188   I cid 5548  ^◡ccnv 5653   ↾ cres 5656   ∘ ccom 5658   Fn wfn 6541  ⟶wf 6542  ‘cfv 6546  ℩crio 7383  (class class class)co 7427  Basecbs 17399  lecple 17447  joincjn 18497  meetcmee 18498  Atomscatm 40460  HLchlt 40547  LHypclh 41181  LTrncltrn 41298  trLctrl 41355  TEndoctendo 41949

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1944  ax-6 2001  ax-7 2042  ax-8 2148  ax-9 2156  ax-10 2179  ax-11 2196  ax-12 2215  ax-ext 2735  ax-rep 5234  ax-sep 5251  ax-nul 5262  ax-pow 5330  ax-pr 5394  ax-un 7758  ax-riotaBAD 40150

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2101  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2838  df-nfc 2912  df-ne 2959  df-ral 3080  df-rex 3090  df-rmo 3368  df-reu 3369  df-rab 3416  df-v 3455  df-sbc 3742  df-csb 3851  df-ss 3900  df-dif 4049  df-in 4093  df-un 4153  df-nul 4281  df-if 4485  df-pw 4561  df-sn 4588  df-pr 4590  df-op 4838  df-uni 4870  df-iun 4955  df-iin 4956  df-br 5106  df-opab 5170  df-mpt 5189  df-id 5549  df-xp 5660  df-rel 5661  df-cnv 5662  df-co 5663  df-dm 5664  df-rn 5665  df-res 5666  df-ima 5667  df-iota 6500  df-fun 6548  df-fn 6549  df-f 6550  df-f1 6551  df-fo 6552  df-f1o 6553  df-fv 6554  df-riota 7384  df-ov 7430  df-oprab 7431  df-mpo 7432  df-1st 8008  df-2nd 8009  df-undef 8301  df-map 8860  df-proset 18480  df-poset 18499  df-plt 18514  df-lub 18530  df-glb 18531  df-join 18532  df-meet 18533  df-p0 18609  df-p1 18610  df-lat 18618  df-clat 18685  df-oposet 40373  df-ol 40375  df-oml 40376  df-covers 40463  df-ats 40464  df-atl 40495  df-cvlat 40519  df-hlat 40548  df-llines 40695  df-lplanes 40696  df-lvols 40697  df-lines 40698  df-psubsp 40700  df-pmap 40701  df-padd 40993  df-lhyp 41185  df-laut 41186  df-ldil 41301  df-ltrn 41302  df-trl 41356  df-tendo 41952

This theorem is used by:  cdlemk56w  42170