Theorem 4atlem3a 40391

Description: Lemma for 4at 40407. Break inequality into 3 cases. (Contributed by NM, 9-Jul-2012.)

Hypotheses

Ref	Expression
4at.l	⊢ ≤ = (le‘𝐾)
4at.j	⊢ ∨ = (join‘𝐾)
4at.a	⊢ 𝐴 = (Atoms‘𝐾)

Assertion

Ref	Expression
4atlem3a	⊢ ((((𝐾 ∈ HL ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴) ∧ (𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴) ∧ (𝑈 ∈ 𝐴 ∧ 𝑉 ∈ 𝐴)) ∧ (𝑃 ≠ 𝑄 ∧ ¬ 𝑅 ≤ (𝑃 ∨ 𝑄) ∧ ¬ 𝑆 ≤ ((𝑃 ∨ 𝑄) ∨ 𝑅))) → (¬ 𝑄 ≤ ((𝑃 ∨ 𝑈) ∨ 𝑉) ∨ ¬ 𝑅 ≤ ((𝑃 ∨ 𝑈) ∨ 𝑉) ∨ ¬ 𝑆 ≤ ((𝑃 ∨ 𝑈) ∨ 𝑉)))

Proof of Theorem 4atlem3a

Step	Hyp	Ref	Expression
1		simpl1 1210	. . . 4 ⊢ ((((𝐾 ∈ HL ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴) ∧ (𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴) ∧ (𝑈 ∈ 𝐴 ∧ 𝑉 ∈ 𝐴)) ∧ (𝑃 ≠ 𝑄 ∧ ¬ 𝑅 ≤ (𝑃 ∨ 𝑄) ∧ ¬ 𝑆 ≤ ((𝑃 ∨ 𝑄) ∨ 𝑅))) → (𝐾 ∈ HL ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴))
2		simpl2l 1245	. . . . 5 ⊢ ((((𝐾 ∈ HL ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴) ∧ (𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴) ∧ (𝑈 ∈ 𝐴 ∧ 𝑉 ∈ 𝐴)) ∧ (𝑃 ≠ 𝑄 ∧ ¬ 𝑅 ≤ (𝑃 ∨ 𝑄) ∧ ¬ 𝑆 ≤ ((𝑃 ∨ 𝑄) ∨ 𝑅))) → 𝑅 ∈ 𝐴)
3		simpl2r 1246	. . . . 5 ⊢ ((((𝐾 ∈ HL ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴) ∧ (𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴) ∧ (𝑈 ∈ 𝐴 ∧ 𝑉 ∈ 𝐴)) ∧ (𝑃 ≠ 𝑄 ∧ ¬ 𝑅 ≤ (𝑃 ∨ 𝑄) ∧ ¬ 𝑆 ≤ ((𝑃 ∨ 𝑄) ∨ 𝑅))) → 𝑆 ∈ 𝐴)
4		simpl12 1268	. . . . 5 ⊢ ((((𝐾 ∈ HL ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴) ∧ (𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴) ∧ (𝑈 ∈ 𝐴 ∧ 𝑉 ∈ 𝐴)) ∧ (𝑃 ≠ 𝑄 ∧ ¬ 𝑅 ≤ (𝑃 ∨ 𝑄) ∧ ¬ 𝑆 ≤ ((𝑃 ∨ 𝑄) ∨ 𝑅))) → 𝑃 ∈ 𝐴)
5	2, 3, 4	3jca 1146	. . . 4 ⊢ ((((𝐾 ∈ HL ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴) ∧ (𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴) ∧ (𝑈 ∈ 𝐴 ∧ 𝑉 ∈ 𝐴)) ∧ (𝑃 ≠ 𝑄 ∧ ¬ 𝑅 ≤ (𝑃 ∨ 𝑄) ∧ ¬ 𝑆 ≤ ((𝑃 ∨ 𝑄) ∨ 𝑅))) → (𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴 ∧ 𝑃 ∈ 𝐴))
6		simpl3 1212	. . . 4 ⊢ ((((𝐾 ∈ HL ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴) ∧ (𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴) ∧ (𝑈 ∈ 𝐴 ∧ 𝑉 ∈ 𝐴)) ∧ (𝑃 ≠ 𝑄 ∧ ¬ 𝑅 ≤ (𝑃 ∨ 𝑄) ∧ ¬ 𝑆 ≤ ((𝑃 ∨ 𝑄) ∨ 𝑅))) → (𝑈 ∈ 𝐴 ∧ 𝑉 ∈ 𝐴))
7		simpr 489	. . . 4 ⊢ ((((𝐾 ∈ HL ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴) ∧ (𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴) ∧ (𝑈 ∈ 𝐴 ∧ 𝑉 ∈ 𝐴)) ∧ (𝑃 ≠ 𝑄 ∧ ¬ 𝑅 ≤ (𝑃 ∨ 𝑄) ∧ ¬ 𝑆 ≤ ((𝑃 ∨ 𝑄) ∨ 𝑅))) → (𝑃 ≠ 𝑄 ∧ ¬ 𝑅 ≤ (𝑃 ∨ 𝑄) ∧ ¬ 𝑆 ≤ ((𝑃 ∨ 𝑄) ∨ 𝑅)))
8		4at.l	. . . . 5 ⊢ ≤ = (le‘𝐾)
9		4at.j	. . . . 5 ⊢ ∨ = (join‘𝐾)
10		4at.a	. . . . 5 ⊢ 𝐴 = (Atoms‘𝐾)
11	8, 9, 10	4atlem3 40390	. . . 4 ⊢ ((((𝐾 ∈ HL ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴) ∧ (𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴 ∧ 𝑃 ∈ 𝐴) ∧ (𝑈 ∈ 𝐴 ∧ 𝑉 ∈ 𝐴)) ∧ (𝑃 ≠ 𝑄 ∧ ¬ 𝑅 ≤ (𝑃 ∨ 𝑄) ∧ ¬ 𝑆 ≤ ((𝑃 ∨ 𝑄) ∨ 𝑅))) → ((¬ 𝑃 ≤ ((𝑃 ∨ 𝑈) ∨ 𝑉) ∨ ¬ 𝑄 ≤ ((𝑃 ∨ 𝑈) ∨ 𝑉)) ∨ (¬ 𝑅 ≤ ((𝑃 ∨ 𝑈) ∨ 𝑉) ∨ ¬ 𝑆 ≤ ((𝑃 ∨ 𝑈) ∨ 𝑉))))
12	1, 5, 6, 7, 11	syl31anc 1400	. . 3 ⊢ ((((𝐾 ∈ HL ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴) ∧ (𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴) ∧ (𝑈 ∈ 𝐴 ∧ 𝑉 ∈ 𝐴)) ∧ (𝑃 ≠ 𝑄 ∧ ¬ 𝑅 ≤ (𝑃 ∨ 𝑄) ∧ ¬ 𝑆 ≤ ((𝑃 ∨ 𝑄) ∨ 𝑅))) → ((¬ 𝑃 ≤ ((𝑃 ∨ 𝑈) ∨ 𝑉) ∨ ¬ 𝑄 ≤ ((𝑃 ∨ 𝑈) ∨ 𝑉)) ∨ (¬ 𝑅 ≤ ((𝑃 ∨ 𝑈) ∨ 𝑉) ∨ ¬ 𝑆 ≤ ((𝑃 ∨ 𝑈) ∨ 𝑉))))
13		simpl11 1267	. . . . . . . 8 ⊢ ((((𝐾 ∈ HL ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴) ∧ (𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴) ∧ (𝑈 ∈ 𝐴 ∧ 𝑉 ∈ 𝐴)) ∧ (𝑃 ≠ 𝑄 ∧ ¬ 𝑅 ≤ (𝑃 ∨ 𝑄) ∧ ¬ 𝑆 ≤ ((𝑃 ∨ 𝑄) ∨ 𝑅))) → 𝐾 ∈ HL)
14	13	hllatd 40158	. . . . . . 7 ⊢ ((((𝐾 ∈ HL ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴) ∧ (𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴) ∧ (𝑈 ∈ 𝐴 ∧ 𝑉 ∈ 𝐴)) ∧ (𝑃 ≠ 𝑄 ∧ ¬ 𝑅 ≤ (𝑃 ∨ 𝑄) ∧ ¬ 𝑆 ≤ ((𝑃 ∨ 𝑄) ∨ 𝑅))) → 𝐾 ∈ Lat)
15		eqid 2763	. . . . . . . . 9 ⊢ (Base‘𝐾) = (Base‘𝐾)
16	15, 10	atbase 40083	. . . . . . . 8 ⊢ (𝑃 ∈ 𝐴 → 𝑃 ∈ (Base‘𝐾))
17	4, 16	syl 18	. . . . . . 7 ⊢ ((((𝐾 ∈ HL ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴) ∧ (𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴) ∧ (𝑈 ∈ 𝐴 ∧ 𝑉 ∈ 𝐴)) ∧ (𝑃 ≠ 𝑄 ∧ ¬ 𝑅 ≤ (𝑃 ∨ 𝑄) ∧ ¬ 𝑆 ≤ ((𝑃 ∨ 𝑄) ∨ 𝑅))) → 𝑃 ∈ (Base‘𝐾))
18		simpl3l 1247	. . . . . . . 8 ⊢ ((((𝐾 ∈ HL ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴) ∧ (𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴) ∧ (𝑈 ∈ 𝐴 ∧ 𝑉 ∈ 𝐴)) ∧ (𝑃 ≠ 𝑄 ∧ ¬ 𝑅 ≤ (𝑃 ∨ 𝑄) ∧ ¬ 𝑆 ≤ ((𝑃 ∨ 𝑄) ∨ 𝑅))) → 𝑈 ∈ 𝐴)
19		simpl3r 1248	. . . . . . . 8 ⊢ ((((𝐾 ∈ HL ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴) ∧ (𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴) ∧ (𝑈 ∈ 𝐴 ∧ 𝑉 ∈ 𝐴)) ∧ (𝑃 ≠ 𝑄 ∧ ¬ 𝑅 ≤ (𝑃 ∨ 𝑄) ∧ ¬ 𝑆 ≤ ((𝑃 ∨ 𝑄) ∨ 𝑅))) → 𝑉 ∈ 𝐴)
20	15, 9, 10	hlatjcl 40161	. . . . . . . 8 ⊢ ((𝐾 ∈ HL ∧ 𝑈 ∈ 𝐴 ∧ 𝑉 ∈ 𝐴) → (𝑈 ∨ 𝑉) ∈ (Base‘𝐾))
21	13, 18, 19, 20	syl3anc 1398	. . . . . . 7 ⊢ ((((𝐾 ∈ HL ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴) ∧ (𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴) ∧ (𝑈 ∈ 𝐴 ∧ 𝑉 ∈ 𝐴)) ∧ (𝑃 ≠ 𝑄 ∧ ¬ 𝑅 ≤ (𝑃 ∨ 𝑄) ∧ ¬ 𝑆 ≤ ((𝑃 ∨ 𝑄) ∨ 𝑅))) → (𝑈 ∨ 𝑉) ∈ (Base‘𝐾))
22	15, 8, 9	latlej1 18499	. . . . . . 7 ⊢ ((𝐾 ∈ Lat ∧ 𝑃 ∈ (Base‘𝐾) ∧ (𝑈 ∨ 𝑉) ∈ (Base‘𝐾)) → 𝑃 ≤ (𝑃 ∨ (𝑈 ∨ 𝑉)))
23	14, 17, 21, 22	syl3anc 1398	. . . . . 6 ⊢ ((((𝐾 ∈ HL ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴) ∧ (𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴) ∧ (𝑈 ∈ 𝐴 ∧ 𝑉 ∈ 𝐴)) ∧ (𝑃 ≠ 𝑄 ∧ ¬ 𝑅 ≤ (𝑃 ∨ 𝑄) ∧ ¬ 𝑆 ≤ ((𝑃 ∨ 𝑄) ∨ 𝑅))) → 𝑃 ≤ (𝑃 ∨ (𝑈 ∨ 𝑉)))
24	15, 10	atbase 40083	. . . . . . . 8 ⊢ (𝑈 ∈ 𝐴 → 𝑈 ∈ (Base‘𝐾))
25	18, 24	syl 18	. . . . . . 7 ⊢ ((((𝐾 ∈ HL ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴) ∧ (𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴) ∧ (𝑈 ∈ 𝐴 ∧ 𝑉 ∈ 𝐴)) ∧ (𝑃 ≠ 𝑄 ∧ ¬ 𝑅 ≤ (𝑃 ∨ 𝑄) ∧ ¬ 𝑆 ≤ ((𝑃 ∨ 𝑄) ∨ 𝑅))) → 𝑈 ∈ (Base‘𝐾))
26	15, 10	atbase 40083	. . . . . . . 8 ⊢ (𝑉 ∈ 𝐴 → 𝑉 ∈ (Base‘𝐾))
27	19, 26	syl 18	. . . . . . 7 ⊢ ((((𝐾 ∈ HL ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴) ∧ (𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴) ∧ (𝑈 ∈ 𝐴 ∧ 𝑉 ∈ 𝐴)) ∧ (𝑃 ≠ 𝑄 ∧ ¬ 𝑅 ≤ (𝑃 ∨ 𝑄) ∧ ¬ 𝑆 ≤ ((𝑃 ∨ 𝑄) ∨ 𝑅))) → 𝑉 ∈ (Base‘𝐾))
28	15, 9	latjass 18534	. . . . . . 7 ⊢ ((𝐾 ∈ Lat ∧ (𝑃 ∈ (Base‘𝐾) ∧ 𝑈 ∈ (Base‘𝐾) ∧ 𝑉 ∈ (Base‘𝐾))) → ((𝑃 ∨ 𝑈) ∨ 𝑉) = (𝑃 ∨ (𝑈 ∨ 𝑉)))
29	14, 17, 25, 27, 28	syl13anc 1399	. . . . . 6 ⊢ ((((𝐾 ∈ HL ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴) ∧ (𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴) ∧ (𝑈 ∈ 𝐴 ∧ 𝑉 ∈ 𝐴)) ∧ (𝑃 ≠ 𝑄 ∧ ¬ 𝑅 ≤ (𝑃 ∨ 𝑄) ∧ ¬ 𝑆 ≤ ((𝑃 ∨ 𝑄) ∨ 𝑅))) → ((𝑃 ∨ 𝑈) ∨ 𝑉) = (𝑃 ∨ (𝑈 ∨ 𝑉)))
30	23, 29	breqtrrd 5139	. . . . 5 ⊢ ((((𝐾 ∈ HL ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴) ∧ (𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴) ∧ (𝑈 ∈ 𝐴 ∧ 𝑉 ∈ 𝐴)) ∧ (𝑃 ≠ 𝑄 ∧ ¬ 𝑅 ≤ (𝑃 ∨ 𝑄) ∧ ¬ 𝑆 ≤ ((𝑃 ∨ 𝑄) ∨ 𝑅))) → 𝑃 ≤ ((𝑃 ∨ 𝑈) ∨ 𝑉))
31		biortn 950	. . . . 5 ⊢ (𝑃 ≤ ((𝑃 ∨ 𝑈) ∨ 𝑉) → (¬ 𝑄 ≤ ((𝑃 ∨ 𝑈) ∨ 𝑉) ↔ (¬ 𝑃 ≤ ((𝑃 ∨ 𝑈) ∨ 𝑉) ∨ ¬ 𝑄 ≤ ((𝑃 ∨ 𝑈) ∨ 𝑉))))
32	30, 31	syl 18	. . . 4 ⊢ ((((𝐾 ∈ HL ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴) ∧ (𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴) ∧ (𝑈 ∈ 𝐴 ∧ 𝑉 ∈ 𝐴)) ∧ (𝑃 ≠ 𝑄 ∧ ¬ 𝑅 ≤ (𝑃 ∨ 𝑄) ∧ ¬ 𝑆 ≤ ((𝑃 ∨ 𝑄) ∨ 𝑅))) → (¬ 𝑄 ≤ ((𝑃 ∨ 𝑈) ∨ 𝑉) ↔ (¬ 𝑃 ≤ ((𝑃 ∨ 𝑈) ∨ 𝑉) ∨ ¬ 𝑄 ≤ ((𝑃 ∨ 𝑈) ∨ 𝑉))))
33	32	orbi1d 929	. . 3 ⊢ ((((𝐾 ∈ HL ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴) ∧ (𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴) ∧ (𝑈 ∈ 𝐴 ∧ 𝑉 ∈ 𝐴)) ∧ (𝑃 ≠ 𝑄 ∧ ¬ 𝑅 ≤ (𝑃 ∨ 𝑄) ∧ ¬ 𝑆 ≤ ((𝑃 ∨ 𝑄) ∨ 𝑅))) → ((¬ 𝑄 ≤ ((𝑃 ∨ 𝑈) ∨ 𝑉) ∨ (¬ 𝑅 ≤ ((𝑃 ∨ 𝑈) ∨ 𝑉) ∨ ¬ 𝑆 ≤ ((𝑃 ∨ 𝑈) ∨ 𝑉))) ↔ ((¬ 𝑃 ≤ ((𝑃 ∨ 𝑈) ∨ 𝑉) ∨ ¬ 𝑄 ≤ ((𝑃 ∨ 𝑈) ∨ 𝑉)) ∨ (¬ 𝑅 ≤ ((𝑃 ∨ 𝑈) ∨ 𝑉) ∨ ¬ 𝑆 ≤ ((𝑃 ∨ 𝑈) ∨ 𝑉)))))
34	12, 33	mpbird 260	. 2 ⊢ ((((𝐾 ∈ HL ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴) ∧ (𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴) ∧ (𝑈 ∈ 𝐴 ∧ 𝑉 ∈ 𝐴)) ∧ (𝑃 ≠ 𝑄 ∧ ¬ 𝑅 ≤ (𝑃 ∨ 𝑄) ∧ ¬ 𝑆 ≤ ((𝑃 ∨ 𝑄) ∨ 𝑅))) → (¬ 𝑄 ≤ ((𝑃 ∨ 𝑈) ∨ 𝑉) ∨ (¬ 𝑅 ≤ ((𝑃 ∨ 𝑈) ∨ 𝑉) ∨ ¬ 𝑆 ≤ ((𝑃 ∨ 𝑈) ∨ 𝑉))))
35		3orass 1106	. 2 ⊢ ((¬ 𝑄 ≤ ((𝑃 ∨ 𝑈) ∨ 𝑉) ∨ ¬ 𝑅 ≤ ((𝑃 ∨ 𝑈) ∨ 𝑉) ∨ ¬ 𝑆 ≤ ((𝑃 ∨ 𝑈) ∨ 𝑉)) ↔ (¬ 𝑄 ≤ ((𝑃 ∨ 𝑈) ∨ 𝑉) ∨ (¬ 𝑅 ≤ ((𝑃 ∨ 𝑈) ∨ 𝑉) ∨ ¬ 𝑆 ≤ ((𝑃 ∨ 𝑈) ∨ 𝑉))))
36	34, 35	sylibr 237	1 ⊢ ((((𝐾 ∈ HL ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴) ∧ (𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴) ∧ (𝑈 ∈ 𝐴 ∧ 𝑉 ∈ 𝐴)) ∧ (𝑃 ≠ 𝑄 ∧ ¬ 𝑅 ≤ (𝑃 ∨ 𝑄) ∧ ¬ 𝑆 ≤ ((𝑃 ∨ 𝑄) ∨ 𝑅))) → (¬ 𝑄 ≤ ((𝑃 ∨ 𝑈) ∨ 𝑉) ∨ ¬ 𝑅 ≤ ((𝑃 ∨ 𝑈) ∨ 𝑉) ∨ ¬ 𝑆 ≤ ((𝑃 ∨ 𝑈) ∨ 𝑉)))

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 400   ∨ wo 860   ∨ w3o 1102   ∧ w3a 1103   = wceq 1570   ∈ wcel 2143   ≠ wne 2958   class class class wbr 5109  ‘cfv 6536  (class class class)co 7410  Basecbs 17264  lecple 17312  joincjn 18362  Latclat 18482  Atomscatm 40057  HLchlt 40144

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 5238  ax-sep 5257  ax-nul 5269  ax-pow 5336  ax-pr 5404  ax-un 7732

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 3745  df-csb 3854  df-dif 3908  df-un 3910  df-in 3912  df-ss 3922  df-nul 4287  df-if 4488  df-pw 4564  df-sn 4590  df-pr 4592  df-op 4596  df-uni 4873  df-iun 4958  df-br 5110  df-opab 5174  df-mpt 5193  df-id 5556  df-xp 5667  df-rel 5668  df-cnv 5669  df-co 5670  df-dm 5671  df-rn 5672  df-res 5673  df-ima 5674  df-iota 6492  df-fun 6538  df-fn 6539  df-f 6540  df-f1 6541  df-fo 6542  df-f1o 6543  df-fv 6544  df-riota 7367  df-ov 7413  df-oprab 7414  df-proset 18345  df-poset 18364  df-plt 18379  df-lub 18395  df-glb 18396  df-join 18397  df-meet 18398  df-p0 18474  df-lat 18483  df-clat 18550  df-oposet 39970  df-ol 39972  df-oml 39973  df-covers 40060  df-ats 40061  df-atl 40092  df-cvlat 40116  df-hlat 40145  df-llines 40292  df-lplanes 40293  df-lvols 40294

This theorem is referenced by:  4atlem3b  40392  4atlem11  40403