Theorem cdleme48gfv 39408

Description: TODO: fix comment. (Contributed by NM, 9-Apr-2013.)

Hypotheses

Ref	Expression
cdlemef46g.b	⊢ 𝐵 = (Base‘𝐾)
cdlemef46g.l	⊢ ≤ = (le‘𝐾)
cdlemef46g.j	⊢ ∨ = (join‘𝐾)
cdlemef46g.m	⊢ ∧ = (meet‘𝐾)
cdlemef46g.a	⊢ 𝐴 = (Atoms‘𝐾)
cdlemef46g.h	⊢ 𝐻 = (LHyp‘𝐾)
cdlemef46g.u	⊢ 𝑈 = ((𝑃 ∨ 𝑄) ∧ 𝑊)
cdlemef46g.d	⊢ 𝐷 = ((𝑡 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑡) ∧ 𝑊)))
cdlemefs46g.e	⊢ 𝐸 = ((𝑃 ∨ 𝑄) ∧ (𝐷 ∨ ((𝑠 ∨ 𝑡) ∧ 𝑊)))
cdlemef46g.f	⊢ 𝐹 = (𝑥 ∈ 𝐵 ↦ if((𝑃 ≠ 𝑄 ∧ ¬ 𝑥 ≤ 𝑊), (℩𝑧 ∈ 𝐵 ∀𝑠 ∈ 𝐴 ((¬ 𝑠 ≤ 𝑊 ∧ (𝑠 ∨ (𝑥 ∧ 𝑊)) = 𝑥) → 𝑧 = (if(𝑠 ≤ (𝑃 ∨ 𝑄), (℩𝑦 ∈ 𝐵 ∀𝑡 ∈ 𝐴 ((¬ 𝑡 ≤ 𝑊 ∧ ¬ 𝑡 ≤ (𝑃 ∨ 𝑄)) → 𝑦 = 𝐸)), ⦋𝑠 / 𝑡⦌𝐷) ∨ (𝑥 ∧ 𝑊)))), 𝑥))
cdlemef46.v	⊢ 𝑉 = ((𝑄 ∨ 𝑃) ∧ 𝑊)
cdlemef46.n	⊢ 𝑁 = ((𝑣 ∨ 𝑉) ∧ (𝑃 ∨ ((𝑄 ∨ 𝑣) ∧ 𝑊)))
cdlemefs46.o	⊢ 𝑂 = ((𝑄 ∨ 𝑃) ∧ (𝑁 ∨ ((𝑢 ∨ 𝑣) ∧ 𝑊)))
cdlemef46.g	⊢ 𝐺 = (𝑎 ∈ 𝐵 ↦ if((𝑄 ≠ 𝑃 ∧ ¬ 𝑎 ≤ 𝑊), (℩𝑐 ∈ 𝐵 ∀𝑢 ∈ 𝐴 ((¬ 𝑢 ≤ 𝑊 ∧ (𝑢 ∨ (𝑎 ∧ 𝑊)) = 𝑎) → 𝑐 = (if(𝑢 ≤ (𝑄 ∨ 𝑃), (℩𝑏 ∈ 𝐵 ∀𝑣 ∈ 𝐴 ((¬ 𝑣 ≤ 𝑊 ∧ ¬ 𝑣 ≤ (𝑄 ∨ 𝑃)) → 𝑏 = 𝑂)), ⦋𝑢 / 𝑣⦌𝑁) ∨ (𝑎 ∧ 𝑊)))), 𝑎))

Assertion

Ref	Expression
cdleme48gfv	⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ 𝑋 ∈ 𝐵) → (𝐺‘(𝐹‘𝑋)) = 𝑋)

Distinct variable groups:   𝑡,𝑠,𝑥,𝑦,𝑧,𝐴   𝐵,𝑠,𝑡,𝑥,𝑦,𝑧   𝐷,𝑠,𝑥,𝑦,𝑧   𝑥,𝐸,𝑦,𝑧   𝐻,𝑠,𝑡,𝑥,𝑦,𝑧   ∨ ,𝑠,𝑡,𝑥,𝑦,𝑧   𝐾,𝑠,𝑡,𝑥,𝑦,𝑧   ≤ ,𝑠,𝑡,𝑥,𝑦,𝑧   ∧ ,𝑠,𝑡,𝑥,𝑦,𝑧   𝑃,𝑠,𝑡,𝑥,𝑦,𝑧   𝑄,𝑠,𝑡,𝑥,𝑦,𝑧   𝑈,𝑠,𝑡,𝑥,𝑦,𝑧   𝑊,𝑠,𝑡,𝑥,𝑦,𝑧   𝑎,𝑏,𝑐,𝑢,𝑣,𝐴   𝐵,𝑎,𝑏,𝑐,𝑢,𝑣   𝑣,𝐷   𝐺,𝑠,𝑡,𝑥,𝑦,𝑧   𝐻,𝑎,𝑏,𝑐,𝑢,𝑣   ∨ ,𝑎,𝑏,𝑐,𝑢,𝑣   𝐾,𝑎,𝑏,𝑐,𝑢,𝑣   ≤ ,𝑎,𝑏,𝑐,𝑢,𝑣   ∧ ,𝑎,𝑏,𝑐,𝑢,𝑣   𝑁,𝑎,𝑏,𝑐   𝑂,𝑎,𝑏,𝑐   𝑃,𝑎,𝑏,𝑐,𝑢,𝑣   𝑄,𝑎,𝑏,𝑐,𝑢,𝑣   𝑉,𝑎,𝑏,𝑐   𝑊,𝑎,𝑏,𝑐,𝑢,𝑣,𝑥,𝑦,𝑧   𝑢,𝑁,𝑥,𝑦,𝑧   𝑥,𝑂,𝑦,𝑧   𝑣,𝑡   𝑢,𝑉   𝑥,𝑣,𝑦,𝑧,𝑉   𝐷,𝑎,𝑏,𝑐   𝐸,𝑎,𝑏,𝑐   𝐹,𝑎,𝑏,𝑐,𝑢,𝑣   𝑡,𝑁   𝑈,𝑎,𝑏,𝑐,𝑣   𝑡,𝑉   𝑠,𝑎,𝑡,𝑏,𝑐,𝑥,𝑦,𝑧,𝑢,𝑣   𝑋,𝑎,𝑐,𝑠,𝑡,𝑢,𝑣,𝑥,𝑧

Allowed substitution hints:   𝐷(𝑢,𝑡)   𝑈(𝑢)   𝐸(𝑣,𝑢,𝑡,𝑠)   𝐹(𝑥,𝑦,𝑧,𝑡,𝑠)   𝐺(𝑣,𝑢,𝑎,𝑏,𝑐)   𝑁(𝑣,𝑠)   𝑂(𝑣,𝑢,𝑡,𝑠)   𝑉(𝑠)   𝑋(𝑦,𝑏)

Proof of Theorem cdleme48gfv

Step	Hyp	Ref	Expression
1		simpll 766	. . 3 ⊢ (((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ 𝑋 ∈ 𝐵) ∧ (𝑃 ≠ 𝑄 ∧ ¬ 𝑋 ≤ 𝑊)) → ((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)))
2		simprl 770	. . 3 ⊢ (((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ 𝑋 ∈ 𝐵) ∧ (𝑃 ≠ 𝑄 ∧ ¬ 𝑋 ≤ 𝑊)) → 𝑃 ≠ 𝑄)
3		simplr 768	. . . 4 ⊢ (((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ 𝑋 ∈ 𝐵) ∧ (𝑃 ≠ 𝑄 ∧ ¬ 𝑋 ≤ 𝑊)) → 𝑋 ∈ 𝐵)
4		simprr 772	. . . 4 ⊢ (((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ 𝑋 ∈ 𝐵) ∧ (𝑃 ≠ 𝑄 ∧ ¬ 𝑋 ≤ 𝑊)) → ¬ 𝑋 ≤ 𝑊)
5	3, 4	jca 513	. . 3 ⊢ (((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ 𝑋 ∈ 𝐵) ∧ (𝑃 ≠ 𝑄 ∧ ¬ 𝑋 ≤ 𝑊)) → (𝑋 ∈ 𝐵 ∧ ¬ 𝑋 ≤ 𝑊))
6		cdlemef46g.b	. . . 4 ⊢ 𝐵 = (Base‘𝐾)
7		cdlemef46g.l	. . . 4 ⊢ ≤ = (le‘𝐾)
8		cdlemef46g.j	. . . 4 ⊢ ∨ = (join‘𝐾)
9		cdlemef46g.m	. . . 4 ⊢ ∧ = (meet‘𝐾)
10		cdlemef46g.a	. . . 4 ⊢ 𝐴 = (Atoms‘𝐾)
11		cdlemef46g.h	. . . 4 ⊢ 𝐻 = (LHyp‘𝐾)
12		cdlemef46g.u	. . . 4 ⊢ 𝑈 = ((𝑃 ∨ 𝑄) ∧ 𝑊)
13		cdlemef46g.d	. . . 4 ⊢ 𝐷 = ((𝑡 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑡) ∧ 𝑊)))
14		cdlemefs46g.e	. . . 4 ⊢ 𝐸 = ((𝑃 ∨ 𝑄) ∧ (𝐷 ∨ ((𝑠 ∨ 𝑡) ∧ 𝑊)))
15		cdlemef46g.f	. . . 4 ⊢ 𝐹 = (𝑥 ∈ 𝐵 ↦ if((𝑃 ≠ 𝑄 ∧ ¬ 𝑥 ≤ 𝑊), (℩𝑧 ∈ 𝐵 ∀𝑠 ∈ 𝐴 ((¬ 𝑠 ≤ 𝑊 ∧ (𝑠 ∨ (𝑥 ∧ 𝑊)) = 𝑥) → 𝑧 = (if(𝑠 ≤ (𝑃 ∨ 𝑄), (℩𝑦 ∈ 𝐵 ∀𝑡 ∈ 𝐴 ((¬ 𝑡 ≤ 𝑊 ∧ ¬ 𝑡 ≤ (𝑃 ∨ 𝑄)) → 𝑦 = 𝐸)), ⦋𝑠 / 𝑡⦌𝐷) ∨ (𝑥 ∧ 𝑊)))), 𝑥))
16		cdlemef46.v	. . . 4 ⊢ 𝑉 = ((𝑄 ∨ 𝑃) ∧ 𝑊)
17		cdlemef46.n	. . . 4 ⊢ 𝑁 = ((𝑣 ∨ 𝑉) ∧ (𝑃 ∨ ((𝑄 ∨ 𝑣) ∧ 𝑊)))
18		cdlemefs46.o	. . . 4 ⊢ 𝑂 = ((𝑄 ∨ 𝑃) ∧ (𝑁 ∨ ((𝑢 ∨ 𝑣) ∧ 𝑊)))
19		cdlemef46.g	. . . 4 ⊢ 𝐺 = (𝑎 ∈ 𝐵 ↦ if((𝑄 ≠ 𝑃 ∧ ¬ 𝑎 ≤ 𝑊), (℩𝑐 ∈ 𝐵 ∀𝑢 ∈ 𝐴 ((¬ 𝑢 ≤ 𝑊 ∧ (𝑢 ∨ (𝑎 ∧ 𝑊)) = 𝑎) → 𝑐 = (if(𝑢 ≤ (𝑄 ∨ 𝑃), (℩𝑏 ∈ 𝐵 ∀𝑣 ∈ 𝐴 ((¬ 𝑣 ≤ 𝑊 ∧ ¬ 𝑣 ≤ (𝑄 ∨ 𝑃)) → 𝑏 = 𝑂)), ⦋𝑢 / 𝑣⦌𝑁) ∨ (𝑎 ∧ 𝑊)))), 𝑎))
20	6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19	cdleme48gfv1 39407	. . 3 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝑃 ≠ 𝑄 ∧ (𝑋 ∈ 𝐵 ∧ ¬ 𝑋 ≤ 𝑊))) → (𝐺‘(𝐹‘𝑋)) = 𝑋)
21	1, 2, 5, 20	syl12anc 836	. 2 ⊢ (((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ 𝑋 ∈ 𝐵) ∧ (𝑃 ≠ 𝑄 ∧ ¬ 𝑋 ≤ 𝑊)) → (𝐺‘(𝐹‘𝑋)) = 𝑋)
22	15	cdleme31fv2 39264	. . . . . 6 ⊢ ((𝑋 ∈ 𝐵 ∧ ¬ (𝑃 ≠ 𝑄 ∧ ¬ 𝑋 ≤ 𝑊)) → (𝐹‘𝑋) = 𝑋)
23	22	adantll 713	. . . . 5 ⊢ (((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ 𝑋 ∈ 𝐵) ∧ ¬ (𝑃 ≠ 𝑄 ∧ ¬ 𝑋 ≤ 𝑊)) → (𝐹‘𝑋) = 𝑋)
24		simplr 768	. . . . 5 ⊢ (((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ 𝑋 ∈ 𝐵) ∧ ¬ (𝑃 ≠ 𝑄 ∧ ¬ 𝑋 ≤ 𝑊)) → 𝑋 ∈ 𝐵)
25	23, 24	eqeltrd 2834	. . . 4 ⊢ (((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ 𝑋 ∈ 𝐵) ∧ ¬ (𝑃 ≠ 𝑄 ∧ ¬ 𝑋 ≤ 𝑊)) → (𝐹‘𝑋) ∈ 𝐵)
26		simpr 486	. . . . 5 ⊢ (((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ 𝑋 ∈ 𝐵) ∧ ¬ (𝑃 ≠ 𝑄 ∧ ¬ 𝑋 ≤ 𝑊)) → ¬ (𝑃 ≠ 𝑄 ∧ ¬ 𝑋 ≤ 𝑊))
27		necom 2995	. . . . . . 7 ⊢ (𝑄 ≠ 𝑃 ↔ 𝑃 ≠ 𝑄)
28	27	a1i 11	. . . . . 6 ⊢ (((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ 𝑋 ∈ 𝐵) ∧ ¬ (𝑃 ≠ 𝑄 ∧ ¬ 𝑋 ≤ 𝑊)) → (𝑄 ≠ 𝑃 ↔ 𝑃 ≠ 𝑄))
29	23	breq1d 5159	. . . . . . 7 ⊢ (((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ 𝑋 ∈ 𝐵) ∧ ¬ (𝑃 ≠ 𝑄 ∧ ¬ 𝑋 ≤ 𝑊)) → ((𝐹‘𝑋) ≤ 𝑊 ↔ 𝑋 ≤ 𝑊))
30	29	notbid 318	. . . . . 6 ⊢ (((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ 𝑋 ∈ 𝐵) ∧ ¬ (𝑃 ≠ 𝑄 ∧ ¬ 𝑋 ≤ 𝑊)) → (¬ (𝐹‘𝑋) ≤ 𝑊 ↔ ¬ 𝑋 ≤ 𝑊))
31	28, 30	anbi12d 632	. . . . 5 ⊢ (((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ 𝑋 ∈ 𝐵) ∧ ¬ (𝑃 ≠ 𝑄 ∧ ¬ 𝑋 ≤ 𝑊)) → ((𝑄 ≠ 𝑃 ∧ ¬ (𝐹‘𝑋) ≤ 𝑊) ↔ (𝑃 ≠ 𝑄 ∧ ¬ 𝑋 ≤ 𝑊)))
32	26, 31	mtbird 325	. . . 4 ⊢ (((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ 𝑋 ∈ 𝐵) ∧ ¬ (𝑃 ≠ 𝑄 ∧ ¬ 𝑋 ≤ 𝑊)) → ¬ (𝑄 ≠ 𝑃 ∧ ¬ (𝐹‘𝑋) ≤ 𝑊))
33	19	cdleme31fv2 39264	. . . 4 ⊢ (((𝐹‘𝑋) ∈ 𝐵 ∧ ¬ (𝑄 ≠ 𝑃 ∧ ¬ (𝐹‘𝑋) ≤ 𝑊)) → (𝐺‘(𝐹‘𝑋)) = (𝐹‘𝑋))
34	25, 32, 33	syl2anc 585	. . 3 ⊢ (((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ 𝑋 ∈ 𝐵) ∧ ¬ (𝑃 ≠ 𝑄 ∧ ¬ 𝑋 ≤ 𝑊)) → (𝐺‘(𝐹‘𝑋)) = (𝐹‘𝑋))
35	34, 23	eqtrd 2773	. 2 ⊢ (((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ 𝑋 ∈ 𝐵) ∧ ¬ (𝑃 ≠ 𝑄 ∧ ¬ 𝑋 ≤ 𝑊)) → (𝐺‘(𝐹‘𝑋)) = 𝑋)
36	21, 35	pm2.61dan 812	1 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ 𝑋 ∈ 𝐵) → (𝐺‘(𝐹‘𝑋)) = 𝑋)

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 205   ∧ wa 397   ∧ w3a 1088   = wceq 1542   ∈ wcel 2107   ≠ wne 2941  ∀wral 3062  ⦋csb 3894  ifcif 4529   class class class wbr 5149   ↦ cmpt 5232  ‘cfv 6544  ℩crio 7364  (class class class)co 7409  Basecbs 17144  lecple 17204  joincjn 18264  meetcmee 18265  Atomscatm 38133  HLchlt 38220  LHypclh 38855

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2109  ax-9 2117  ax-10 2138  ax-11 2155  ax-12 2172  ax-ext 2704  ax-rep 5286  ax-sep 5300  ax-nul 5307  ax-pow 5364  ax-pr 5428  ax-un 7725  ax-riotaBAD 37823

This theorem depends on definitions:  df-bi 206  df-an 398  df-or 847  df-3or 1089  df-3an 1090  df-tru 1545  df-fal 1555  df-ex 1783  df-nf 1787  df-sb 2069  df-mo 2535  df-eu 2564  df-clab 2711  df-cleq 2725  df-clel 2811  df-nfc 2886  df-ne 2942  df-ral 3063  df-rex 3072  df-rmo 3377  df-reu 3378  df-rab 3434  df-v 3477  df-sbc 3779  df-csb 3895  df-dif 3952  df-un 3954  df-in 3956  df-ss 3966  df-nul 4324  df-if 4530  df-pw 4605  df-sn 4630  df-pr 4632  df-op 4636  df-uni 4910  df-iun 5000  df-iin 5001  df-br 5150  df-opab 5212  df-mpt 5233  df-id 5575  df-xp 5683  df-rel 5684  df-cnv 5685  df-co 5686  df-dm 5687  df-rn 5688  df-res 5689  df-ima 5690  df-iota 6496  df-fun 6546  df-fn 6547  df-f 6548  df-f1 6549  df-fo 6550  df-f1o 6551  df-fv 6552  df-riota 7365  df-ov 7412  df-oprab 7413  df-mpo 7414  df-1st 7975  df-2nd 7976  df-undef 8258  df-proset 18248  df-poset 18266  df-plt 18283  df-lub 18299  df-glb 18300  df-join 18301  df-meet 18302  df-p0 18378  df-p1 18379  df-lat 18385  df-clat 18452  df-oposet 38046  df-ol 38048  df-oml 38049  df-covers 38136  df-ats 38137  df-atl 38168  df-cvlat 38192  df-hlat 38221  df-llines 38369  df-lplanes 38370  df-lvols 38371  df-lines 38372  df-psubsp 38374  df-pmap 38375  df-padd 38667  df-lhyp 38859

This theorem is referenced by:  cdleme48fgv  39409  cdlemeg49lebilem  39410