Theorem cdlemeg47rv2 41535

Description: Value of g_s(r) when r is an atom under pq and s is any atom not under pq, using very compact hypotheses. TODO: FIX COMMENT. (Contributed by NM, 1-Apr-2013.)

Hypotheses

Ref	Expression
cdlemef47.b	⊢ 𝐵 = (Base‘𝐾)
cdlemef47.l	⊢ ≤ = (le‘𝐾)
cdlemef47.j	⊢ ∨ = (join‘𝐾)
cdlemef47.m	⊢ ∧ = (meet‘𝐾)
cdlemef47.a	⊢ 𝐴 = (Atoms‘𝐾)
cdlemef47.h	⊢ 𝐻 = (LHyp‘𝐾)
cdlemef47.v	⊢ 𝑉 = ((𝑄 ∨ 𝑃) ∧ 𝑊)
cdlemef47.n	⊢ 𝑁 = ((𝑣 ∨ 𝑉) ∧ (𝑃 ∨ ((𝑄 ∨ 𝑣) ∧ 𝑊)))
cdlemefs47.o	⊢ 𝑂 = ((𝑄 ∨ 𝑃) ∧ (𝑁 ∨ ((𝑢 ∨ 𝑣) ∧ 𝑊)))
cdlemef47.g	⊢ 𝐺 = (𝑎 ∈ 𝐵 ↦ if((𝑄 ≠ 𝑃 ∧ ¬ 𝑎 ≤ 𝑊), (℩𝑐 ∈ 𝐵 ∀𝑢 ∈ 𝐴 ((¬ 𝑢 ≤ 𝑊 ∧ (𝑢 ∨ (𝑎 ∧ 𝑊)) = 𝑎) → 𝑐 = (if(𝑢 ≤ (𝑄 ∨ 𝑃), (℩𝑏 ∈ 𝐵 ∀𝑣 ∈ 𝐴 ((¬ 𝑣 ≤ 𝑊 ∧ ¬ 𝑣 ≤ (𝑄 ∨ 𝑃)) → 𝑏 = 𝑂)), ⦋𝑢 / 𝑣⦌𝑁) ∨ (𝑎 ∧ 𝑊)))), 𝑎))

Assertion

Ref	Expression
cdlemeg47rv2	⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝑃 ≠ 𝑄 ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊) ∧ (𝑆 ∈ 𝐴 ∧ ¬ 𝑆 ≤ 𝑊)) ∧ (𝑅 ≤ (𝑃 ∨ 𝑄) ∧ ¬ 𝑆 ≤ (𝑃 ∨ 𝑄))) → (𝐺‘𝑅) = ((𝑄 ∨ 𝑃) ∧ ((𝐺‘𝑆) ∨ ((𝑅 ∨ 𝑆) ∧ 𝑊))))

Distinct variable groups:   𝑎,𝑏,𝑐,𝑢,𝑣,𝐴   𝐵,𝑎,𝑏,𝑐,𝑢,𝑣   𝐻,𝑎,𝑏,𝑐,𝑢,𝑣   ∨ ,𝑎,𝑏,𝑐,𝑢,𝑣   𝐾,𝑎,𝑏,𝑐,𝑢,𝑣   ≤ ,𝑎,𝑏,𝑐,𝑢,𝑣   ∧ ,𝑎,𝑏,𝑐,𝑢,𝑣   𝑁,𝑎,𝑏,𝑐,𝑢   𝑂,𝑎,𝑏,𝑐   𝑃,𝑎,𝑏,𝑐,𝑢,𝑣   𝑄,𝑎,𝑏,𝑐,𝑢,𝑣   𝑅,𝑎,𝑏,𝑐,𝑢,𝑣   𝑆,𝑎,𝑏,𝑐,𝑢,𝑣   𝑉,𝑎,𝑏,𝑐,𝑢,𝑣   𝑊,𝑎,𝑏,𝑐,𝑢,𝑣

Allowed substitution hints:   𝐺(𝑣, 𝑢, 𝑎, 𝑏, 𝑐)   𝑁(𝑣)   𝑂(𝑣, 𝑢)

Proof of Theorem cdlemeg47rv2

Step	Hyp	Ref	Expression
1		cdlemef47.b	. . 3 ⊢ 𝐵 = (Base‘𝐾)
2		cdlemef47.l	. . 3 ⊢ ≤ = (le‘𝐾)
3		cdlemef47.j	. . 3 ⊢ ∨ = (join‘𝐾)
4		cdlemef47.m	. . 3 ⊢ ∧ = (meet‘𝐾)
5		cdlemef47.a	. . 3 ⊢ 𝐴 = (Atoms‘𝐾)
6		cdlemef47.h	. . 3 ⊢ 𝐻 = (LHyp‘𝐾)
7		cdlemef47.v	. . 3 ⊢ 𝑉 = ((𝑄 ∨ 𝑃) ∧ 𝑊)
8		cdlemef47.n	. . 3 ⊢ 𝑁 = ((𝑣 ∨ 𝑉) ∧ (𝑃 ∨ ((𝑄 ∨ 𝑣) ∧ 𝑊)))
9		cdlemefs47.o	. . 3 ⊢ 𝑂 = ((𝑄 ∨ 𝑃) ∧ (𝑁 ∨ ((𝑢 ∨ 𝑣) ∧ 𝑊)))
10		cdlemef47.g	. . 3 ⊢ 𝐺 = (𝑎 ∈ 𝐵 ↦ if((𝑄 ≠ 𝑃 ∧ ¬ 𝑎 ≤ 𝑊), (℩𝑐 ∈ 𝐵 ∀𝑢 ∈ 𝐴 ((¬ 𝑢 ≤ 𝑊 ∧ (𝑢 ∨ (𝑎 ∧ 𝑊)) = 𝑎) → 𝑐 = (if(𝑢 ≤ (𝑄 ∨ 𝑃), (℩𝑏 ∈ 𝐵 ∀𝑣 ∈ 𝐴 ((¬ 𝑣 ≤ 𝑊 ∧ ¬ 𝑣 ≤ (𝑄 ∨ 𝑃)) → 𝑏 = 𝑂)), ⦋𝑢 / 𝑣⦌𝑁) ∨ (𝑎 ∧ 𝑊)))), 𝑎))
11	1, 2, 3, 4, 5, 6, 7, 8, 9, 10	cdlemeg47rv 41534	. 2 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝑃 ≠ 𝑄 ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊) ∧ (𝑆 ∈ 𝐴 ∧ ¬ 𝑆 ≤ 𝑊)) ∧ (𝑅 ≤ (𝑃 ∨ 𝑄) ∧ ¬ 𝑆 ≤ (𝑃 ∨ 𝑄))) → (𝐺‘𝑅) = ⦋𝑅 / 𝑢⦌⦋𝑆 / 𝑣⦌𝑂)
12		simp22l 1311	. . . 4 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝑃 ≠ 𝑄 ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊) ∧ (𝑆 ∈ 𝐴 ∧ ¬ 𝑆 ≤ 𝑊)) ∧ (𝑅 ≤ (𝑃 ∨ 𝑄) ∧ ¬ 𝑆 ≤ (𝑃 ∨ 𝑄))) → 𝑅 ∈ 𝐴)
13		nfcvd 2924	. . . . 5 ⊢ (𝑅 ∈ 𝐴 → Ⅎ𝑢((𝑄 ∨ 𝑃) ∧ (⦋𝑆 / 𝑣⦌𝑁 ∨ ((𝑅 ∨ 𝑆) ∧ 𝑊))))
14		oveq1 7419	. . . . . . . 8 ⊢ (𝑢 = 𝑅 → (𝑢 ∨ 𝑆) = (𝑅 ∨ 𝑆))
15	14	oveq1d 7427	. . . . . . 7 ⊢ (𝑢 = 𝑅 → ((𝑢 ∨ 𝑆) ∧ 𝑊) = ((𝑅 ∨ 𝑆) ∧ 𝑊))
16	15	oveq2d 7428	. . . . . 6 ⊢ (𝑢 = 𝑅 → (⦋𝑆 / 𝑣⦌𝑁 ∨ ((𝑢 ∨ 𝑆) ∧ 𝑊)) = (⦋𝑆 / 𝑣⦌𝑁 ∨ ((𝑅 ∨ 𝑆) ∧ 𝑊)))
17	16	oveq2d 7428	. . . . 5 ⊢ (𝑢 = 𝑅 → ((𝑄 ∨ 𝑃) ∧ (⦋𝑆 / 𝑣⦌𝑁 ∨ ((𝑢 ∨ 𝑆) ∧ 𝑊))) = ((𝑄 ∨ 𝑃) ∧ (⦋𝑆 / 𝑣⦌𝑁 ∨ ((𝑅 ∨ 𝑆) ∧ 𝑊))))
18	13, 17	csbiegf 3880	. . . 4 ⊢ (𝑅 ∈ 𝐴 → ⦋𝑅 / 𝑢⦌((𝑄 ∨ 𝑃) ∧ (⦋𝑆 / 𝑣⦌𝑁 ∨ ((𝑢 ∨ 𝑆) ∧ 𝑊))) = ((𝑄 ∨ 𝑃) ∧ (⦋𝑆 / 𝑣⦌𝑁 ∨ ((𝑅 ∨ 𝑆) ∧ 𝑊))))
19	12, 18	syl 18	. . 3 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝑃 ≠ 𝑄 ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊) ∧ (𝑆 ∈ 𝐴 ∧ ¬ 𝑆 ≤ 𝑊)) ∧ (𝑅 ≤ (𝑃 ∨ 𝑄) ∧ ¬ 𝑆 ≤ (𝑃 ∨ 𝑄))) → ⦋𝑅 / 𝑢⦌((𝑄 ∨ 𝑃) ∧ (⦋𝑆 / 𝑣⦌𝑁 ∨ ((𝑢 ∨ 𝑆) ∧ 𝑊))) = ((𝑄 ∨ 𝑃) ∧ (⦋𝑆 / 𝑣⦌𝑁 ∨ ((𝑅 ∨ 𝑆) ∧ 𝑊))))
20		simp23l 1313	. . . . 5 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝑃 ≠ 𝑄 ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊) ∧ (𝑆 ∈ 𝐴 ∧ ¬ 𝑆 ≤ 𝑊)) ∧ (𝑅 ≤ (𝑃 ∨ 𝑄) ∧ ¬ 𝑆 ≤ (𝑃 ∨ 𝑄))) → 𝑆 ∈ 𝐴)
21		eqid 2761	. . . . . 6 ⊢ ((𝑄 ∨ 𝑃) ∧ (⦋𝑆 / 𝑣⦌𝑁 ∨ ((𝑢 ∨ 𝑆) ∧ 𝑊))) = ((𝑄 ∨ 𝑃) ∧ (⦋𝑆 / 𝑣⦌𝑁 ∨ ((𝑢 ∨ 𝑆) ∧ 𝑊)))
22	9, 21	cdleme31se2 41408	. . . . 5 ⊢ (𝑆 ∈ 𝐴 → ⦋𝑆 / 𝑣⦌𝑂 = ((𝑄 ∨ 𝑃) ∧ (⦋𝑆 / 𝑣⦌𝑁 ∨ ((𝑢 ∨ 𝑆) ∧ 𝑊))))
23	20, 22	syl 18	. . . 4 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝑃 ≠ 𝑄 ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊) ∧ (𝑆 ∈ 𝐴 ∧ ¬ 𝑆 ≤ 𝑊)) ∧ (𝑅 ≤ (𝑃 ∨ 𝑄) ∧ ¬ 𝑆 ≤ (𝑃 ∨ 𝑄))) → ⦋𝑆 / 𝑣⦌𝑂 = ((𝑄 ∨ 𝑃) ∧ (⦋𝑆 / 𝑣⦌𝑁 ∨ ((𝑢 ∨ 𝑆) ∧ 𝑊))))
24	23	csbeq2dv 3854	. . 3 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝑃 ≠ 𝑄 ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊) ∧ (𝑆 ∈ 𝐴 ∧ ¬ 𝑆 ≤ 𝑊)) ∧ (𝑅 ≤ (𝑃 ∨ 𝑄) ∧ ¬ 𝑆 ≤ (𝑃 ∨ 𝑄))) → ⦋𝑅 / 𝑢⦌⦋𝑆 / 𝑣⦌𝑂 = ⦋𝑅 / 𝑢⦌((𝑄 ∨ 𝑃) ∧ (⦋𝑆 / 𝑣⦌𝑁 ∨ ((𝑢 ∨ 𝑆) ∧ 𝑊))))
25		simp1 1154	. . . . . 6 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝑃 ≠ 𝑄 ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊) ∧ (𝑆 ∈ 𝐴 ∧ ¬ 𝑆 ≤ 𝑊)) ∧ (𝑅 ≤ (𝑃 ∨ 𝑄) ∧ ¬ 𝑆 ≤ (𝑃 ∨ 𝑄))) → ((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)))
26		simp21 1225	. . . . . 6 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝑃 ≠ 𝑄 ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊) ∧ (𝑆 ∈ 𝐴 ∧ ¬ 𝑆 ≤ 𝑊)) ∧ (𝑅 ≤ (𝑃 ∨ 𝑄) ∧ ¬ 𝑆 ≤ (𝑃 ∨ 𝑄))) → 𝑃 ≠ 𝑄)
27		simp23 1227	. . . . . 6 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝑃 ≠ 𝑄 ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊) ∧ (𝑆 ∈ 𝐴 ∧ ¬ 𝑆 ≤ 𝑊)) ∧ (𝑅 ≤ (𝑃 ∨ 𝑄) ∧ ¬ 𝑆 ≤ (𝑃 ∨ 𝑄))) → (𝑆 ∈ 𝐴 ∧ ¬ 𝑆 ≤ 𝑊))
28		simp3r 1221	. . . . . 6 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝑃 ≠ 𝑄 ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊) ∧ (𝑆 ∈ 𝐴 ∧ ¬ 𝑆 ≤ 𝑊)) ∧ (𝑅 ≤ (𝑃 ∨ 𝑄) ∧ ¬ 𝑆 ≤ (𝑃 ∨ 𝑄))) → ¬ 𝑆 ≤ (𝑃 ∨ 𝑄))
29	1, 2, 3, 4, 5, 6, 7, 8, 9, 10	cdlemeg47b 41533	. . . . . 6 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝑃 ≠ 𝑄 ∧ (𝑆 ∈ 𝐴 ∧ ¬ 𝑆 ≤ 𝑊)) ∧ ¬ 𝑆 ≤ (𝑃 ∨ 𝑄)) → (𝐺‘𝑆) = ⦋𝑆 / 𝑣⦌𝑁)
30	25, 26, 27, 28, 29	syl121anc 1402	. . . . 5 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝑃 ≠ 𝑄 ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊) ∧ (𝑆 ∈ 𝐴 ∧ ¬ 𝑆 ≤ 𝑊)) ∧ (𝑅 ≤ (𝑃 ∨ 𝑄) ∧ ¬ 𝑆 ≤ (𝑃 ∨ 𝑄))) → (𝐺‘𝑆) = ⦋𝑆 / 𝑣⦌𝑁)
31	30	oveq1d 7427	. . . 4 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝑃 ≠ 𝑄 ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊) ∧ (𝑆 ∈ 𝐴 ∧ ¬ 𝑆 ≤ 𝑊)) ∧ (𝑅 ≤ (𝑃 ∨ 𝑄) ∧ ¬ 𝑆 ≤ (𝑃 ∨ 𝑄))) → ((𝐺‘𝑆) ∨ ((𝑅 ∨ 𝑆) ∧ 𝑊)) = (⦋𝑆 / 𝑣⦌𝑁 ∨ ((𝑅 ∨ 𝑆) ∧ 𝑊)))
32	31	oveq2d 7428	. . 3 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝑃 ≠ 𝑄 ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊) ∧ (𝑆 ∈ 𝐴 ∧ ¬ 𝑆 ≤ 𝑊)) ∧ (𝑅 ≤ (𝑃 ∨ 𝑄) ∧ ¬ 𝑆 ≤ (𝑃 ∨ 𝑄))) → ((𝑄 ∨ 𝑃) ∧ ((𝐺‘𝑆) ∨ ((𝑅 ∨ 𝑆) ∧ 𝑊))) = ((𝑄 ∨ 𝑃) ∧ (⦋𝑆 / 𝑣⦌𝑁 ∨ ((𝑅 ∨ 𝑆) ∧ 𝑊))))
33	19, 24, 32	3eqtr4d 2806	. 2 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝑃 ≠ 𝑄 ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊) ∧ (𝑆 ∈ 𝐴 ∧ ¬ 𝑆 ≤ 𝑊)) ∧ (𝑅 ≤ (𝑃 ∨ 𝑄) ∧ ¬ 𝑆 ≤ (𝑃 ∨ 𝑄))) → ⦋𝑅 / 𝑢⦌⦋𝑆 / 𝑣⦌𝑂 = ((𝑄 ∨ 𝑃) ∧ ((𝐺‘𝑆) ∨ ((𝑅 ∨ 𝑆) ∧ 𝑊))))
34	11, 33	eqtrd 2796	1 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝑃 ≠ 𝑄 ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊) ∧ (𝑆 ∈ 𝐴 ∧ ¬ 𝑆 ≤ 𝑊)) ∧ (𝑅 ≤ (𝑃 ∨ 𝑄) ∧ ¬ 𝑆 ≤ (𝑃 ∨ 𝑄))) → (𝐺‘𝑅) = ((𝑄 ∨ 𝑃) ∧ ((𝐺‘𝑆) ∨ ((𝑅 ∨ 𝑆) ∧ 𝑊))))

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2145   ≠ wne 2956  ∀wral 3077  ⦋csb 3847  ifcif 4482   class class class wbr 5103   ↦ cmpt 5186  ‘cfv 6531  ℩crio 7368  (class class class)co 7412  Basecbs 17367  lecple 17415  joincjn 18465  meetcmee 18466  Atomscatm 40288  HLchlt 40375  LHypclh 41009

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2733  ax-rep 5232  ax-sep 5249  ax-nul 5260  ax-pow 5327  ax-pr 5391  ax-un 7740  ax-riotaBAD 39978

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-rmo 3366  df-reu 3367  df-rab 3414  df-v 3453  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-iun 4953  df-iin 4954  df-br 5104  df-opab 5168  df-mpt 5187  df-id 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-iota 6487  df-fun 6533  df-fn 6534  df-f 6535  df-f1 6536  df-fo 6537  df-f1o 6538  df-fv 6539  df-riota 7369  df-ov 7415  df-oprab 7416  df-mpo 7417  df-1st 7990  df-2nd 7991  df-undef 8274  df-proset 18448  df-poset 18467  df-plt 18482  df-lub 18498  df-glb 18499  df-join 18500  df-meet 18501  df-p0 18577  df-p1 18578  df-lat 18586  df-clat 18653  df-oposet 40201  df-ol 40203  df-oml 40204  df-covers 40291  df-ats 40292  df-atl 40323  df-cvlat 40347  df-hlat 40376  df-llines 40523  df-lplanes 40524  df-lvols 40525  df-lines 40526  df-psubsp 40528  df-pmap 40529  df-padd 40821  df-lhyp 41013

This theorem is used by:  cdlemeg46rv2OLDN  41540  cdlemeg46gfv  41555