Theorem cdleme0nex 40550

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 40471- which is under w, so the only 2 left not under w are p and q themselves.) Note that by cvlsupr2 39603, 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 1203	. . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑅 ≤ (𝑃 ∨ 𝑄) ∧ ¬ ∃𝑟 ∈ 𝐴 (¬ 𝑟 ≤ 𝑊 ∧ (𝑃 ∨ 𝑟) = (𝑄 ∨ 𝑟))) ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑃 ≠ 𝑄) ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊)) → ¬ 𝑅 ≤ 𝑊)
2		simp12 1205	. . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑅 ≤ (𝑃 ∨ 𝑄) ∧ ¬ ∃𝑟 ∈ 𝐴 (¬ 𝑟 ≤ 𝑊 ∧ (𝑃 ∨ 𝑟) = (𝑄 ∨ 𝑟))) ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑃 ≠ 𝑄) ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊)) → 𝑅 ≤ (𝑃 ∨ 𝑄))
3	1, 2	jca 511	. . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑅 ≤ (𝑃 ∨ 𝑄) ∧ ¬ ∃𝑟 ∈ 𝐴 (¬ 𝑟 ≤ 𝑊 ∧ (𝑃 ∨ 𝑟) = (𝑄 ∨ 𝑟))) ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑃 ≠ 𝑄) ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊)) → (¬ 𝑅 ≤ 𝑊 ∧ 𝑅 ≤ (𝑃 ∨ 𝑄)))
4		simp3l 1202	. . . . . 6 ⊢ (((𝐾 ∈ HL ∧ 𝑅 ≤ (𝑃 ∨ 𝑄) ∧ ¬ ∃𝑟 ∈ 𝐴 (¬ 𝑟 ≤ 𝑊 ∧ (𝑃 ∨ 𝑟) = (𝑄 ∨ 𝑟))) ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑃 ≠ 𝑄) ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊)) → 𝑅 ∈ 𝐴)
5		simp13 1206	. . . . . . 7 ⊢ (((𝐾 ∈ HL ∧ 𝑅 ≤ (𝑃 ∨ 𝑄) ∧ ¬ ∃𝑟 ∈ 𝐴 (¬ 𝑟 ≤ 𝑊 ∧ (𝑃 ∨ 𝑟) = (𝑄 ∨ 𝑟))) ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑃 ≠ 𝑄) ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊)) → ¬ ∃𝑟 ∈ 𝐴 (¬ 𝑟 ≤ 𝑊 ∧ (𝑃 ∨ 𝑟) = (𝑄 ∨ 𝑟)))
6		ralnex 3062	. . . . . . 7 ⊢ (∀𝑟 ∈ 𝐴 ¬ (¬ 𝑟 ≤ 𝑊 ∧ (𝑃 ∨ 𝑟) = (𝑄 ∨ 𝑟)) ↔ ¬ ∃𝑟 ∈ 𝐴 (¬ 𝑟 ≤ 𝑊 ∧ (𝑃 ∨ 𝑟) = (𝑄 ∨ 𝑟)))
7	5, 6	sylibr 234	. . . . . 6 ⊢ (((𝐾 ∈ HL ∧ 𝑅 ≤ (𝑃 ∨ 𝑄) ∧ ¬ ∃𝑟 ∈ 𝐴 (¬ 𝑟 ≤ 𝑊 ∧ (𝑃 ∨ 𝑟) = (𝑄 ∨ 𝑟))) ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑃 ≠ 𝑄) ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊)) → ∀𝑟 ∈ 𝐴 ¬ (¬ 𝑟 ≤ 𝑊 ∧ (𝑃 ∨ 𝑟) = (𝑄 ∨ 𝑟)))
8		breq1 5101	. . . . . . . . . 10 ⊢ (𝑟 = 𝑅 → (𝑟 ≤ 𝑊 ↔ 𝑅 ≤ 𝑊))
9	8	notbid 318	. . . . . . . . 9 ⊢ (𝑟 = 𝑅 → (¬ 𝑟 ≤ 𝑊 ↔ ¬ 𝑅 ≤ 𝑊))
10		oveq2 7366	. . . . . . . . . 10 ⊢ (𝑟 = 𝑅 → (𝑃 ∨ 𝑟) = (𝑃 ∨ 𝑅))
11		oveq2 7366	. . . . . . . . . 10 ⊢ (𝑟 = 𝑅 → (𝑄 ∨ 𝑟) = (𝑄 ∨ 𝑅))
12	10, 11	eqeq12d 2752	. . . . . . . . 9 ⊢ (𝑟 = 𝑅 → ((𝑃 ∨ 𝑟) = (𝑄 ∨ 𝑟) ↔ (𝑃 ∨ 𝑅) = (𝑄 ∨ 𝑅)))
13	9, 12	anbi12d 632	. . . . . . . 8 ⊢ (𝑟 = 𝑅 → ((¬ 𝑟 ≤ 𝑊 ∧ (𝑃 ∨ 𝑟) = (𝑄 ∨ 𝑟)) ↔ (¬ 𝑅 ≤ 𝑊 ∧ (𝑃 ∨ 𝑅) = (𝑄 ∨ 𝑅))))
14	13	notbid 318	. . . . . . 7 ⊢ (𝑟 = 𝑅 → (¬ (¬ 𝑟 ≤ 𝑊 ∧ (𝑃 ∨ 𝑟) = (𝑄 ∨ 𝑟)) ↔ ¬ (¬ 𝑅 ≤ 𝑊 ∧ (𝑃 ∨ 𝑅) = (𝑄 ∨ 𝑅))))
15	14	rspcva 3574	. . . . . 6 ⊢ ((𝑅 ∈ 𝐴 ∧ ∀𝑟 ∈ 𝐴 ¬ (¬ 𝑟 ≤ 𝑊 ∧ (𝑃 ∨ 𝑟) = (𝑄 ∨ 𝑟))) → ¬ (¬ 𝑅 ≤ 𝑊 ∧ (𝑃 ∨ 𝑅) = (𝑄 ∨ 𝑅)))
16	4, 7, 15	syl2anc 584	. . . . 5 ⊢ (((𝐾 ∈ HL ∧ 𝑅 ≤ (𝑃 ∨ 𝑄) ∧ ¬ ∃𝑟 ∈ 𝐴 (¬ 𝑟 ≤ 𝑊 ∧ (𝑃 ∨ 𝑟) = (𝑄 ∨ 𝑟))) ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑃 ≠ 𝑄) ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊)) → ¬ (¬ 𝑅 ≤ 𝑊 ∧ (𝑃 ∨ 𝑅) = (𝑄 ∨ 𝑅)))
17		simp11 1204	. . . . . . . 8 ⊢ (((𝐾 ∈ HL ∧ 𝑅 ≤ (𝑃 ∨ 𝑄) ∧ ¬ ∃𝑟 ∈ 𝐴 (¬ 𝑟 ≤ 𝑊 ∧ (𝑃 ∨ 𝑟) = (𝑄 ∨ 𝑟))) ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑃 ≠ 𝑄) ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊)) → 𝐾 ∈ HL)
18		hlcvl 39619	. . . . . . . 8 ⊢ (𝐾 ∈ HL → 𝐾 ∈ CvLat)
19	17, 18	syl 17	. . . . . . 7 ⊢ (((𝐾 ∈ HL ∧ 𝑅 ≤ (𝑃 ∨ 𝑄) ∧ ¬ ∃𝑟 ∈ 𝐴 (¬ 𝑟 ≤ 𝑊 ∧ (𝑃 ∨ 𝑟) = (𝑄 ∨ 𝑟))) ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑃 ≠ 𝑄) ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊)) → 𝐾 ∈ CvLat)
20		simp21 1207	. . . . . . 7 ⊢ (((𝐾 ∈ HL ∧ 𝑅 ≤ (𝑃 ∨ 𝑄) ∧ ¬ ∃𝑟 ∈ 𝐴 (¬ 𝑟 ≤ 𝑊 ∧ (𝑃 ∨ 𝑟) = (𝑄 ∨ 𝑟))) ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑃 ≠ 𝑄) ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊)) → 𝑃 ∈ 𝐴)
21		simp22 1208	. . . . . . 7 ⊢ (((𝐾 ∈ HL ∧ 𝑅 ≤ (𝑃 ∨ 𝑄) ∧ ¬ ∃𝑟 ∈ 𝐴 (¬ 𝑟 ≤ 𝑊 ∧ (𝑃 ∨ 𝑟) = (𝑄 ∨ 𝑟))) ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑃 ≠ 𝑄) ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊)) → 𝑄 ∈ 𝐴)
22		simp23 1209	. . . . . . 7 ⊢ (((𝐾 ∈ HL ∧ 𝑅 ≤ (𝑃 ∨ 𝑄) ∧ ¬ ∃𝑟 ∈ 𝐴 (¬ 𝑟 ≤ 𝑊 ∧ (𝑃 ∨ 𝑟) = (𝑄 ∨ 𝑟))) ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑃 ≠ 𝑄) ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊)) → 𝑃 ≠ 𝑄)
23		cdleme0nex.a	. . . . . . . 8 ⊢ 𝐴 = (Atoms‘𝐾)
24		cdleme0nex.l	. . . . . . . 8 ⊢ ≤ = (le‘𝐾)
25		cdleme0nex.j	. . . . . . . 8 ⊢ ∨ = (join‘𝐾)
26	23, 24, 25	cvlsupr2 39603	. . . . . . 7 ⊢ ((𝐾 ∈ CvLat ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ 𝑃 ≠ 𝑄) → ((𝑃 ∨ 𝑅) = (𝑄 ∨ 𝑅) ↔ (𝑅 ≠ 𝑃 ∧ 𝑅 ≠ 𝑄 ∧ 𝑅 ≤ (𝑃 ∨ 𝑄))))
27	19, 20, 21, 4, 22, 26	syl131anc 1385	. . . . . 6 ⊢ (((𝐾 ∈ HL ∧ 𝑅 ≤ (𝑃 ∨ 𝑄) ∧ ¬ ∃𝑟 ∈ 𝐴 (¬ 𝑟 ≤ 𝑊 ∧ (𝑃 ∨ 𝑟) = (𝑄 ∨ 𝑟))) ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑃 ≠ 𝑄) ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊)) → ((𝑃 ∨ 𝑅) = (𝑄 ∨ 𝑅) ↔ (𝑅 ≠ 𝑃 ∧ 𝑅 ≠ 𝑄 ∧ 𝑅 ≤ (𝑃 ∨ 𝑄))))
28	27	anbi2d 630	. . . . 5 ⊢ (((𝐾 ∈ HL ∧ 𝑅 ≤ (𝑃 ∨ 𝑄) ∧ ¬ ∃𝑟 ∈ 𝐴 (¬ 𝑟 ≤ 𝑊 ∧ (𝑃 ∨ 𝑟) = (𝑄 ∨ 𝑟))) ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑃 ≠ 𝑄) ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊)) → ((¬ 𝑅 ≤ 𝑊 ∧ (𝑃 ∨ 𝑅) = (𝑄 ∨ 𝑅)) ↔ (¬ 𝑅 ≤ 𝑊 ∧ (𝑅 ≠ 𝑃 ∧ 𝑅 ≠ 𝑄 ∧ 𝑅 ≤ (𝑃 ∨ 𝑄)))))
29	16, 28	mtbid 324	. . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑅 ≤ (𝑃 ∨ 𝑄) ∧ ¬ ∃𝑟 ∈ 𝐴 (¬ 𝑟 ≤ 𝑊 ∧ (𝑃 ∨ 𝑟) = (𝑄 ∨ 𝑟))) ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑃 ≠ 𝑄) ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊)) → ¬ (¬ 𝑅 ≤ 𝑊 ∧ (𝑅 ≠ 𝑃 ∧ 𝑅 ≠ 𝑄 ∧ 𝑅 ≤ (𝑃 ∨ 𝑄))))
30		ianor 983	. . . . 5 ⊢ (¬ ((𝑅 ≠ 𝑃 ∧ 𝑅 ≠ 𝑄) ∧ (¬ 𝑅 ≤ 𝑊 ∧ 𝑅 ≤ (𝑃 ∨ 𝑄))) ↔ (¬ (𝑅 ≠ 𝑃 ∧ 𝑅 ≠ 𝑄) ∨ ¬ (¬ 𝑅 ≤ 𝑊 ∧ 𝑅 ≤ (𝑃 ∨ 𝑄))))
31		df-3an 1088	. . . . . . . 8 ⊢ ((𝑅 ≠ 𝑃 ∧ 𝑅 ≠ 𝑄 ∧ 𝑅 ≤ (𝑃 ∨ 𝑄)) ↔ ((𝑅 ≠ 𝑃 ∧ 𝑅 ≠ 𝑄) ∧ 𝑅 ≤ (𝑃 ∨ 𝑄)))
32	31	anbi2i 623	. . . . . . 7 ⊢ ((¬ 𝑅 ≤ 𝑊 ∧ (𝑅 ≠ 𝑃 ∧ 𝑅 ≠ 𝑄 ∧ 𝑅 ≤ (𝑃 ∨ 𝑄))) ↔ (¬ 𝑅 ≤ 𝑊 ∧ ((𝑅 ≠ 𝑃 ∧ 𝑅 ≠ 𝑄) ∧ 𝑅 ≤ (𝑃 ∨ 𝑄))))
33		an12 645	. . . . . . 7 ⊢ ((¬ 𝑅 ≤ 𝑊 ∧ ((𝑅 ≠ 𝑃 ∧ 𝑅 ≠ 𝑄) ∧ 𝑅 ≤ (𝑃 ∨ 𝑄))) ↔ ((𝑅 ≠ 𝑃 ∧ 𝑅 ≠ 𝑄) ∧ (¬ 𝑅 ≤ 𝑊 ∧ 𝑅 ≤ (𝑃 ∨ 𝑄))))
34	32, 33	bitri 275	. . . . . 6 ⊢ ((¬ 𝑅 ≤ 𝑊 ∧ (𝑅 ≠ 𝑃 ∧ 𝑅 ≠ 𝑄 ∧ 𝑅 ≤ (𝑃 ∨ 𝑄))) ↔ ((𝑅 ≠ 𝑃 ∧ 𝑅 ≠ 𝑄) ∧ (¬ 𝑅 ≤ 𝑊 ∧ 𝑅 ≤ (𝑃 ∨ 𝑄))))
35	34	notbii 320	. . . . 5 ⊢ (¬ (¬ 𝑅 ≤ 𝑊 ∧ (𝑅 ≠ 𝑃 ∧ 𝑅 ≠ 𝑄 ∧ 𝑅 ≤ (𝑃 ∨ 𝑄))) ↔ ¬ ((𝑅 ≠ 𝑃 ∧ 𝑅 ≠ 𝑄) ∧ (¬ 𝑅 ≤ 𝑊 ∧ 𝑅 ≤ (𝑃 ∨ 𝑄))))
36		pm4.62 856	. . . . 5 ⊢ (((𝑅 ≠ 𝑃 ∧ 𝑅 ≠ 𝑄) → ¬ (¬ 𝑅 ≤ 𝑊 ∧ 𝑅 ≤ (𝑃 ∨ 𝑄))) ↔ (¬ (𝑅 ≠ 𝑃 ∧ 𝑅 ≠ 𝑄) ∨ ¬ (¬ 𝑅 ≤ 𝑊 ∧ 𝑅 ≤ (𝑃 ∨ 𝑄))))
37	30, 35, 36	3bitr4ri 304	. . . 4 ⊢ (((𝑅 ≠ 𝑃 ∧ 𝑅 ≠ 𝑄) → ¬ (¬ 𝑅 ≤ 𝑊 ∧ 𝑅 ≤ (𝑃 ∨ 𝑄))) ↔ ¬ (¬ 𝑅 ≤ 𝑊 ∧ (𝑅 ≠ 𝑃 ∧ 𝑅 ≠ 𝑄 ∧ 𝑅 ≤ (𝑃 ∨ 𝑄))))
38	29, 37	sylibr 234	. . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑅 ≤ (𝑃 ∨ 𝑄) ∧ ¬ ∃𝑟 ∈ 𝐴 (¬ 𝑟 ≤ 𝑊 ∧ (𝑃 ∨ 𝑟) = (𝑄 ∨ 𝑟))) ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑃 ≠ 𝑄) ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊)) → ((𝑅 ≠ 𝑃 ∧ 𝑅 ≠ 𝑄) → ¬ (¬ 𝑅 ≤ 𝑊 ∧ 𝑅 ≤ (𝑃 ∨ 𝑄))))
39	3, 38	mt2d 136	. 2 ⊢ (((𝐾 ∈ HL ∧ 𝑅 ≤ (𝑃 ∨ 𝑄) ∧ ¬ ∃𝑟 ∈ 𝐴 (¬ 𝑟 ≤ 𝑊 ∧ (𝑃 ∨ 𝑟) = (𝑄 ∨ 𝑟))) ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑃 ≠ 𝑄) ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊)) → ¬ (𝑅 ≠ 𝑃 ∧ 𝑅 ≠ 𝑄))
40		neanior 3025	. . 3 ⊢ ((𝑅 ≠ 𝑃 ∧ 𝑅 ≠ 𝑄) ↔ ¬ (𝑅 = 𝑃 ∨ 𝑅 = 𝑄))
41	40	con2bii 357	. 2 ⊢ ((𝑅 = 𝑃 ∨ 𝑅 = 𝑄) ↔ ¬ (𝑅 ≠ 𝑃 ∧ 𝑅 ≠ 𝑄))
42	39, 41	sylibr 234	1 ⊢ (((𝐾 ∈ HL ∧ 𝑅 ≤ (𝑃 ∨ 𝑄) ∧ ¬ ∃𝑟 ∈ 𝐴 (¬ 𝑟 ≤ 𝑊 ∧ (𝑃 ∨ 𝑟) = (𝑄 ∨ 𝑟))) ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑃 ≠ 𝑄) ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊)) → (𝑅 = 𝑃 ∨ 𝑅 = 𝑄))

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 206   ∧ wa 395   ∨ wo 847   ∧ w3a 1086   = wceq 1541   ∈ wcel 2113   ≠ wne 2932  ∀wral 3051  ∃wrex 3060   class class class wbr 5098  ‘cfv 6492  (class class class)co 7358  lecple 17184  joincjn 18234  Atomscatm 39523  CvLatclc 39525  HLchlt 39610

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 1911  ax-6 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-10 2146  ax-11 2162  ax-12 2184  ax-ext 2708  ax-rep 5224  ax-sep 5241  ax-nul 5251  ax-pow 5310  ax-pr 5377  ax-un 7680

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-mo 2539  df-eu 2569  df-clab 2715  df-cleq 2728  df-clel 2811  df-nfc 2885  df-ne 2933  df-ral 3052  df-rex 3061  df-rmo 3350  df-reu 3351  df-rab 3400  df-v 3442  df-sbc 3741  df-csb 3850  df-dif 3904  df-un 3906  df-in 3908  df-ss 3918  df-nul 4286  df-if 4480  df-pw 4556  df-sn 4581  df-pr 4583  df-op 4587  df-uni 4864  df-iun 4948  df-br 5099  df-opab 5161  df-mpt 5180  df-id 5519  df-xp 5630  df-rel 5631  df-cnv 5632  df-co 5633  df-dm 5634  df-rn 5635  df-res 5636  df-ima 5637  df-iota 6448  df-fun 6494  df-fn 6495  df-f 6496  df-f1 6497  df-fo 6498  df-f1o 6499  df-fv 6500  df-riota 7315  df-ov 7361  df-oprab 7362  df-proset 18217  df-poset 18236  df-plt 18251  df-lub 18267  df-glb 18268  df-join 18269  df-meet 18270  df-p0 18346  df-lat 18355  df-covers 39526  df-ats 39527  df-atl 39558  df-cvlat 39582  df-hlat 39611

This theorem is referenced by:  cdleme18c  40553  cdleme18d  40555  cdlemg17b  40922  cdlemg17h  40928