Theorem cdleme40v 40932

Description: Part of proof of Lemma E in [Crawley] p. 113. Change bound variables in ⦋𝑆 / 𝑢⦌𝑉 (but we use ⦋𝑅 / 𝑢⦌𝑉 for convenience since we have its hypotheses available). (Contributed by NM, 18-Mar-2013.)

Hypotheses

Ref	Expression
cdleme40.b	⊢ 𝐵 = (Base‘𝐾)
cdleme40.l	⊢ ≤ = (le‘𝐾)
cdleme40.j	⊢ ∨ = (join‘𝐾)
cdleme40.m	⊢ ∧ = (meet‘𝐾)
cdleme40.a	⊢ 𝐴 = (Atoms‘𝐾)
cdleme40.h	⊢ 𝐻 = (LHyp‘𝐾)
cdleme40.u	⊢ 𝑈 = ((𝑃 ∨ 𝑄) ∧ 𝑊)
cdleme40.e	⊢ 𝐸 = ((𝑡 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑡) ∧ 𝑊)))
cdleme40.g	⊢ 𝐺 = ((𝑃 ∨ 𝑄) ∧ (𝐸 ∨ ((𝑠 ∨ 𝑡) ∧ 𝑊)))
cdleme40.i	⊢ 𝐼 = (℩𝑦 ∈ 𝐵 ∀𝑡 ∈ 𝐴 ((¬ 𝑡 ≤ 𝑊 ∧ ¬ 𝑡 ≤ (𝑃 ∨ 𝑄)) → 𝑦 = 𝐺))
cdleme40.n	⊢ 𝑁 = if(𝑠 ≤ (𝑃 ∨ 𝑄), 𝐼, 𝐷)
cdleme40.d	⊢ 𝐷 = ((𝑠 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑠) ∧ 𝑊)))
cdleme40r.y	⊢ 𝑌 = ((𝑢 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑢) ∧ 𝑊)))
cdleme40r.t	⊢ 𝑇 = ((𝑣 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑣) ∧ 𝑊)))
cdleme40r.x	⊢ 𝑋 = ((𝑃 ∨ 𝑄) ∧ (𝑇 ∨ ((𝑢 ∨ 𝑣) ∧ 𝑊)))
cdleme40r.o	⊢ 𝑂 = (℩𝑧 ∈ 𝐵 ∀𝑣 ∈ 𝐴 ((¬ 𝑣 ≤ 𝑊 ∧ ¬ 𝑣 ≤ (𝑃 ∨ 𝑄)) → 𝑧 = 𝑋))
cdleme40r.v	⊢ 𝑉 = if(𝑢 ≤ (𝑃 ∨ 𝑄), 𝑂, 𝑌)

Assertion

Ref	Expression
cdleme40v	⊢ (𝑅 ∈ 𝐴 → ⦋𝑅 / 𝑠⦌𝑁 = ⦋𝑅 / 𝑢⦌𝑉)

Distinct variable groups:   ∧ ,𝑠,𝑡,𝑦   𝑧,𝑈   𝑧,𝑅   𝑇,𝑠,𝑡,𝑦   𝑅,𝑠,𝑡,𝑣,𝑦   𝑄,𝑠,𝑡,𝑦   𝑧,𝐾   𝑢,𝑃,𝑧   𝑢,𝑄,𝑣,𝑧   𝑧,𝐻   𝑃,𝑠,𝑡,𝑣,𝑦   𝐸,𝑠   𝑢,𝑊,𝑧,𝑠,𝑡,𝑣,𝑦   𝐵,𝑠,𝑡,𝑦,𝑢,𝑣,𝑧   𝑦,𝑌   𝑢, ∨ ,𝑧,𝑠,𝑡,𝑣,𝑦   𝑢, ≤ ,𝑧,𝑠,𝑡,𝑣,𝑦   𝐴,𝑠,𝑡,𝑣,𝑦   𝑢, ∧ ,𝑣,𝑧   𝑡,𝑈,𝑣,𝑦   𝑡,𝐾,𝑣,𝑦   𝑡,𝐻,𝑣,𝑦   𝑢,𝐴,𝑧   𝑢,𝑇   𝑣,𝐸,𝑧   𝑢,𝑁,𝑣   𝑢,𝑅   𝑉,𝑠   𝑡,𝑋,𝑦   𝑢,𝑠,𝑧,𝑡,𝑦

Allowed substitution hints:   𝐷(𝑦,𝑧,𝑣,𝑢,𝑡,𝑠)   𝑇(𝑧,𝑣)   𝑈(𝑢,𝑠)   𝐸(𝑦,𝑢,𝑡)   𝐺(𝑦,𝑧,𝑣,𝑢,𝑡,𝑠)   𝐻(𝑢,𝑠)   𝐼(𝑦,𝑧,𝑣,𝑢,𝑡,𝑠)   𝐾(𝑢,𝑠)   𝑁(𝑦,𝑧,𝑡,𝑠)   𝑂(𝑦,𝑧,𝑣,𝑢,𝑡,𝑠)   𝑉(𝑦,𝑧,𝑣,𝑢,𝑡)   𝑋(𝑧,𝑣,𝑢,𝑠)   𝑌(𝑧,𝑣,𝑢,𝑡,𝑠)

Proof of Theorem cdleme40v

Step	Hyp	Ref	Expression
1		breq1 5089	. . . . 5 ⊢ (𝑠 = 𝑢 → (𝑠 ≤ (𝑃 ∨ 𝑄) ↔ 𝑢 ≤ (𝑃 ∨ 𝑄)))
2		cdleme40.g	. . . . . . . . . . . 12 ⊢ 𝐺 = ((𝑃 ∨ 𝑄) ∧ (𝐸 ∨ ((𝑠 ∨ 𝑡) ∧ 𝑊)))
3		oveq1 7368	. . . . . . . . . . . . . . 15 ⊢ (𝑠 = 𝑢 → (𝑠 ∨ 𝑡) = (𝑢 ∨ 𝑡))
4	3	oveq1d 7376	. . . . . . . . . . . . . 14 ⊢ (𝑠 = 𝑢 → ((𝑠 ∨ 𝑡) ∧ 𝑊) = ((𝑢 ∨ 𝑡) ∧ 𝑊))
5	4	oveq2d 7377	. . . . . . . . . . . . 13 ⊢ (𝑠 = 𝑢 → (𝐸 ∨ ((𝑠 ∨ 𝑡) ∧ 𝑊)) = (𝐸 ∨ ((𝑢 ∨ 𝑡) ∧ 𝑊)))
6	5	oveq2d 7377	. . . . . . . . . . . 12 ⊢ (𝑠 = 𝑢 → ((𝑃 ∨ 𝑄) ∧ (𝐸 ∨ ((𝑠 ∨ 𝑡) ∧ 𝑊))) = ((𝑃 ∨ 𝑄) ∧ (𝐸 ∨ ((𝑢 ∨ 𝑡) ∧ 𝑊))))
7	2, 6	eqtrid 2784	. . . . . . . . . . 11 ⊢ (𝑠 = 𝑢 → 𝐺 = ((𝑃 ∨ 𝑄) ∧ (𝐸 ∨ ((𝑢 ∨ 𝑡) ∧ 𝑊))))
8	7	eqeq2d 2748	. . . . . . . . . 10 ⊢ (𝑠 = 𝑢 → (𝑦 = 𝐺 ↔ 𝑦 = ((𝑃 ∨ 𝑄) ∧ (𝐸 ∨ ((𝑢 ∨ 𝑡) ∧ 𝑊)))))
9	8	imbi2d 340	. . . . . . . . 9 ⊢ (𝑠 = 𝑢 → (((¬ 𝑡 ≤ 𝑊 ∧ ¬ 𝑡 ≤ (𝑃 ∨ 𝑄)) → 𝑦 = 𝐺) ↔ ((¬ 𝑡 ≤ 𝑊 ∧ ¬ 𝑡 ≤ (𝑃 ∨ 𝑄)) → 𝑦 = ((𝑃 ∨ 𝑄) ∧ (𝐸 ∨ ((𝑢 ∨ 𝑡) ∧ 𝑊))))))
10	9	ralbidv 3161	. . . . . . . 8 ⊢ (𝑠 = 𝑢 → (∀𝑡 ∈ 𝐴 ((¬ 𝑡 ≤ 𝑊 ∧ ¬ 𝑡 ≤ (𝑃 ∨ 𝑄)) → 𝑦 = 𝐺) ↔ ∀𝑡 ∈ 𝐴 ((¬ 𝑡 ≤ 𝑊 ∧ ¬ 𝑡 ≤ (𝑃 ∨ 𝑄)) → 𝑦 = ((𝑃 ∨ 𝑄) ∧ (𝐸 ∨ ((𝑢 ∨ 𝑡) ∧ 𝑊))))))
11	10	riotabidv 7320	. . . . . . 7 ⊢ (𝑠 = 𝑢 → (℩𝑦 ∈ 𝐵 ∀𝑡 ∈ 𝐴 ((¬ 𝑡 ≤ 𝑊 ∧ ¬ 𝑡 ≤ (𝑃 ∨ 𝑄)) → 𝑦 = 𝐺)) = (℩𝑦 ∈ 𝐵 ∀𝑡 ∈ 𝐴 ((¬ 𝑡 ≤ 𝑊 ∧ ¬ 𝑡 ≤ (𝑃 ∨ 𝑄)) → 𝑦 = ((𝑃 ∨ 𝑄) ∧ (𝐸 ∨ ((𝑢 ∨ 𝑡) ∧ 𝑊))))))
12		eqeq1 2741	. . . . . . . . . . 11 ⊢ (𝑦 = 𝑧 → (𝑦 = ((𝑃 ∨ 𝑄) ∧ (𝐸 ∨ ((𝑢 ∨ 𝑡) ∧ 𝑊))) ↔ 𝑧 = ((𝑃 ∨ 𝑄) ∧ (𝐸 ∨ ((𝑢 ∨ 𝑡) ∧ 𝑊)))))
13	12	imbi2d 340	. . . . . . . . . 10 ⊢ (𝑦 = 𝑧 → (((¬ 𝑡 ≤ 𝑊 ∧ ¬ 𝑡 ≤ (𝑃 ∨ 𝑄)) → 𝑦 = ((𝑃 ∨ 𝑄) ∧ (𝐸 ∨ ((𝑢 ∨ 𝑡) ∧ 𝑊)))) ↔ ((¬ 𝑡 ≤ 𝑊 ∧ ¬ 𝑡 ≤ (𝑃 ∨ 𝑄)) → 𝑧 = ((𝑃 ∨ 𝑄) ∧ (𝐸 ∨ ((𝑢 ∨ 𝑡) ∧ 𝑊))))))
14	13	ralbidv 3161	. . . . . . . . 9 ⊢ (𝑦 = 𝑧 → (∀𝑡 ∈ 𝐴 ((¬ 𝑡 ≤ 𝑊 ∧ ¬ 𝑡 ≤ (𝑃 ∨ 𝑄)) → 𝑦 = ((𝑃 ∨ 𝑄) ∧ (𝐸 ∨ ((𝑢 ∨ 𝑡) ∧ 𝑊)))) ↔ ∀𝑡 ∈ 𝐴 ((¬ 𝑡 ≤ 𝑊 ∧ ¬ 𝑡 ≤ (𝑃 ∨ 𝑄)) → 𝑧 = ((𝑃 ∨ 𝑄) ∧ (𝐸 ∨ ((𝑢 ∨ 𝑡) ∧ 𝑊))))))
15		breq1 5089	. . . . . . . . . . . . 13 ⊢ (𝑡 = 𝑣 → (𝑡 ≤ 𝑊 ↔ 𝑣 ≤ 𝑊))
16	15	notbid 318	. . . . . . . . . . . 12 ⊢ (𝑡 = 𝑣 → (¬ 𝑡 ≤ 𝑊 ↔ ¬ 𝑣 ≤ 𝑊))
17		breq1 5089	. . . . . . . . . . . . 13 ⊢ (𝑡 = 𝑣 → (𝑡 ≤ (𝑃 ∨ 𝑄) ↔ 𝑣 ≤ (𝑃 ∨ 𝑄)))
18	17	notbid 318	. . . . . . . . . . . 12 ⊢ (𝑡 = 𝑣 → (¬ 𝑡 ≤ (𝑃 ∨ 𝑄) ↔ ¬ 𝑣 ≤ (𝑃 ∨ 𝑄)))
19	16, 18	anbi12d 633	. . . . . . . . . . 11 ⊢ (𝑡 = 𝑣 → ((¬ 𝑡 ≤ 𝑊 ∧ ¬ 𝑡 ≤ (𝑃 ∨ 𝑄)) ↔ (¬ 𝑣 ≤ 𝑊 ∧ ¬ 𝑣 ≤ (𝑃 ∨ 𝑄))))
20		oveq1 7368	. . . . . . . . . . . . . . . . 17 ⊢ (𝑡 = 𝑣 → (𝑡 ∨ 𝑈) = (𝑣 ∨ 𝑈))
21		oveq2 7369	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑡 = 𝑣 → (𝑃 ∨ 𝑡) = (𝑃 ∨ 𝑣))
22	21	oveq1d 7376	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑡 = 𝑣 → ((𝑃 ∨ 𝑡) ∧ 𝑊) = ((𝑃 ∨ 𝑣) ∧ 𝑊))
23	22	oveq2d 7377	. . . . . . . . . . . . . . . . 17 ⊢ (𝑡 = 𝑣 → (𝑄 ∨ ((𝑃 ∨ 𝑡) ∧ 𝑊)) = (𝑄 ∨ ((𝑃 ∨ 𝑣) ∧ 𝑊)))
24	20, 23	oveq12d 7379	. . . . . . . . . . . . . . . 16 ⊢ (𝑡 = 𝑣 → ((𝑡 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑡) ∧ 𝑊))) = ((𝑣 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑣) ∧ 𝑊))))
25		cdleme40.e	. . . . . . . . . . . . . . . 16 ⊢ 𝐸 = ((𝑡 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑡) ∧ 𝑊)))
26		cdleme40r.t	. . . . . . . . . . . . . . . 16 ⊢ 𝑇 = ((𝑣 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑣) ∧ 𝑊)))
27	24, 25, 26	3eqtr4g 2797	. . . . . . . . . . . . . . 15 ⊢ (𝑡 = 𝑣 → 𝐸 = 𝑇)
28		oveq2 7369	. . . . . . . . . . . . . . . 16 ⊢ (𝑡 = 𝑣 → (𝑢 ∨ 𝑡) = (𝑢 ∨ 𝑣))
29	28	oveq1d 7376	. . . . . . . . . . . . . . 15 ⊢ (𝑡 = 𝑣 → ((𝑢 ∨ 𝑡) ∧ 𝑊) = ((𝑢 ∨ 𝑣) ∧ 𝑊))
30	27, 29	oveq12d 7379	. . . . . . . . . . . . . 14 ⊢ (𝑡 = 𝑣 → (𝐸 ∨ ((𝑢 ∨ 𝑡) ∧ 𝑊)) = (𝑇 ∨ ((𝑢 ∨ 𝑣) ∧ 𝑊)))
31	30	oveq2d 7377	. . . . . . . . . . . . 13 ⊢ (𝑡 = 𝑣 → ((𝑃 ∨ 𝑄) ∧ (𝐸 ∨ ((𝑢 ∨ 𝑡) ∧ 𝑊))) = ((𝑃 ∨ 𝑄) ∧ (𝑇 ∨ ((𝑢 ∨ 𝑣) ∧ 𝑊))))
32		cdleme40r.x	. . . . . . . . . . . . 13 ⊢ 𝑋 = ((𝑃 ∨ 𝑄) ∧ (𝑇 ∨ ((𝑢 ∨ 𝑣) ∧ 𝑊)))
33	31, 32	eqtr4di 2790	. . . . . . . . . . . 12 ⊢ (𝑡 = 𝑣 → ((𝑃 ∨ 𝑄) ∧ (𝐸 ∨ ((𝑢 ∨ 𝑡) ∧ 𝑊))) = 𝑋)
34	33	eqeq2d 2748	. . . . . . . . . . 11 ⊢ (𝑡 = 𝑣 → (𝑧 = ((𝑃 ∨ 𝑄) ∧ (𝐸 ∨ ((𝑢 ∨ 𝑡) ∧ 𝑊))) ↔ 𝑧 = 𝑋))
35	19, 34	imbi12d 344	. . . . . . . . . 10 ⊢ (𝑡 = 𝑣 → (((¬ 𝑡 ≤ 𝑊 ∧ ¬ 𝑡 ≤ (𝑃 ∨ 𝑄)) → 𝑧 = ((𝑃 ∨ 𝑄) ∧ (𝐸 ∨ ((𝑢 ∨ 𝑡) ∧ 𝑊)))) ↔ ((¬ 𝑣 ≤ 𝑊 ∧ ¬ 𝑣 ≤ (𝑃 ∨ 𝑄)) → 𝑧 = 𝑋)))
36	35	cbvralvw 3216	. . . . . . . . 9 ⊢ (∀𝑡 ∈ 𝐴 ((¬ 𝑡 ≤ 𝑊 ∧ ¬ 𝑡 ≤ (𝑃 ∨ 𝑄)) → 𝑧 = ((𝑃 ∨ 𝑄) ∧ (𝐸 ∨ ((𝑢 ∨ 𝑡) ∧ 𝑊)))) ↔ ∀𝑣 ∈ 𝐴 ((¬ 𝑣 ≤ 𝑊 ∧ ¬ 𝑣 ≤ (𝑃 ∨ 𝑄)) → 𝑧 = 𝑋))
37	14, 36	bitrdi 287	. . . . . . . 8 ⊢ (𝑦 = 𝑧 → (∀𝑡 ∈ 𝐴 ((¬ 𝑡 ≤ 𝑊 ∧ ¬ 𝑡 ≤ (𝑃 ∨ 𝑄)) → 𝑦 = ((𝑃 ∨ 𝑄) ∧ (𝐸 ∨ ((𝑢 ∨ 𝑡) ∧ 𝑊)))) ↔ ∀𝑣 ∈ 𝐴 ((¬ 𝑣 ≤ 𝑊 ∧ ¬ 𝑣 ≤ (𝑃 ∨ 𝑄)) → 𝑧 = 𝑋)))
38	37	cbvriotavw 7328	. . . . . . 7 ⊢ (℩𝑦 ∈ 𝐵 ∀𝑡 ∈ 𝐴 ((¬ 𝑡 ≤ 𝑊 ∧ ¬ 𝑡 ≤ (𝑃 ∨ 𝑄)) → 𝑦 = ((𝑃 ∨ 𝑄) ∧ (𝐸 ∨ ((𝑢 ∨ 𝑡) ∧ 𝑊))))) = (℩𝑧 ∈ 𝐵 ∀𝑣 ∈ 𝐴 ((¬ 𝑣 ≤ 𝑊 ∧ ¬ 𝑣 ≤ (𝑃 ∨ 𝑄)) → 𝑧 = 𝑋))
39	11, 38	eqtrdi 2788	. . . . . 6 ⊢ (𝑠 = 𝑢 → (℩𝑦 ∈ 𝐵 ∀𝑡 ∈ 𝐴 ((¬ 𝑡 ≤ 𝑊 ∧ ¬ 𝑡 ≤ (𝑃 ∨ 𝑄)) → 𝑦 = 𝐺)) = (℩𝑧 ∈ 𝐵 ∀𝑣 ∈ 𝐴 ((¬ 𝑣 ≤ 𝑊 ∧ ¬ 𝑣 ≤ (𝑃 ∨ 𝑄)) → 𝑧 = 𝑋)))
40		cdleme40.i	. . . . . 6 ⊢ 𝐼 = (℩𝑦 ∈ 𝐵 ∀𝑡 ∈ 𝐴 ((¬ 𝑡 ≤ 𝑊 ∧ ¬ 𝑡 ≤ (𝑃 ∨ 𝑄)) → 𝑦 = 𝐺))
41		cdleme40r.o	. . . . . 6 ⊢ 𝑂 = (℩𝑧 ∈ 𝐵 ∀𝑣 ∈ 𝐴 ((¬ 𝑣 ≤ 𝑊 ∧ ¬ 𝑣 ≤ (𝑃 ∨ 𝑄)) → 𝑧 = 𝑋))
42	39, 40, 41	3eqtr4g 2797	. . . . 5 ⊢ (𝑠 = 𝑢 → 𝐼 = 𝑂)
43		oveq1 7368	. . . . . . 7 ⊢ (𝑠 = 𝑢 → (𝑠 ∨ 𝑈) = (𝑢 ∨ 𝑈))
44		oveq2 7369	. . . . . . . . 9 ⊢ (𝑠 = 𝑢 → (𝑃 ∨ 𝑠) = (𝑃 ∨ 𝑢))
45	44	oveq1d 7376	. . . . . . . 8 ⊢ (𝑠 = 𝑢 → ((𝑃 ∨ 𝑠) ∧ 𝑊) = ((𝑃 ∨ 𝑢) ∧ 𝑊))
46	45	oveq2d 7377	. . . . . . 7 ⊢ (𝑠 = 𝑢 → (𝑄 ∨ ((𝑃 ∨ 𝑠) ∧ 𝑊)) = (𝑄 ∨ ((𝑃 ∨ 𝑢) ∧ 𝑊)))
47	43, 46	oveq12d 7379	. . . . . 6 ⊢ (𝑠 = 𝑢 → ((𝑠 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑠) ∧ 𝑊))) = ((𝑢 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑢) ∧ 𝑊))))
48		cdleme40.d	. . . . . 6 ⊢ 𝐷 = ((𝑠 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑠) ∧ 𝑊)))
49		cdleme40r.y	. . . . . 6 ⊢ 𝑌 = ((𝑢 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑢) ∧ 𝑊)))
50	47, 48, 49	3eqtr4g 2797	. . . . 5 ⊢ (𝑠 = 𝑢 → 𝐷 = 𝑌)
51	1, 42, 50	ifbieq12d 4496	. . . 4 ⊢ (𝑠 = 𝑢 → if(𝑠 ≤ (𝑃 ∨ 𝑄), 𝐼, 𝐷) = if(𝑢 ≤ (𝑃 ∨ 𝑄), 𝑂, 𝑌))
52		cdleme40.n	. . . 4 ⊢ 𝑁 = if(𝑠 ≤ (𝑃 ∨ 𝑄), 𝐼, 𝐷)
53		cdleme40r.v	. . . 4 ⊢ 𝑉 = if(𝑢 ≤ (𝑃 ∨ 𝑄), 𝑂, 𝑌)
54	51, 52, 53	3eqtr4g 2797	. . 3 ⊢ (𝑠 = 𝑢 → 𝑁 = 𝑉)
55	54	cbvcsbv 3850	. 2 ⊢ ⦋𝑅 / 𝑠⦌𝑁 = ⦋𝑅 / 𝑢⦌𝑉
56	55	a1i 11	1 ⊢ (𝑅 ∈ 𝐴 → ⦋𝑅 / 𝑠⦌𝑁 = ⦋𝑅 / 𝑢⦌𝑉)

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 395   = wceq 1542   ∈ wcel 2114  ∀wral 3052  ⦋csb 3838  ifcif 4467   class class class wbr 5086  ‘cfv 6493  ℩crio 7317  (class class class)co 7361  Basecbs 17173  lecple 17221  joincjn 18271  meetcmee 18272  Atomscatm 39726  LHypclh 40447

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-ext 2709

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-sb 2069  df-clab 2716  df-cleq 2729  df-clel 2812  df-ral 3053  df-rab 3391  df-v 3432  df-sbc 3730  df-csb 3839  df-dif 3893  df-un 3895  df-ss 3907  df-nul 4275  df-if 4468  df-sn 4569  df-pr 4571  df-op 4575  df-uni 4852  df-br 5087  df-iota 6449  df-fv 6501  df-riota 7318  df-ov 7364

This theorem is referenced by:  cdleme40w  40933