Theorem cdleme28 39757

Description: Quantified version of cdleme28c 39756. (Compare cdleme24 39736.) (Contributed by NM, 7-Feb-2013.)

Hypotheses

Ref	Expression
cdleme26.b	⊢ 𝐵 = (Base‘𝐾)
cdleme26.l	⊢ ≤ = (le‘𝐾)
cdleme26.j	⊢ ∨ = (join‘𝐾)
cdleme26.m	⊢ ∧ = (meet‘𝐾)
cdleme26.a	⊢ 𝐴 = (Atoms‘𝐾)
cdleme26.h	⊢ 𝐻 = (LHyp‘𝐾)
cdleme27.u	⊢ 𝑈 = ((𝑃 ∨ 𝑄) ∧ 𝑊)
cdleme27.f	⊢ 𝐹 = ((𝑠 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑠) ∧ 𝑊)))
cdleme27.z	⊢ 𝑍 = ((𝑧 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑧) ∧ 𝑊)))
cdleme27.n	⊢ 𝑁 = ((𝑃 ∨ 𝑄) ∧ (𝑍 ∨ ((𝑠 ∨ 𝑧) ∧ 𝑊)))
cdleme27.d	⊢ 𝐷 = (℩𝑢 ∈ 𝐵 ∀𝑧 ∈ 𝐴 ((¬ 𝑧 ≤ 𝑊 ∧ ¬ 𝑧 ≤ (𝑃 ∨ 𝑄)) → 𝑢 = 𝑁))
cdleme27.c	⊢ 𝐶 = if(𝑠 ≤ (𝑃 ∨ 𝑄), 𝐷, 𝐹)
cdleme27.g	⊢ 𝐺 = ((𝑡 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑡) ∧ 𝑊)))
cdleme27.o	⊢ 𝑂 = ((𝑃 ∨ 𝑄) ∧ (𝑍 ∨ ((𝑡 ∨ 𝑧) ∧ 𝑊)))
cdleme27.e	⊢ 𝐸 = (℩𝑢 ∈ 𝐵 ∀𝑧 ∈ 𝐴 ((¬ 𝑧 ≤ 𝑊 ∧ ¬ 𝑧 ≤ (𝑃 ∨ 𝑄)) → 𝑢 = 𝑂))
cdleme27.y	⊢ 𝑌 = if(𝑡 ≤ (𝑃 ∨ 𝑄), 𝐸, 𝐺)

Assertion

Ref	Expression
cdleme28	⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ 𝑃 ≠ 𝑄 ∧ (𝑋 ∈ 𝐵 ∧ ¬ 𝑋 ≤ 𝑊)) → ∀𝑠 ∈ 𝐴 ∀𝑡 ∈ 𝐴 (((¬ 𝑠 ≤ 𝑊 ∧ (𝑠 ∨ (𝑋 ∧ 𝑊)) = 𝑋) ∧ (¬ 𝑡 ≤ 𝑊 ∧ (𝑡 ∨ (𝑋 ∧ 𝑊)) = 𝑋)) → (𝐶 ∨ (𝑋 ∧ 𝑊)) = (𝑌 ∨ (𝑋 ∧ 𝑊))))

Distinct variable groups:   𝑡,𝑠,𝑢,𝑧,𝐴   𝐵,𝑠,𝑡,𝑢,𝑧   𝑢,𝐹   𝑢,𝐺   𝐻,𝑠,𝑡,𝑧   ∨ ,𝑠,𝑡,𝑢,𝑧   𝐾,𝑠,𝑡,𝑧   ≤ ,𝑠,𝑡,𝑢,𝑧   ∧ ,𝑠,𝑡,𝑢,𝑧   𝑡,𝑁,𝑢   𝑂,𝑠,𝑢   𝑃,𝑠,𝑡,𝑢,𝑧   𝑄,𝑠,𝑡,𝑢,𝑧   𝑈,𝑠,𝑡,𝑢,𝑧   𝑊,𝑠,𝑡,𝑢,𝑧   𝑋,𝑠,𝑧,𝑡

Allowed substitution hints:   𝐶(𝑧,𝑢,𝑡,𝑠)   𝐷(𝑧,𝑢,𝑡,𝑠)   𝐸(𝑧,𝑢,𝑡,𝑠)   𝐹(𝑧,𝑡,𝑠)   𝐺(𝑧,𝑡,𝑠)   𝐻(𝑢)   𝐾(𝑢)   𝑁(𝑧,𝑠)   𝑂(𝑧,𝑡)   𝑋(𝑢)   𝑌(𝑧,𝑢,𝑡,𝑠)   𝑍(𝑧,𝑢,𝑡,𝑠)

Proof of Theorem cdleme28

Step	Hyp	Ref	Expression
1		simp11 1200	. . . 4 ⊢ (((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ 𝑃 ≠ 𝑄 ∧ (𝑋 ∈ 𝐵 ∧ ¬ 𝑋 ≤ 𝑊)) ∧ (𝑠 ∈ 𝐴 ∧ 𝑡 ∈ 𝐴) ∧ ((¬ 𝑠 ≤ 𝑊 ∧ (𝑠 ∨ (𝑋 ∧ 𝑊)) = 𝑋) ∧ (¬ 𝑡 ≤ 𝑊 ∧ (𝑡 ∨ (𝑋 ∧ 𝑊)) = 𝑋))) → ((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)))
2		simp12 1201	. . . 4 ⊢ (((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ 𝑃 ≠ 𝑄 ∧ (𝑋 ∈ 𝐵 ∧ ¬ 𝑋 ≤ 𝑊)) ∧ (𝑠 ∈ 𝐴 ∧ 𝑡 ∈ 𝐴) ∧ ((¬ 𝑠 ≤ 𝑊 ∧ (𝑠 ∨ (𝑋 ∧ 𝑊)) = 𝑋) ∧ (¬ 𝑡 ≤ 𝑊 ∧ (𝑡 ∨ (𝑋 ∧ 𝑊)) = 𝑋))) → 𝑃 ≠ 𝑄)
3		simp2l 1196	. . . . 5 ⊢ (((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ 𝑃 ≠ 𝑄 ∧ (𝑋 ∈ 𝐵 ∧ ¬ 𝑋 ≤ 𝑊)) ∧ (𝑠 ∈ 𝐴 ∧ 𝑡 ∈ 𝐴) ∧ ((¬ 𝑠 ≤ 𝑊 ∧ (𝑠 ∨ (𝑋 ∧ 𝑊)) = 𝑋) ∧ (¬ 𝑡 ≤ 𝑊 ∧ (𝑡 ∨ (𝑋 ∧ 𝑊)) = 𝑋))) → 𝑠 ∈ 𝐴)
4		simp3ll 1241	. . . . 5 ⊢ (((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ 𝑃 ≠ 𝑄 ∧ (𝑋 ∈ 𝐵 ∧ ¬ 𝑋 ≤ 𝑊)) ∧ (𝑠 ∈ 𝐴 ∧ 𝑡 ∈ 𝐴) ∧ ((¬ 𝑠 ≤ 𝑊 ∧ (𝑠 ∨ (𝑋 ∧ 𝑊)) = 𝑋) ∧ (¬ 𝑡 ≤ 𝑊 ∧ (𝑡 ∨ (𝑋 ∧ 𝑊)) = 𝑋))) → ¬ 𝑠 ≤ 𝑊)
5	3, 4	jca 511	. . . 4 ⊢ (((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ 𝑃 ≠ 𝑄 ∧ (𝑋 ∈ 𝐵 ∧ ¬ 𝑋 ≤ 𝑊)) ∧ (𝑠 ∈ 𝐴 ∧ 𝑡 ∈ 𝐴) ∧ ((¬ 𝑠 ≤ 𝑊 ∧ (𝑠 ∨ (𝑋 ∧ 𝑊)) = 𝑋) ∧ (¬ 𝑡 ≤ 𝑊 ∧ (𝑡 ∨ (𝑋 ∧ 𝑊)) = 𝑋))) → (𝑠 ∈ 𝐴 ∧ ¬ 𝑠 ≤ 𝑊))
6		simp2r 1197	. . . . 5 ⊢ (((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ 𝑃 ≠ 𝑄 ∧ (𝑋 ∈ 𝐵 ∧ ¬ 𝑋 ≤ 𝑊)) ∧ (𝑠 ∈ 𝐴 ∧ 𝑡 ∈ 𝐴) ∧ ((¬ 𝑠 ≤ 𝑊 ∧ (𝑠 ∨ (𝑋 ∧ 𝑊)) = 𝑋) ∧ (¬ 𝑡 ≤ 𝑊 ∧ (𝑡 ∨ (𝑋 ∧ 𝑊)) = 𝑋))) → 𝑡 ∈ 𝐴)
7		simp3rl 1243	. . . . 5 ⊢ (((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ 𝑃 ≠ 𝑄 ∧ (𝑋 ∈ 𝐵 ∧ ¬ 𝑋 ≤ 𝑊)) ∧ (𝑠 ∈ 𝐴 ∧ 𝑡 ∈ 𝐴) ∧ ((¬ 𝑠 ≤ 𝑊 ∧ (𝑠 ∨ (𝑋 ∧ 𝑊)) = 𝑋) ∧ (¬ 𝑡 ≤ 𝑊 ∧ (𝑡 ∨ (𝑋 ∧ 𝑊)) = 𝑋))) → ¬ 𝑡 ≤ 𝑊)
8	6, 7	jca 511	. . . 4 ⊢ (((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ 𝑃 ≠ 𝑄 ∧ (𝑋 ∈ 𝐵 ∧ ¬ 𝑋 ≤ 𝑊)) ∧ (𝑠 ∈ 𝐴 ∧ 𝑡 ∈ 𝐴) ∧ ((¬ 𝑠 ≤ 𝑊 ∧ (𝑠 ∨ (𝑋 ∧ 𝑊)) = 𝑋) ∧ (¬ 𝑡 ≤ 𝑊 ∧ (𝑡 ∨ (𝑋 ∧ 𝑊)) = 𝑋))) → (𝑡 ∈ 𝐴 ∧ ¬ 𝑡 ≤ 𝑊))
9		simp3lr 1242	. . . 4 ⊢ (((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ 𝑃 ≠ 𝑄 ∧ (𝑋 ∈ 𝐵 ∧ ¬ 𝑋 ≤ 𝑊)) ∧ (𝑠 ∈ 𝐴 ∧ 𝑡 ∈ 𝐴) ∧ ((¬ 𝑠 ≤ 𝑊 ∧ (𝑠 ∨ (𝑋 ∧ 𝑊)) = 𝑋) ∧ (¬ 𝑡 ≤ 𝑊 ∧ (𝑡 ∨ (𝑋 ∧ 𝑊)) = 𝑋))) → (𝑠 ∨ (𝑋 ∧ 𝑊)) = 𝑋)
10		simp3rr 1244	. . . 4 ⊢ (((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ 𝑃 ≠ 𝑄 ∧ (𝑋 ∈ 𝐵 ∧ ¬ 𝑋 ≤ 𝑊)) ∧ (𝑠 ∈ 𝐴 ∧ 𝑡 ∈ 𝐴) ∧ ((¬ 𝑠 ≤ 𝑊 ∧ (𝑠 ∨ (𝑋 ∧ 𝑊)) = 𝑋) ∧ (¬ 𝑡 ≤ 𝑊 ∧ (𝑡 ∨ (𝑋 ∧ 𝑊)) = 𝑋))) → (𝑡 ∨ (𝑋 ∧ 𝑊)) = 𝑋)
11		simp13 1202	. . . 4 ⊢ (((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ 𝑃 ≠ 𝑄 ∧ (𝑋 ∈ 𝐵 ∧ ¬ 𝑋 ≤ 𝑊)) ∧ (𝑠 ∈ 𝐴 ∧ 𝑡 ∈ 𝐴) ∧ ((¬ 𝑠 ≤ 𝑊 ∧ (𝑠 ∨ (𝑋 ∧ 𝑊)) = 𝑋) ∧ (¬ 𝑡 ≤ 𝑊 ∧ (𝑡 ∨ (𝑋 ∧ 𝑊)) = 𝑋))) → (𝑋 ∈ 𝐵 ∧ ¬ 𝑋 ≤ 𝑊))
12		cdleme26.b	. . . . 5 ⊢ 𝐵 = (Base‘𝐾)
13		cdleme26.l	. . . . 5 ⊢ ≤ = (le‘𝐾)
14		cdleme26.j	. . . . 5 ⊢ ∨ = (join‘𝐾)
15		cdleme26.m	. . . . 5 ⊢ ∧ = (meet‘𝐾)
16		cdleme26.a	. . . . 5 ⊢ 𝐴 = (Atoms‘𝐾)
17		cdleme26.h	. . . . 5 ⊢ 𝐻 = (LHyp‘𝐾)
18		cdleme27.u	. . . . 5 ⊢ 𝑈 = ((𝑃 ∨ 𝑄) ∧ 𝑊)
19		cdleme27.f	. . . . 5 ⊢ 𝐹 = ((𝑠 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑠) ∧ 𝑊)))
20		cdleme27.z	. . . . 5 ⊢ 𝑍 = ((𝑧 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑧) ∧ 𝑊)))
21		cdleme27.n	. . . . 5 ⊢ 𝑁 = ((𝑃 ∨ 𝑄) ∧ (𝑍 ∨ ((𝑠 ∨ 𝑧) ∧ 𝑊)))
22		cdleme27.d	. . . . 5 ⊢ 𝐷 = (℩𝑢 ∈ 𝐵 ∀𝑧 ∈ 𝐴 ((¬ 𝑧 ≤ 𝑊 ∧ ¬ 𝑧 ≤ (𝑃 ∨ 𝑄)) → 𝑢 = 𝑁))
23		cdleme27.c	. . . . 5 ⊢ 𝐶 = if(𝑠 ≤ (𝑃 ∨ 𝑄), 𝐷, 𝐹)
24		cdleme27.g	. . . . 5 ⊢ 𝐺 = ((𝑡 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑡) ∧ 𝑊)))
25		cdleme27.o	. . . . 5 ⊢ 𝑂 = ((𝑃 ∨ 𝑄) ∧ (𝑍 ∨ ((𝑡 ∨ 𝑧) ∧ 𝑊)))
26		cdleme27.e	. . . . 5 ⊢ 𝐸 = (℩𝑢 ∈ 𝐵 ∀𝑧 ∈ 𝐴 ((¬ 𝑧 ≤ 𝑊 ∧ ¬ 𝑧 ≤ (𝑃 ∨ 𝑄)) → 𝑢 = 𝑂))
27		cdleme27.y	. . . . 5 ⊢ 𝑌 = if(𝑡 ≤ (𝑃 ∨ 𝑄), 𝐸, 𝐺)
28	12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27	cdleme28c 39756	. . . 4 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝑃 ≠ 𝑄 ∧ (𝑠 ∈ 𝐴 ∧ ¬ 𝑠 ≤ 𝑊) ∧ (𝑡 ∈ 𝐴 ∧ ¬ 𝑡 ≤ 𝑊)) ∧ ((𝑠 ∨ (𝑋 ∧ 𝑊)) = 𝑋 ∧ (𝑡 ∨ (𝑋 ∧ 𝑊)) = 𝑋 ∧ (𝑋 ∈ 𝐵 ∧ ¬ 𝑋 ≤ 𝑊))) → (𝐶 ∨ (𝑋 ∧ 𝑊)) = (𝑌 ∨ (𝑋 ∧ 𝑊)))
29	1, 2, 5, 8, 9, 10, 11, 28	syl133anc 1390	. . 3 ⊢ (((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ 𝑃 ≠ 𝑄 ∧ (𝑋 ∈ 𝐵 ∧ ¬ 𝑋 ≤ 𝑊)) ∧ (𝑠 ∈ 𝐴 ∧ 𝑡 ∈ 𝐴) ∧ ((¬ 𝑠 ≤ 𝑊 ∧ (𝑠 ∨ (𝑋 ∧ 𝑊)) = 𝑋) ∧ (¬ 𝑡 ≤ 𝑊 ∧ (𝑡 ∨ (𝑋 ∧ 𝑊)) = 𝑋))) → (𝐶 ∨ (𝑋 ∧ 𝑊)) = (𝑌 ∨ (𝑋 ∧ 𝑊)))
30	29	3exp 1116	. 2 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ 𝑃 ≠ 𝑄 ∧ (𝑋 ∈ 𝐵 ∧ ¬ 𝑋 ≤ 𝑊)) → ((𝑠 ∈ 𝐴 ∧ 𝑡 ∈ 𝐴) → (((¬ 𝑠 ≤ 𝑊 ∧ (𝑠 ∨ (𝑋 ∧ 𝑊)) = 𝑋) ∧ (¬ 𝑡 ≤ 𝑊 ∧ (𝑡 ∨ (𝑋 ∧ 𝑊)) = 𝑋)) → (𝐶 ∨ (𝑋 ∧ 𝑊)) = (𝑌 ∨ (𝑋 ∧ 𝑊)))))
31	30	ralrimivv 3192	1 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ 𝑃 ≠ 𝑄 ∧ (𝑋 ∈ 𝐵 ∧ ¬ 𝑋 ≤ 𝑊)) → ∀𝑠 ∈ 𝐴 ∀𝑡 ∈ 𝐴 (((¬ 𝑠 ≤ 𝑊 ∧ (𝑠 ∨ (𝑋 ∧ 𝑊)) = 𝑋) ∧ (¬ 𝑡 ≤ 𝑊 ∧ (𝑡 ∨ (𝑋 ∧ 𝑊)) = 𝑋)) → (𝐶 ∨ (𝑋 ∧ 𝑊)) = (𝑌 ∨ (𝑋 ∧ 𝑊))))

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 395   ∧ w3a 1084   = wceq 1533   ∈ wcel 2098   ≠ wne 2934  ∀wral 3055  ifcif 4523   class class class wbr 5141  ‘cfv 6537  ℩crio 7360  (class class class)co 7405  Basecbs 17153  lecple 17213  joincjn 18276  meetcmee 18277  Atomscatm 38646  HLchlt 38733  LHypclh 39368

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1789  ax-4 1803  ax-5 1905  ax-6 1963  ax-7 2003  ax-8 2100  ax-9 2108  ax-10 2129  ax-11 2146  ax-12 2163  ax-ext 2697  ax-rep 5278  ax-sep 5292  ax-nul 5299  ax-pow 5356  ax-pr 5420  ax-un 7722  ax-riotaBAD 38336

This theorem depends on definitions:  df-bi 206  df-an 396  df-or 845  df-3or 1085  df-3an 1086  df-tru 1536  df-fal 1546  df-ex 1774  df-nf 1778  df-sb 2060  df-mo 2528  df-eu 2557  df-clab 2704  df-cleq 2718  df-clel 2804  df-nfc 2879  df-ne 2935  df-ral 3056  df-rex 3065  df-rmo 3370  df-reu 3371  df-rab 3427  df-v 3470  df-sbc 3773  df-csb 3889  df-dif 3946  df-un 3948  df-in 3950  df-ss 3960  df-nul 4318  df-if 4524  df-pw 4599  df-sn 4624  df-pr 4626  df-op 4630  df-uni 4903  df-iun 4992  df-iin 4993  df-br 5142  df-opab 5204  df-mpt 5225  df-id 5567  df-xp 5675  df-rel 5676  df-cnv 5677  df-co 5678  df-dm 5679  df-rn 5680  df-res 5681  df-ima 5682  df-iota 6489  df-fun 6539  df-fn 6540  df-f 6541  df-f1 6542  df-fo 6543  df-f1o 6544  df-fv 6545  df-riota 7361  df-ov 7408  df-oprab 7409  df-mpo 7410  df-1st 7974  df-2nd 7975  df-undef 8259  df-proset 18260  df-poset 18278  df-plt 18295  df-lub 18311  df-glb 18312  df-join 18313  df-meet 18314  df-p0 18390  df-p1 18391  df-lat 18397  df-clat 18464  df-oposet 38559  df-ol 38561  df-oml 38562  df-covers 38649  df-ats 38650  df-atl 38681  df-cvlat 38705  df-hlat 38734  df-llines 38882  df-lplanes 38883  df-lvols 38884  df-lines 38885  df-psubsp 38887  df-pmap 38888  df-padd 39180  df-lhyp 39372

This theorem is referenced by:  cdleme29b  39759