Theorem cdleme0nex 38558

Description: Part of proof of Lemma E in [Crawley] p. 114, 4th line of 4th paragraph. Whenever (in their terminology) p ∨ q/0 (i.e. the sublattice from 0 to p ∨ q) contains precisely three atoms, any atom not under w must equal either p or q. (In case of 3 atoms, one of them must be u - see cdleme0a 38479- which is under w, so the only 2 left not under w are p and q themselves.) Note that by cvlsupr2 37610, our (𝑃 ∨ 𝑟) = (𝑄 ∨ 𝑟) is a shorter way to express 𝑟 ≠ 𝑃 ∧ 𝑟 ≠ 𝑄 ∧ 𝑟 ≤ (𝑃 ∨ 𝑄). Thus, the negated existential condition states there are no atoms different from p or q that are also not under w. (Contributed by NM, 12-Nov-2012.)

Hypotheses

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

Assertion

Ref	Expression
cdleme0nex	⊢ (((𝐾 ∈ HL ∧ 𝑅 ≤ (𝑃 ∨ 𝑄) ∧ ¬ ∃𝑟 ∈ 𝐴 (¬ 𝑟 ≤ 𝑊 ∧ (𝑃 ∨ 𝑟) = (𝑄 ∨ 𝑟))) ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑃 ≠ 𝑄) ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊)) → (𝑅 = 𝑃 ∨ 𝑅 = 𝑄))

Distinct variable groups:   𝐴,𝑟   ∨ ,𝑟   ≤ ,𝑟   𝑃,𝑟   𝑄,𝑟   𝑅,𝑟   𝑊,𝑟

Allowed substitution hint:   𝐾(𝑟)

Proof of Theorem cdleme0nex

Step	Hyp	Ref	Expression
1		simp3r 1201	. . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑅 ≤ (𝑃 ∨ 𝑄) ∧ ¬ ∃𝑟 ∈ 𝐴 (¬ 𝑟 ≤ 𝑊 ∧ (𝑃 ∨ 𝑟) = (𝑄 ∨ 𝑟))) ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑃 ≠ 𝑄) ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊)) → ¬ 𝑅 ≤ 𝑊)
2		simp12 1203	. . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑅 ≤ (𝑃 ∨ 𝑄) ∧ ¬ ∃𝑟 ∈ 𝐴 (¬ 𝑟 ≤ 𝑊 ∧ (𝑃 ∨ 𝑟) = (𝑄 ∨ 𝑟))) ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑃 ≠ 𝑄) ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊)) → 𝑅 ≤ (𝑃 ∨ 𝑄))
3	1, 2	jca 512	. . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑅 ≤ (𝑃 ∨ 𝑄) ∧ ¬ ∃𝑟 ∈ 𝐴 (¬ 𝑟 ≤ 𝑊 ∧ (𝑃 ∨ 𝑟) = (𝑄 ∨ 𝑟))) ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑃 ≠ 𝑄) ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊)) → (¬ 𝑅 ≤ 𝑊 ∧ 𝑅 ≤ (𝑃 ∨ 𝑄)))
4		simp3l 1200	. . . . . 6 ⊢ (((𝐾 ∈ HL ∧ 𝑅 ≤ (𝑃 ∨ 𝑄) ∧ ¬ ∃𝑟 ∈ 𝐴 (¬ 𝑟 ≤ 𝑊 ∧ (𝑃 ∨ 𝑟) = (𝑄 ∨ 𝑟))) ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑃 ≠ 𝑄) ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊)) → 𝑅 ∈ 𝐴)
5		simp13 1204	. . . . . . 7 ⊢ (((𝐾 ∈ HL ∧ 𝑅 ≤ (𝑃 ∨ 𝑄) ∧ ¬ ∃𝑟 ∈ 𝐴 (¬ 𝑟 ≤ 𝑊 ∧ (𝑃 ∨ 𝑟) = (𝑄 ∨ 𝑟))) ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑃 ≠ 𝑄) ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊)) → ¬ ∃𝑟 ∈ 𝐴 (¬ 𝑟 ≤ 𝑊 ∧ (𝑃 ∨ 𝑟) = (𝑄 ∨ 𝑟)))
6		ralnex 3072	. . . . . . 7 ⊢ (∀𝑟 ∈ 𝐴 ¬ (¬ 𝑟 ≤ 𝑊 ∧ (𝑃 ∨ 𝑟) = (𝑄 ∨ 𝑟)) ↔ ¬ ∃𝑟 ∈ 𝐴 (¬ 𝑟 ≤ 𝑊 ∧ (𝑃 ∨ 𝑟) = (𝑄 ∨ 𝑟)))
7	5, 6	sylibr 233	. . . . . 6 ⊢ (((𝐾 ∈ HL ∧ 𝑅 ≤ (𝑃 ∨ 𝑄) ∧ ¬ ∃𝑟 ∈ 𝐴 (¬ 𝑟 ≤ 𝑊 ∧ (𝑃 ∨ 𝑟) = (𝑄 ∨ 𝑟))) ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑃 ≠ 𝑄) ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊)) → ∀𝑟 ∈ 𝐴 ¬ (¬ 𝑟 ≤ 𝑊 ∧ (𝑃 ∨ 𝑟) = (𝑄 ∨ 𝑟)))
8		breq1 5095	. . . . . . . . . 10 ⊢ (𝑟 = 𝑅 → (𝑟 ≤ 𝑊 ↔ 𝑅 ≤ 𝑊))
9	8	notbid 317	. . . . . . . . 9 ⊢ (𝑟 = 𝑅 → (¬ 𝑟 ≤ 𝑊 ↔ ¬ 𝑅 ≤ 𝑊))
10		oveq2 7345	. . . . . . . . . 10 ⊢ (𝑟 = 𝑅 → (𝑃 ∨ 𝑟) = (𝑃 ∨ 𝑅))
11		oveq2 7345	. . . . . . . . . 10 ⊢ (𝑟 = 𝑅 → (𝑄 ∨ 𝑟) = (𝑄 ∨ 𝑅))
12	10, 11	eqeq12d 2752	. . . . . . . . 9 ⊢ (𝑟 = 𝑅 → ((𝑃 ∨ 𝑟) = (𝑄 ∨ 𝑟) ↔ (𝑃 ∨ 𝑅) = (𝑄 ∨ 𝑅)))
13	9, 12	anbi12d 631	. . . . . . . 8 ⊢ (𝑟 = 𝑅 → ((¬ 𝑟 ≤ 𝑊 ∧ (𝑃 ∨ 𝑟) = (𝑄 ∨ 𝑟)) ↔ (¬ 𝑅 ≤ 𝑊 ∧ (𝑃 ∨ 𝑅) = (𝑄 ∨ 𝑅))))
14	13	notbid 317	. . . . . . 7 ⊢ (𝑟 = 𝑅 → (¬ (¬ 𝑟 ≤ 𝑊 ∧ (𝑃 ∨ 𝑟) = (𝑄 ∨ 𝑟)) ↔ ¬ (¬ 𝑅 ≤ 𝑊 ∧ (𝑃 ∨ 𝑅) = (𝑄 ∨ 𝑅))))
15	14	rspcva 3568	. . . . . 6 ⊢ ((𝑅 ∈ 𝐴 ∧ ∀𝑟 ∈ 𝐴 ¬ (¬ 𝑟 ≤ 𝑊 ∧ (𝑃 ∨ 𝑟) = (𝑄 ∨ 𝑟))) → ¬ (¬ 𝑅 ≤ 𝑊 ∧ (𝑃 ∨ 𝑅) = (𝑄 ∨ 𝑅)))
16	4, 7, 15	syl2anc 584	. . . . 5 ⊢ (((𝐾 ∈ HL ∧ 𝑅 ≤ (𝑃 ∨ 𝑄) ∧ ¬ ∃𝑟 ∈ 𝐴 (¬ 𝑟 ≤ 𝑊 ∧ (𝑃 ∨ 𝑟) = (𝑄 ∨ 𝑟))) ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑃 ≠ 𝑄) ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊)) → ¬ (¬ 𝑅 ≤ 𝑊 ∧ (𝑃 ∨ 𝑅) = (𝑄 ∨ 𝑅)))
17		simp11 1202	. . . . . . . 8 ⊢ (((𝐾 ∈ HL ∧ 𝑅 ≤ (𝑃 ∨ 𝑄) ∧ ¬ ∃𝑟 ∈ 𝐴 (¬ 𝑟 ≤ 𝑊 ∧ (𝑃 ∨ 𝑟) = (𝑄 ∨ 𝑟))) ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑃 ≠ 𝑄) ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊)) → 𝐾 ∈ HL)
18		hlcvl 37626	. . . . . . . 8 ⊢ (𝐾 ∈ HL → 𝐾 ∈ CvLat)
19	17, 18	syl 17	. . . . . . 7 ⊢ (((𝐾 ∈ HL ∧ 𝑅 ≤ (𝑃 ∨ 𝑄) ∧ ¬ ∃𝑟 ∈ 𝐴 (¬ 𝑟 ≤ 𝑊 ∧ (𝑃 ∨ 𝑟) = (𝑄 ∨ 𝑟))) ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑃 ≠ 𝑄) ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊)) → 𝐾 ∈ CvLat)
20		simp21 1205	. . . . . . 7 ⊢ (((𝐾 ∈ HL ∧ 𝑅 ≤ (𝑃 ∨ 𝑄) ∧ ¬ ∃𝑟 ∈ 𝐴 (¬ 𝑟 ≤ 𝑊 ∧ (𝑃 ∨ 𝑟) = (𝑄 ∨ 𝑟))) ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑃 ≠ 𝑄) ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊)) → 𝑃 ∈ 𝐴)
21		simp22 1206	. . . . . . 7 ⊢ (((𝐾 ∈ HL ∧ 𝑅 ≤ (𝑃 ∨ 𝑄) ∧ ¬ ∃𝑟 ∈ 𝐴 (¬ 𝑟 ≤ 𝑊 ∧ (𝑃 ∨ 𝑟) = (𝑄 ∨ 𝑟))) ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑃 ≠ 𝑄) ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊)) → 𝑄 ∈ 𝐴)
22		simp23 1207	. . . . . . 7 ⊢ (((𝐾 ∈ HL ∧ 𝑅 ≤ (𝑃 ∨ 𝑄) ∧ ¬ ∃𝑟 ∈ 𝐴 (¬ 𝑟 ≤ 𝑊 ∧ (𝑃 ∨ 𝑟) = (𝑄 ∨ 𝑟))) ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑃 ≠ 𝑄) ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊)) → 𝑃 ≠ 𝑄)
23		cdleme0nex.a	. . . . . . . 8 ⊢ 𝐴 = (Atoms‘𝐾)
24		cdleme0nex.l	. . . . . . . 8 ⊢ ≤ = (le‘𝐾)
25		cdleme0nex.j	. . . . . . . 8 ⊢ ∨ = (join‘𝐾)
26	23, 24, 25	cvlsupr2 37610	. . . . . . 7 ⊢ ((𝐾 ∈ CvLat ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ 𝑃 ≠ 𝑄) → ((𝑃 ∨ 𝑅) = (𝑄 ∨ 𝑅) ↔ (𝑅 ≠ 𝑃 ∧ 𝑅 ≠ 𝑄 ∧ 𝑅 ≤ (𝑃 ∨ 𝑄))))
27	19, 20, 21, 4, 22, 26	syl131anc 1382	. . . . . 6 ⊢ (((𝐾 ∈ HL ∧ 𝑅 ≤ (𝑃 ∨ 𝑄) ∧ ¬ ∃𝑟 ∈ 𝐴 (¬ 𝑟 ≤ 𝑊 ∧ (𝑃 ∨ 𝑟) = (𝑄 ∨ 𝑟))) ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑃 ≠ 𝑄) ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊)) → ((𝑃 ∨ 𝑅) = (𝑄 ∨ 𝑅) ↔ (𝑅 ≠ 𝑃 ∧ 𝑅 ≠ 𝑄 ∧ 𝑅 ≤ (𝑃 ∨ 𝑄))))
28	27	anbi2d 629	. . . . 5 ⊢ (((𝐾 ∈ HL ∧ 𝑅 ≤ (𝑃 ∨ 𝑄) ∧ ¬ ∃𝑟 ∈ 𝐴 (¬ 𝑟 ≤ 𝑊 ∧ (𝑃 ∨ 𝑟) = (𝑄 ∨ 𝑟))) ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑃 ≠ 𝑄) ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊)) → ((¬ 𝑅 ≤ 𝑊 ∧ (𝑃 ∨ 𝑅) = (𝑄 ∨ 𝑅)) ↔ (¬ 𝑅 ≤ 𝑊 ∧ (𝑅 ≠ 𝑃 ∧ 𝑅 ≠ 𝑄 ∧ 𝑅 ≤ (𝑃 ∨ 𝑄)))))
29	16, 28	mtbid 323	. . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑅 ≤ (𝑃 ∨ 𝑄) ∧ ¬ ∃𝑟 ∈ 𝐴 (¬ 𝑟 ≤ 𝑊 ∧ (𝑃 ∨ 𝑟) = (𝑄 ∨ 𝑟))) ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑃 ≠ 𝑄) ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊)) → ¬ (¬ 𝑅 ≤ 𝑊 ∧ (𝑅 ≠ 𝑃 ∧ 𝑅 ≠ 𝑄 ∧ 𝑅 ≤ (𝑃 ∨ 𝑄))))
30		ianor 979	. . . . 5 ⊢ (¬ ((𝑅 ≠ 𝑃 ∧ 𝑅 ≠ 𝑄) ∧ (¬ 𝑅 ≤ 𝑊 ∧ 𝑅 ≤ (𝑃 ∨ 𝑄))) ↔ (¬ (𝑅 ≠ 𝑃 ∧ 𝑅 ≠ 𝑄) ∨ ¬ (¬ 𝑅 ≤ 𝑊 ∧ 𝑅 ≤ (𝑃 ∨ 𝑄))))
31		df-3an 1088	. . . . . . . 8 ⊢ ((𝑅 ≠ 𝑃 ∧ 𝑅 ≠ 𝑄 ∧ 𝑅 ≤ (𝑃 ∨ 𝑄)) ↔ ((𝑅 ≠ 𝑃 ∧ 𝑅 ≠ 𝑄) ∧ 𝑅 ≤ (𝑃 ∨ 𝑄)))
32	31	anbi2i 623	. . . . . . 7 ⊢ ((¬ 𝑅 ≤ 𝑊 ∧ (𝑅 ≠ 𝑃 ∧ 𝑅 ≠ 𝑄 ∧ 𝑅 ≤ (𝑃 ∨ 𝑄))) ↔ (¬ 𝑅 ≤ 𝑊 ∧ ((𝑅 ≠ 𝑃 ∧ 𝑅 ≠ 𝑄) ∧ 𝑅 ≤ (𝑃 ∨ 𝑄))))
33		an12 642	. . . . . . 7 ⊢ ((¬ 𝑅 ≤ 𝑊 ∧ ((𝑅 ≠ 𝑃 ∧ 𝑅 ≠ 𝑄) ∧ 𝑅 ≤ (𝑃 ∨ 𝑄))) ↔ ((𝑅 ≠ 𝑃 ∧ 𝑅 ≠ 𝑄) ∧ (¬ 𝑅 ≤ 𝑊 ∧ 𝑅 ≤ (𝑃 ∨ 𝑄))))
34	32, 33	bitri 274	. . . . . 6 ⊢ ((¬ 𝑅 ≤ 𝑊 ∧ (𝑅 ≠ 𝑃 ∧ 𝑅 ≠ 𝑄 ∧ 𝑅 ≤ (𝑃 ∨ 𝑄))) ↔ ((𝑅 ≠ 𝑃 ∧ 𝑅 ≠ 𝑄) ∧ (¬ 𝑅 ≤ 𝑊 ∧ 𝑅 ≤ (𝑃 ∨ 𝑄))))
35	34	notbii 319	. . . . 5 ⊢ (¬ (¬ 𝑅 ≤ 𝑊 ∧ (𝑅 ≠ 𝑃 ∧ 𝑅 ≠ 𝑄 ∧ 𝑅 ≤ (𝑃 ∨ 𝑄))) ↔ ¬ ((𝑅 ≠ 𝑃 ∧ 𝑅 ≠ 𝑄) ∧ (¬ 𝑅 ≤ 𝑊 ∧ 𝑅 ≤ (𝑃 ∨ 𝑄))))
36		pm4.62 853	. . . . 5 ⊢ (((𝑅 ≠ 𝑃 ∧ 𝑅 ≠ 𝑄) → ¬ (¬ 𝑅 ≤ 𝑊 ∧ 𝑅 ≤ (𝑃 ∨ 𝑄))) ↔ (¬ (𝑅 ≠ 𝑃 ∧ 𝑅 ≠ 𝑄) ∨ ¬ (¬ 𝑅 ≤ 𝑊 ∧ 𝑅 ≤ (𝑃 ∨ 𝑄))))
37	30, 35, 36	3bitr4ri 303	. . . 4 ⊢ (((𝑅 ≠ 𝑃 ∧ 𝑅 ≠ 𝑄) → ¬ (¬ 𝑅 ≤ 𝑊 ∧ 𝑅 ≤ (𝑃 ∨ 𝑄))) ↔ ¬ (¬ 𝑅 ≤ 𝑊 ∧ (𝑅 ≠ 𝑃 ∧ 𝑅 ≠ 𝑄 ∧ 𝑅 ≤ (𝑃 ∨ 𝑄))))
38	29, 37	sylibr 233	. . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑅 ≤ (𝑃 ∨ 𝑄) ∧ ¬ ∃𝑟 ∈ 𝐴 (¬ 𝑟 ≤ 𝑊 ∧ (𝑃 ∨ 𝑟) = (𝑄 ∨ 𝑟))) ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑃 ≠ 𝑄) ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊)) → ((𝑅 ≠ 𝑃 ∧ 𝑅 ≠ 𝑄) → ¬ (¬ 𝑅 ≤ 𝑊 ∧ 𝑅 ≤ (𝑃 ∨ 𝑄))))
39	3, 38	mt2d 136	. 2 ⊢ (((𝐾 ∈ HL ∧ 𝑅 ≤ (𝑃 ∨ 𝑄) ∧ ¬ ∃𝑟 ∈ 𝐴 (¬ 𝑟 ≤ 𝑊 ∧ (𝑃 ∨ 𝑟) = (𝑄 ∨ 𝑟))) ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑃 ≠ 𝑄) ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊)) → ¬ (𝑅 ≠ 𝑃 ∧ 𝑅 ≠ 𝑄))
40		neanior 3034	. . 3 ⊢ ((𝑅 ≠ 𝑃 ∧ 𝑅 ≠ 𝑄) ↔ ¬ (𝑅 = 𝑃 ∨ 𝑅 = 𝑄))
41	40	con2bii 357	. 2 ⊢ ((𝑅 = 𝑃 ∨ 𝑅 = 𝑄) ↔ ¬ (𝑅 ≠ 𝑃 ∧ 𝑅 ≠ 𝑄))
42	39, 41	sylibr 233	1 ⊢ (((𝐾 ∈ HL ∧ 𝑅 ≤ (𝑃 ∨ 𝑄) ∧ ¬ ∃𝑟 ∈ 𝐴 (¬ 𝑟 ≤ 𝑊 ∧ (𝑃 ∨ 𝑟) = (𝑄 ∨ 𝑟))) ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑃 ≠ 𝑄) ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊)) → (𝑅 = 𝑃 ∨ 𝑅 = 𝑄))

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 205   ∧ wa 396   ∨ wo 844   ∧ w3a 1086   = wceq 1540   ∈ wcel 2105   ≠ wne 2940  ∀wral 3061  ∃wrex 3070   class class class wbr 5092  ‘cfv 6479  (class class class)co 7337  lecple 17066  joincjn 18126  Atomscatm 37530  CvLatclc 37532  HLchlt 37617

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1912  ax-6 1970  ax-7 2010  ax-8 2107  ax-9 2115  ax-10 2136  ax-11 2153  ax-12 2170  ax-ext 2707  ax-rep 5229  ax-sep 5243  ax-nul 5250  ax-pow 5308  ax-pr 5372  ax-un 7650

This theorem depends on definitions:  df-bi 206  df-an 397  df-or 845  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1781  df-nf 1785  df-sb 2067  df-mo 2538  df-eu 2567  df-clab 2714  df-cleq 2728  df-clel 2814  df-nfc 2886  df-ne 2941  df-ral 3062  df-rex 3071  df-reu 3350  df-rab 3404  df-v 3443  df-sbc 3728  df-csb 3844  df-dif 3901  df-un 3903  df-in 3905  df-ss 3915  df-nul 4270  df-if 4474  df-pw 4549  df-sn 4574  df-pr 4576  df-op 4580  df-uni 4853  df-iun 4943  df-br 5093  df-opab 5155  df-mpt 5176  df-id 5518  df-xp 5626  df-rel 5627  df-cnv 5628  df-co 5629  df-dm 5630  df-rn 5631  df-res 5632  df-ima 5633  df-iota 6431  df-fun 6481  df-fn 6482  df-f 6483  df-f1 6484  df-fo 6485  df-f1o 6486  df-fv 6487  df-riota 7293  df-ov 7340  df-oprab 7341  df-proset 18110  df-poset 18128  df-plt 18145  df-lub 18161  df-glb 18162  df-join 18163  df-meet 18164  df-p0 18240  df-lat 18247  df-covers 37533  df-ats 37534  df-atl 37565  df-cvlat 37589  df-hlat 37618

This theorem is referenced by:  cdleme18c  38561  cdleme18d  38563  cdlemg17b  38930  cdlemg17h  38936