cdlemk10 - Mathbox for Norm Megill

	Mathbox for Norm Megill		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > Mathboxes > cdlemk10		Structured version Visualization version GIF version

Theorem cdlemk10 41595

Description: Part of proof of Lemma K of [Crawley] p. 118. (Contributed by NM, 29-Jun-2013.)

**Hypotheses**
Ref	Expression
cdlemk.b	⊢ 𝐵 = (Base‘𝐾)
cdlemk.l	⊢ ≤ = (le‘𝐾)
cdlemk.j	⊢ ∨ = (join‘𝐾)
cdlemk.a	⊢ 𝐴 = (Atoms‘𝐾)
cdlemk.h	⊢ 𝐻 = (LHyp‘𝐾)
cdlemk.t	⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊)
cdlemk.r	⊢ 𝑅 = ((trL‘𝐾)‘𝑊)
cdlemk.m	⊢ ∧ = (meet‘𝐾)
cdlemk.v1	⊢ 𝑉 = (((𝐺‘𝑃) ∨ (𝑋‘𝑃)) ∧ ((𝑅‘(𝐺 ∘ ^◡𝐹)) ∨ (𝑅‘(𝑋 ∘ ^◡𝐹))))

**Assertion**
Ref	Expression
cdlemk10	⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇 ∧ 𝑋 ∈ 𝑇) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → 𝑉 ≤ (𝑅‘(𝑋 ∘ ^◡𝐺)))

**Proof of Theorem cdlemk10**
Step	Hyp	Ref	Expression
1		cdlemk.v1	. 2 ⊢ 𝑉 = (((𝐺‘𝑃) ∨ (𝑋‘𝑃)) ∧ ((𝑅‘(𝐺 ∘ ^◡𝐹)) ∨ (𝑅‘(𝑋 ∘ ^◡𝐹))))
2		simp1 1154	. . . . . 6 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇 ∧ 𝑋 ∈ 𝑇) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → (𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻))
3		simp22 1226	. . . . . . 7 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇 ∧ 𝑋 ∈ 𝑇) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → 𝐺 ∈ 𝑇)
4		simp21 1225	. . . . . . . 8 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇 ∧ 𝑋 ∈ 𝑇) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → 𝐹 ∈ 𝑇)
5		cdlemk.h	. . . . . . . . 9 ⊢ 𝐻 = (LHyp‘𝐾)
6		cdlemk.t	. . . . . . . . 9 ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊)
7	5, 6	ltrncnv 40898	. . . . . . . 8 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇) → ^◡𝐹 ∈ 𝑇)
8	2, 4, 7	syl2anc 595	. . . . . . 7 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇 ∧ 𝑋 ∈ 𝑇) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → ^◡𝐹 ∈ 𝑇)
9	5, 6	ltrnco 41471	. . . . . . 7 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐺 ∈ 𝑇 ∧ ^◡𝐹 ∈ 𝑇) → (𝐺 ∘ ^◡𝐹) ∈ 𝑇)
10	2, 3, 8, 9	syl3anc 1398	. . . . . 6 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇 ∧ 𝑋 ∈ 𝑇) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → (𝐺 ∘ ^◡𝐹) ∈ 𝑇)
11		cdlemk.l	. . . . . . 7 ⊢ ≤ = (le‘𝐾)
12		cdlemk.r	. . . . . . 7 ⊢ 𝑅 = ((trL‘𝐾)‘𝑊)
13	11, 5, 6, 12	trlle 40936	. . . . . 6 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐺 ∘ ^◡𝐹) ∈ 𝑇) → (𝑅‘(𝐺 ∘ ^◡𝐹)) ≤ 𝑊)
14	2, 10, 13	syl2anc 595	. . . . 5 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇 ∧ 𝑋 ∈ 𝑇) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → (𝑅‘(𝐺 ∘ ^◡𝐹)) ≤ 𝑊)
15		simp23 1227	. . . . . . 7 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇 ∧ 𝑋 ∈ 𝑇) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → 𝑋 ∈ 𝑇)
16	5, 6	ltrnco 41471	. . . . . . 7 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝑋 ∈ 𝑇 ∧ ^◡𝐹 ∈ 𝑇) → (𝑋 ∘ ^◡𝐹) ∈ 𝑇)
17	2, 15, 8, 16	syl3anc 1398	. . . . . 6 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇 ∧ 𝑋 ∈ 𝑇) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → (𝑋 ∘ ^◡𝐹) ∈ 𝑇)
18	11, 5, 6, 12	trlle 40936	. . . . . 6 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑋 ∘ ^◡𝐹) ∈ 𝑇) → (𝑅‘(𝑋 ∘ ^◡𝐹)) ≤ 𝑊)
19	2, 17, 18	syl2anc 595	. . . . 5 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇 ∧ 𝑋 ∈ 𝑇) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → (𝑅‘(𝑋 ∘ ^◡𝐹)) ≤ 𝑊)
20		simp1l 1216	. . . . . . 7 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇 ∧ 𝑋 ∈ 𝑇) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → 𝐾 ∈ HL)
21	20	hllatd 40116	. . . . . 6 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇 ∧ 𝑋 ∈ 𝑇) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → 𝐾 ∈ Lat)
22		cdlemk.b	. . . . . . . 8 ⊢ 𝐵 = (Base‘𝐾)
23	22, 5, 6, 12	trlcl 40916	. . . . . . 7 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐺 ∘ ^◡𝐹) ∈ 𝑇) → (𝑅‘(𝐺 ∘ ^◡𝐹)) ∈ 𝐵)
24	2, 10, 23	syl2anc 595	. . . . . 6 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇 ∧ 𝑋 ∈ 𝑇) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → (𝑅‘(𝐺 ∘ ^◡𝐹)) ∈ 𝐵)
25	22, 5, 6, 12	trlcl 40916	. . . . . . 7 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑋 ∘ ^◡𝐹) ∈ 𝑇) → (𝑅‘(𝑋 ∘ ^◡𝐹)) ∈ 𝐵)
26	2, 17, 25	syl2anc 595	. . . . . 6 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇 ∧ 𝑋 ∈ 𝑇) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → (𝑅‘(𝑋 ∘ ^◡𝐹)) ∈ 𝐵)
27		simp1r 1217	. . . . . . 7 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇 ∧ 𝑋 ∈ 𝑇) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → 𝑊 ∈ 𝐻)
28	22, 5	lhpbase 40750	. . . . . . 7 ⊢ (𝑊 ∈ 𝐻 → 𝑊 ∈ 𝐵)
29	27, 28	syl 18	. . . . . 6 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇 ∧ 𝑋 ∈ 𝑇) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → 𝑊 ∈ 𝐵)
30		cdlemk.j	. . . . . . 7 ⊢ ∨ = (join‘𝐾)
31	22, 11, 30	latjle12 18507	. . . . . 6 ⊢ ((𝐾 ∈ Lat ∧ ((𝑅‘(𝐺 ∘ ^◡𝐹)) ∈ 𝐵 ∧ (𝑅‘(𝑋 ∘ ^◡𝐹)) ∈ 𝐵 ∧ 𝑊 ∈ 𝐵)) → (((𝑅‘(𝐺 ∘ ^◡𝐹)) ≤ 𝑊 ∧ (𝑅‘(𝑋 ∘ ^◡𝐹)) ≤ 𝑊) ↔ ((𝑅‘(𝐺 ∘ ^◡𝐹)) ∨ (𝑅‘(𝑋 ∘ ^◡𝐹))) ≤ 𝑊))
32	21, 24, 26, 29, 31	syl13anc 1399	. . . . 5 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇 ∧ 𝑋 ∈ 𝑇) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → (((𝑅‘(𝐺 ∘ ^◡𝐹)) ≤ 𝑊 ∧ (𝑅‘(𝑋 ∘ ^◡𝐹)) ≤ 𝑊) ↔ ((𝑅‘(𝐺 ∘ ^◡𝐹)) ∨ (𝑅‘(𝑋 ∘ ^◡𝐹))) ≤ 𝑊))
33	14, 19, 32	mpbi2and 724	. . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇 ∧ 𝑋 ∈ 𝑇) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → ((𝑅‘(𝐺 ∘ ^◡𝐹)) ∨ (𝑅‘(𝑋 ∘ ^◡𝐹))) ≤ 𝑊)
34	22, 30	latjcl 18496	. . . . . 6 ⊢ ((𝐾 ∈ Lat ∧ (𝑅‘(𝐺 ∘ ^◡𝐹)) ∈ 𝐵 ∧ (𝑅‘(𝑋 ∘ ^◡𝐹)) ∈ 𝐵) → ((𝑅‘(𝐺 ∘ ^◡𝐹)) ∨ (𝑅‘(𝑋 ∘ ^◡𝐹))) ∈ 𝐵)
35	21, 24, 26, 34	syl3anc 1398	. . . . 5 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇 ∧ 𝑋 ∈ 𝑇) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → ((𝑅‘(𝐺 ∘ ^◡𝐹)) ∨ (𝑅‘(𝑋 ∘ ^◡𝐹))) ∈ 𝐵)
36		simp3l 1220	. . . . . . 7 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇 ∧ 𝑋 ∈ 𝑇) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → 𝑃 ∈ 𝐴)
37		cdlemk.a	. . . . . . . 8 ⊢ 𝐴 = (Atoms‘𝐾)
38	11, 37, 5, 6	ltrnat 40892	. . . . . . 7 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐺 ∈ 𝑇 ∧ 𝑃 ∈ 𝐴) → (𝐺‘𝑃) ∈ 𝐴)
39	2, 3, 36, 38	syl3anc 1398	. . . . . 6 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇 ∧ 𝑋 ∈ 𝑇) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → (𝐺‘𝑃) ∈ 𝐴)
40	11, 37, 5, 6	ltrnat 40892	. . . . . . 7 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝑋 ∈ 𝑇 ∧ 𝑃 ∈ 𝐴) → (𝑋‘𝑃) ∈ 𝐴)
41	2, 15, 36, 40	syl3anc 1398	. . . . . 6 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇 ∧ 𝑋 ∈ 𝑇) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → (𝑋‘𝑃) ∈ 𝐴)
42	22, 30, 37	hlatjcl 40119	. . . . . 6 ⊢ ((𝐾 ∈ HL ∧ (𝐺‘𝑃) ∈ 𝐴 ∧ (𝑋‘𝑃) ∈ 𝐴) → ((𝐺‘𝑃) ∨ (𝑋‘𝑃)) ∈ 𝐵)
43	20, 39, 41, 42	syl3anc 1398	. . . . 5 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇 ∧ 𝑋 ∈ 𝑇) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → ((𝐺‘𝑃) ∨ (𝑋‘𝑃)) ∈ 𝐵)
44		cdlemk.m	. . . . . 6 ⊢ ∧ = (meet‘𝐾)
45	22, 11, 44	latmlem2 18527	. . . . 5 ⊢ ((𝐾 ∈ Lat ∧ (((𝑅‘(𝐺 ∘ ^◡𝐹)) ∨ (𝑅‘(𝑋 ∘ ^◡𝐹))) ∈ 𝐵 ∧ 𝑊 ∈ 𝐵 ∧ ((𝐺‘𝑃) ∨ (𝑋‘𝑃)) ∈ 𝐵)) → (((𝑅‘(𝐺 ∘ ^◡𝐹)) ∨ (𝑅‘(𝑋 ∘ ^◡𝐹))) ≤ 𝑊 → (((𝐺‘𝑃) ∨ (𝑋‘𝑃)) ∧ ((𝑅‘(𝐺 ∘ ^◡𝐹)) ∨ (𝑅‘(𝑋 ∘ ^◡𝐹)))) ≤ (((𝐺‘𝑃) ∨ (𝑋‘𝑃)) ∧ 𝑊)))
46	21, 35, 29, 43, 45	syl13anc 1399	. . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇 ∧ 𝑋 ∈ 𝑇) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → (((𝑅‘(𝐺 ∘ ^◡𝐹)) ∨ (𝑅‘(𝑋 ∘ ^◡𝐹))) ≤ 𝑊 → (((𝐺‘𝑃) ∨ (𝑋‘𝑃)) ∧ ((𝑅‘(𝐺 ∘ ^◡𝐹)) ∨ (𝑅‘(𝑋 ∘ ^◡𝐹)))) ≤ (((𝐺‘𝑃) ∨ (𝑋‘𝑃)) ∧ 𝑊)))
47	33, 46	mpd 16	. . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇 ∧ 𝑋 ∈ 𝑇) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → (((𝐺‘𝑃) ∨ (𝑋‘𝑃)) ∧ ((𝑅‘(𝐺 ∘ ^◡𝐹)) ∨ (𝑅‘(𝑋 ∘ ^◡𝐹)))) ≤ (((𝐺‘𝑃) ∨ (𝑋‘𝑃)) ∧ 𝑊))
48		simp3 1156	. . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇 ∧ 𝑋 ∈ 𝑇) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊))
49	22, 11, 30, 37, 5, 6, 12, 44	cdlemk9 41591	. . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐺 ∈ 𝑇 ∧ 𝑋 ∈ 𝑇) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → (((𝐺‘𝑃) ∨ (𝑋‘𝑃)) ∧ 𝑊) = (𝑅‘(𝑋 ∘ ^◡𝐺)))
50	20, 27, 3, 15, 48, 49	syl221anc 1408	. . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇 ∧ 𝑋 ∈ 𝑇) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → (((𝐺‘𝑃) ∨ (𝑋‘𝑃)) ∧ 𝑊) = (𝑅‘(𝑋 ∘ ^◡𝐺)))
51	47, 50	breqtrd 5138	. 2 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇 ∧ 𝑋 ∈ 𝑇) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → (((𝐺‘𝑃) ∨ (𝑋‘𝑃)) ∧ ((𝑅‘(𝐺 ∘ ^◡𝐹)) ∨ (𝑅‘(𝑋 ∘ ^◡𝐹)))) ≤ (𝑅‘(𝑋 ∘ ^◡𝐺)))
52	1, 51	eqbrtrid 5147	1 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇 ∧ 𝑋 ∈ 𝑇) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → 𝑉 ≤ (𝑅‘(𝑋 ∘ ^◡𝐺)))

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ↔ wb 209 ∧ wa 400 ∧ w3a 1103 = wceq 1570 ∈ wcel 2143 class class class wbr 5110 ^◡ccnv 5662 ∘ ccom 5667 ‘cfv 6538 (class class class)co 7412 Basecbs 17270 lecple 17318 joincjn 18368 meetcmee 18369 Latclat 18488 Atomscatm 40015 HLchlt 40102 LHypclh 40736 LTrncltrn 40853 trLctrl 40910

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1825 ax-4 1839 ax-5 1940 ax-6 1997 ax-7 2038 ax-8 2145 ax-9 2153 ax-10 2176 ax-11 2192 ax-12 2213 ax-ext 2735 ax-rep 5239 ax-sep 5258 ax-nul 5270 ax-pow 5338 ax-pr 5406 ax-un 7734 ax-riotaBAD 39705

This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1810 df-nf 1814 df-sb 2097 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 3369 df-reu 3370 df-rab 3417 df-v 3457 df-sbc 3746 df-csb 3855 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-nul 4288 df-if 4489 df-pw 4565 df-sn 4591 df-pr 4593 df-op 4597 df-uni 4874 df-iun 4959 df-iin 4960 df-br 5111 df-opab 5175 df-mpt 5194 df-id 5558 df-xp 5669 df-rel 5670 df-cnv 5671 df-co 5672 df-dm 5673 df-rn 5674 df-res 5675 df-ima 5676 df-iota 6494 df-fun 6540 df-fn 6541 df-f 6542 df-f1 6543 df-fo 6544 df-f1o 6545 df-fv 6546 df-riota 7369 df-ov 7415 df-oprab 7416 df-mpo 7417 df-1st 7987 df-2nd 7988 df-undef 8270 df-map 8827 df-proset 18351 df-poset 18370 df-plt 18385 df-lub 18401 df-glb 18402 df-join 18403 df-meet 18404 df-p0 18480 df-p1 18481 df-lat 18489 df-clat 18556 df-oposet 39928 df-ol 39930 df-oml 39931 df-covers 40018 df-ats 40019 df-atl 40050 df-cvlat 40074 df-hlat 40103 df-llines 40250 df-lplanes 40251 df-lvols 40252 df-lines 40253 df-psubsp 40255 df-pmap 40256 df-padd 40548 df-lhyp 40740 df-laut 40741 df-ldil 40856 df-ltrn 40857 df-trl 40911

This theorem is referenced by: cdlemk11 41601 cdlemk11u 41623

W3C validator