Theorem finexdc 7159

Description: Decidability of existence, over a finite set and defined by a decidable proposition. (Contributed by Jim Kingdon, 12-Jul-2022.)

Assertion

Ref	Expression
finexdc	⊢ ((𝐴 ∈ Fin ∧ ∀𝑥 ∈ 𝐴 DECID 𝜑) → DECID ∃𝑥 ∈ 𝐴 𝜑)

Distinct variable group:   𝑥,𝐴

Allowed substitution hint:   𝜑(𝑥)

Proof of Theorem finexdc

Dummy variables 𝑤 𝑦 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		rexeq 2741	. . 3 ⊢ (𝑤 = ∅ → (∃𝑥 ∈ 𝑤 𝜑 ↔ ∃𝑥 ∈ ∅ 𝜑))
2	1	dcbid 846	. 2 ⊢ (𝑤 = ∅ → (DECID ∃𝑥 ∈ 𝑤 𝜑 ↔ DECID ∃𝑥 ∈ ∅ 𝜑))
3		rexeq 2741	. . 3 ⊢ (𝑤 = 𝑦 → (∃𝑥 ∈ 𝑤 𝜑 ↔ ∃𝑥 ∈ 𝑦 𝜑))
4	3	dcbid 846	. 2 ⊢ (𝑤 = 𝑦 → (DECID ∃𝑥 ∈ 𝑤 𝜑 ↔ DECID ∃𝑥 ∈ 𝑦 𝜑))
5		rexeq 2741	. . 3 ⊢ (𝑤 = (𝑦 ∪ {𝑧}) → (∃𝑥 ∈ 𝑤 𝜑 ↔ ∃𝑥 ∈ (𝑦 ∪ {𝑧})𝜑))
6	5	dcbid 846	. 2 ⊢ (𝑤 = (𝑦 ∪ {𝑧}) → (DECID ∃𝑥 ∈ 𝑤 𝜑 ↔ DECID ∃𝑥 ∈ (𝑦 ∪ {𝑧})𝜑))
7		rexeq 2741	. . 3 ⊢ (𝑤 = 𝐴 → (∃𝑥 ∈ 𝑤 𝜑 ↔ ∃𝑥 ∈ 𝐴 𝜑))
8	7	dcbid 846	. 2 ⊢ (𝑤 = 𝐴 → (DECID ∃𝑥 ∈ 𝑤 𝜑 ↔ DECID ∃𝑥 ∈ 𝐴 𝜑))
9		rex0 3525	. . . . 5 ⊢ ¬ ∃𝑥 ∈ ∅ 𝜑
10	9	olci 740	. . . 4 ⊢ (∃𝑥 ∈ ∅ 𝜑 ∨ ¬ ∃𝑥 ∈ ∅ 𝜑)
11		df-dc 843	. . . 4 ⊢ (DECID ∃𝑥 ∈ ∅ 𝜑 ↔ (∃𝑥 ∈ ∅ 𝜑 ∨ ¬ ∃𝑥 ∈ ∅ 𝜑))
12	10, 11	mpbir 146	. . 3 ⊢ DECID ∃𝑥 ∈ ∅ 𝜑
13	12	a1i 9	. 2 ⊢ ((𝐴 ∈ Fin ∧ ∀𝑥 ∈ 𝐴 DECID 𝜑) → DECID ∃𝑥 ∈ ∅ 𝜑)
14		simpr 110	. . . . . . . . 9 ⊢ ((((((𝐴 ∈ Fin ∧ ∀𝑥 ∈ 𝐴 DECID 𝜑) ∧ 𝑦 ∈ Fin) ∧ (𝑦 ⊆ 𝐴 ∧ 𝑧 ∈ (𝐴 ∖ 𝑦))) ∧ DECID ∃𝑥 ∈ 𝑦 𝜑) ∧ [𝑧 / 𝑥]𝜑) → [𝑧 / 𝑥]𝜑)
15		sbsbc 3045	. . . . . . . . . 10 ⊢ ([𝑧 / 𝑥]𝜑 ↔ [𝑧 / 𝑥]𝜑)
16		rexsns 3727	. . . . . . . . . 10 ⊢ (∃𝑥 ∈ {𝑧}𝜑 ↔ [𝑧 / 𝑥]𝜑)
17	15, 16	bitr4i 187	. . . . . . . . 9 ⊢ ([𝑧 / 𝑥]𝜑 ↔ ∃𝑥 ∈ {𝑧}𝜑)
18	14, 17	sylib 122	. . . . . . . 8 ⊢ ((((((𝐴 ∈ Fin ∧ ∀𝑥 ∈ 𝐴 DECID 𝜑) ∧ 𝑦 ∈ Fin) ∧ (𝑦 ⊆ 𝐴 ∧ 𝑧 ∈ (𝐴 ∖ 𝑦))) ∧ DECID ∃𝑥 ∈ 𝑦 𝜑) ∧ [𝑧 / 𝑥]𝜑) → ∃𝑥 ∈ {𝑧}𝜑)
19	18	olcd 742	. . . . . . 7 ⊢ ((((((𝐴 ∈ Fin ∧ ∀𝑥 ∈ 𝐴 DECID 𝜑) ∧ 𝑦 ∈ Fin) ∧ (𝑦 ⊆ 𝐴 ∧ 𝑧 ∈ (𝐴 ∖ 𝑦))) ∧ DECID ∃𝑥 ∈ 𝑦 𝜑) ∧ [𝑧 / 𝑥]𝜑) → (∃𝑥 ∈ 𝑦 𝜑 ∨ ∃𝑥 ∈ {𝑧}𝜑))
20		rexun 3398	. . . . . . 7 ⊢ (∃𝑥 ∈ (𝑦 ∪ {𝑧})𝜑 ↔ (∃𝑥 ∈ 𝑦 𝜑 ∨ ∃𝑥 ∈ {𝑧}𝜑))
21	19, 20	sylibr 134	. . . . . 6 ⊢ ((((((𝐴 ∈ Fin ∧ ∀𝑥 ∈ 𝐴 DECID 𝜑) ∧ 𝑦 ∈ Fin) ∧ (𝑦 ⊆ 𝐴 ∧ 𝑧 ∈ (𝐴 ∖ 𝑦))) ∧ DECID ∃𝑥 ∈ 𝑦 𝜑) ∧ [𝑧 / 𝑥]𝜑) → ∃𝑥 ∈ (𝑦 ∪ {𝑧})𝜑)
22	21	orcd 741	. . . . 5 ⊢ ((((((𝐴 ∈ Fin ∧ ∀𝑥 ∈ 𝐴 DECID 𝜑) ∧ 𝑦 ∈ Fin) ∧ (𝑦 ⊆ 𝐴 ∧ 𝑧 ∈ (𝐴 ∖ 𝑦))) ∧ DECID ∃𝑥 ∈ 𝑦 𝜑) ∧ [𝑧 / 𝑥]𝜑) → (∃𝑥 ∈ (𝑦 ∪ {𝑧})𝜑 ∨ ¬ ∃𝑥 ∈ (𝑦 ∪ {𝑧})𝜑))
23		df-dc 843	. . . . 5 ⊢ (DECID ∃𝑥 ∈ (𝑦 ∪ {𝑧})𝜑 ↔ (∃𝑥 ∈ (𝑦 ∪ {𝑧})𝜑 ∨ ¬ ∃𝑥 ∈ (𝑦 ∪ {𝑧})𝜑))
24	22, 23	sylibr 134	. . . 4 ⊢ ((((((𝐴 ∈ Fin ∧ ∀𝑥 ∈ 𝐴 DECID 𝜑) ∧ 𝑦 ∈ Fin) ∧ (𝑦 ⊆ 𝐴 ∧ 𝑧 ∈ (𝐴 ∖ 𝑦))) ∧ DECID ∃𝑥 ∈ 𝑦 𝜑) ∧ [𝑧 / 𝑥]𝜑) → DECID ∃𝑥 ∈ (𝑦 ∪ {𝑧})𝜑)
25		simpr 110	. . . . . . . . 9 ⊢ (((((((𝐴 ∈ Fin ∧ ∀𝑥 ∈ 𝐴 DECID 𝜑) ∧ 𝑦 ∈ Fin) ∧ (𝑦 ⊆ 𝐴 ∧ 𝑧 ∈ (𝐴 ∖ 𝑦))) ∧ DECID ∃𝑥 ∈ 𝑦 𝜑) ∧ ¬ [𝑧 / 𝑥]𝜑) ∧ ∃𝑥 ∈ 𝑦 𝜑) → ∃𝑥 ∈ 𝑦 𝜑)
26	25	orcd 741	. . . . . . . 8 ⊢ (((((((𝐴 ∈ Fin ∧ ∀𝑥 ∈ 𝐴 DECID 𝜑) ∧ 𝑦 ∈ Fin) ∧ (𝑦 ⊆ 𝐴 ∧ 𝑧 ∈ (𝐴 ∖ 𝑦))) ∧ DECID ∃𝑥 ∈ 𝑦 𝜑) ∧ ¬ [𝑧 / 𝑥]𝜑) ∧ ∃𝑥 ∈ 𝑦 𝜑) → (∃𝑥 ∈ 𝑦 𝜑 ∨ ∃𝑥 ∈ {𝑧}𝜑))
27	26, 20	sylibr 134	. . . . . . 7 ⊢ (((((((𝐴 ∈ Fin ∧ ∀𝑥 ∈ 𝐴 DECID 𝜑) ∧ 𝑦 ∈ Fin) ∧ (𝑦 ⊆ 𝐴 ∧ 𝑧 ∈ (𝐴 ∖ 𝑦))) ∧ DECID ∃𝑥 ∈ 𝑦 𝜑) ∧ ¬ [𝑧 / 𝑥]𝜑) ∧ ∃𝑥 ∈ 𝑦 𝜑) → ∃𝑥 ∈ (𝑦 ∪ {𝑧})𝜑)
28	27	orcd 741	. . . . . 6 ⊢ (((((((𝐴 ∈ Fin ∧ ∀𝑥 ∈ 𝐴 DECID 𝜑) ∧ 𝑦 ∈ Fin) ∧ (𝑦 ⊆ 𝐴 ∧ 𝑧 ∈ (𝐴 ∖ 𝑦))) ∧ DECID ∃𝑥 ∈ 𝑦 𝜑) ∧ ¬ [𝑧 / 𝑥]𝜑) ∧ ∃𝑥 ∈ 𝑦 𝜑) → (∃𝑥 ∈ (𝑦 ∪ {𝑧})𝜑 ∨ ¬ ∃𝑥 ∈ (𝑦 ∪ {𝑧})𝜑))
29	28, 23	sylibr 134	. . . . 5 ⊢ (((((((𝐴 ∈ Fin ∧ ∀𝑥 ∈ 𝐴 DECID 𝜑) ∧ 𝑦 ∈ Fin) ∧ (𝑦 ⊆ 𝐴 ∧ 𝑧 ∈ (𝐴 ∖ 𝑦))) ∧ DECID ∃𝑥 ∈ 𝑦 𝜑) ∧ ¬ [𝑧 / 𝑥]𝜑) ∧ ∃𝑥 ∈ 𝑦 𝜑) → DECID ∃𝑥 ∈ (𝑦 ∪ {𝑧})𝜑)
30		simpr 110	. . . . . . . . 9 ⊢ (((((((𝐴 ∈ Fin ∧ ∀𝑥 ∈ 𝐴 DECID 𝜑) ∧ 𝑦 ∈ Fin) ∧ (𝑦 ⊆ 𝐴 ∧ 𝑧 ∈ (𝐴 ∖ 𝑦))) ∧ DECID ∃𝑥 ∈ 𝑦 𝜑) ∧ ¬ [𝑧 / 𝑥]𝜑) ∧ ¬ ∃𝑥 ∈ 𝑦 𝜑) → ¬ ∃𝑥 ∈ 𝑦 𝜑)
31		simpr 110	. . . . . . . . . . 11 ⊢ ((((((𝐴 ∈ Fin ∧ ∀𝑥 ∈ 𝐴 DECID 𝜑) ∧ 𝑦 ∈ Fin) ∧ (𝑦 ⊆ 𝐴 ∧ 𝑧 ∈ (𝐴 ∖ 𝑦))) ∧ DECID ∃𝑥 ∈ 𝑦 𝜑) ∧ ¬ [𝑧 / 𝑥]𝜑) → ¬ [𝑧 / 𝑥]𝜑)
32	17	notbii 674	. . . . . . . . . . 11 ⊢ (¬ [𝑧 / 𝑥]𝜑 ↔ ¬ ∃𝑥 ∈ {𝑧}𝜑)
33	31, 32	sylib 122	. . . . . . . . . 10 ⊢ ((((((𝐴 ∈ Fin ∧ ∀𝑥 ∈ 𝐴 DECID 𝜑) ∧ 𝑦 ∈ Fin) ∧ (𝑦 ⊆ 𝐴 ∧ 𝑧 ∈ (𝐴 ∖ 𝑦))) ∧ DECID ∃𝑥 ∈ 𝑦 𝜑) ∧ ¬ [𝑧 / 𝑥]𝜑) → ¬ ∃𝑥 ∈ {𝑧}𝜑)
34	33	adantr 276	. . . . . . . . 9 ⊢ (((((((𝐴 ∈ Fin ∧ ∀𝑥 ∈ 𝐴 DECID 𝜑) ∧ 𝑦 ∈ Fin) ∧ (𝑦 ⊆ 𝐴 ∧ 𝑧 ∈ (𝐴 ∖ 𝑦))) ∧ DECID ∃𝑥 ∈ 𝑦 𝜑) ∧ ¬ [𝑧 / 𝑥]𝜑) ∧ ¬ ∃𝑥 ∈ 𝑦 𝜑) → ¬ ∃𝑥 ∈ {𝑧}𝜑)
35		ioran 760	. . . . . . . . 9 ⊢ (¬ (∃𝑥 ∈ 𝑦 𝜑 ∨ ∃𝑥 ∈ {𝑧}𝜑) ↔ (¬ ∃𝑥 ∈ 𝑦 𝜑 ∧ ¬ ∃𝑥 ∈ {𝑧}𝜑))
36	30, 34, 35	sylanbrc 417	. . . . . . . 8 ⊢ (((((((𝐴 ∈ Fin ∧ ∀𝑥 ∈ 𝐴 DECID 𝜑) ∧ 𝑦 ∈ Fin) ∧ (𝑦 ⊆ 𝐴 ∧ 𝑧 ∈ (𝐴 ∖ 𝑦))) ∧ DECID ∃𝑥 ∈ 𝑦 𝜑) ∧ ¬ [𝑧 / 𝑥]𝜑) ∧ ¬ ∃𝑥 ∈ 𝑦 𝜑) → ¬ (∃𝑥 ∈ 𝑦 𝜑 ∨ ∃𝑥 ∈ {𝑧}𝜑))
37	20	notbii 674	. . . . . . . 8 ⊢ (¬ ∃𝑥 ∈ (𝑦 ∪ {𝑧})𝜑 ↔ ¬ (∃𝑥 ∈ 𝑦 𝜑 ∨ ∃𝑥 ∈ {𝑧}𝜑))
38	36, 37	sylibr 134	. . . . . . 7 ⊢ (((((((𝐴 ∈ Fin ∧ ∀𝑥 ∈ 𝐴 DECID 𝜑) ∧ 𝑦 ∈ Fin) ∧ (𝑦 ⊆ 𝐴 ∧ 𝑧 ∈ (𝐴 ∖ 𝑦))) ∧ DECID ∃𝑥 ∈ 𝑦 𝜑) ∧ ¬ [𝑧 / 𝑥]𝜑) ∧ ¬ ∃𝑥 ∈ 𝑦 𝜑) → ¬ ∃𝑥 ∈ (𝑦 ∪ {𝑧})𝜑)
39	38	olcd 742	. . . . . 6 ⊢ (((((((𝐴 ∈ Fin ∧ ∀𝑥 ∈ 𝐴 DECID 𝜑) ∧ 𝑦 ∈ Fin) ∧ (𝑦 ⊆ 𝐴 ∧ 𝑧 ∈ (𝐴 ∖ 𝑦))) ∧ DECID ∃𝑥 ∈ 𝑦 𝜑) ∧ ¬ [𝑧 / 𝑥]𝜑) ∧ ¬ ∃𝑥 ∈ 𝑦 𝜑) → (∃𝑥 ∈ (𝑦 ∪ {𝑧})𝜑 ∨ ¬ ∃𝑥 ∈ (𝑦 ∪ {𝑧})𝜑))
40	39, 23	sylibr 134	. . . . 5 ⊢ (((((((𝐴 ∈ Fin ∧ ∀𝑥 ∈ 𝐴 DECID 𝜑) ∧ 𝑦 ∈ Fin) ∧ (𝑦 ⊆ 𝐴 ∧ 𝑧 ∈ (𝐴 ∖ 𝑦))) ∧ DECID ∃𝑥 ∈ 𝑦 𝜑) ∧ ¬ [𝑧 / 𝑥]𝜑) ∧ ¬ ∃𝑥 ∈ 𝑦 𝜑) → DECID ∃𝑥 ∈ (𝑦 ∪ {𝑧})𝜑)
41		exmiddc 844	. . . . . 6 ⊢ (DECID ∃𝑥 ∈ 𝑦 𝜑 → (∃𝑥 ∈ 𝑦 𝜑 ∨ ¬ ∃𝑥 ∈ 𝑦 𝜑))
42	41	ad2antlr 489	. . . . 5 ⊢ ((((((𝐴 ∈ Fin ∧ ∀𝑥 ∈ 𝐴 DECID 𝜑) ∧ 𝑦 ∈ Fin) ∧ (𝑦 ⊆ 𝐴 ∧ 𝑧 ∈ (𝐴 ∖ 𝑦))) ∧ DECID ∃𝑥 ∈ 𝑦 𝜑) ∧ ¬ [𝑧 / 𝑥]𝜑) → (∃𝑥 ∈ 𝑦 𝜑 ∨ ¬ ∃𝑥 ∈ 𝑦 𝜑))
43	29, 40, 42	mpjaodan 806	. . . 4 ⊢ ((((((𝐴 ∈ Fin ∧ ∀𝑥 ∈ 𝐴 DECID 𝜑) ∧ 𝑦 ∈ Fin) ∧ (𝑦 ⊆ 𝐴 ∧ 𝑧 ∈ (𝐴 ∖ 𝑦))) ∧ DECID ∃𝑥 ∈ 𝑦 𝜑) ∧ ¬ [𝑧 / 𝑥]𝜑) → DECID ∃𝑥 ∈ (𝑦 ∪ {𝑧})𝜑)
44		simplrr 538	. . . . . . 7 ⊢ (((((𝐴 ∈ Fin ∧ ∀𝑥 ∈ 𝐴 DECID 𝜑) ∧ 𝑦 ∈ Fin) ∧ (𝑦 ⊆ 𝐴 ∧ 𝑧 ∈ (𝐴 ∖ 𝑦))) ∧ DECID ∃𝑥 ∈ 𝑦 𝜑) → 𝑧 ∈ (𝐴 ∖ 𝑦))
45	44	eldifad 3221	. . . . . 6 ⊢ (((((𝐴 ∈ Fin ∧ ∀𝑥 ∈ 𝐴 DECID 𝜑) ∧ 𝑦 ∈ Fin) ∧ (𝑦 ⊆ 𝐴 ∧ 𝑧 ∈ (𝐴 ∖ 𝑦))) ∧ DECID ∃𝑥 ∈ 𝑦 𝜑) → 𝑧 ∈ 𝐴)
46		simp-4r 544	. . . . . 6 ⊢ (((((𝐴 ∈ Fin ∧ ∀𝑥 ∈ 𝐴 DECID 𝜑) ∧ 𝑦 ∈ Fin) ∧ (𝑦 ⊆ 𝐴 ∧ 𝑧 ∈ (𝐴 ∖ 𝑦))) ∧ DECID ∃𝑥 ∈ 𝑦 𝜑) → ∀𝑥 ∈ 𝐴 DECID 𝜑)
47		nfs1v 1993	. . . . . . . 8 ⊢ Ⅎ𝑥[𝑧 / 𝑥]𝜑
48	47	nfdc 1707	. . . . . . 7 ⊢ Ⅎ𝑥DECID [𝑧 / 𝑥]𝜑
49		sbequ12 1820	. . . . . . . 8 ⊢ (𝑥 = 𝑧 → (𝜑 ↔ [𝑧 / 𝑥]𝜑))
50	49	dcbid 846	. . . . . . 7 ⊢ (𝑥 = 𝑧 → (DECID 𝜑 ↔ DECID [𝑧 / 𝑥]𝜑))
51	48, 50	rspc 2914	. . . . . 6 ⊢ (𝑧 ∈ 𝐴 → (∀𝑥 ∈ 𝐴 DECID 𝜑 → DECID [𝑧 / 𝑥]𝜑))
52	45, 46, 51	sylc 62	. . . . 5 ⊢ (((((𝐴 ∈ Fin ∧ ∀𝑥 ∈ 𝐴 DECID 𝜑) ∧ 𝑦 ∈ Fin) ∧ (𝑦 ⊆ 𝐴 ∧ 𝑧 ∈ (𝐴 ∖ 𝑦))) ∧ DECID ∃𝑥 ∈ 𝑦 𝜑) → DECID [𝑧 / 𝑥]𝜑)
53		exmiddc 844	. . . . 5 ⊢ (DECID [𝑧 / 𝑥]𝜑 → ([𝑧 / 𝑥]𝜑 ∨ ¬ [𝑧 / 𝑥]𝜑))
54	52, 53	syl 14	. . . 4 ⊢ (((((𝐴 ∈ Fin ∧ ∀𝑥 ∈ 𝐴 DECID 𝜑) ∧ 𝑦 ∈ Fin) ∧ (𝑦 ⊆ 𝐴 ∧ 𝑧 ∈ (𝐴 ∖ 𝑦))) ∧ DECID ∃𝑥 ∈ 𝑦 𝜑) → ([𝑧 / 𝑥]𝜑 ∨ ¬ [𝑧 / 𝑥]𝜑))
55	24, 43, 54	mpjaodan 806	. . 3 ⊢ (((((𝐴 ∈ Fin ∧ ∀𝑥 ∈ 𝐴 DECID 𝜑) ∧ 𝑦 ∈ Fin) ∧ (𝑦 ⊆ 𝐴 ∧ 𝑧 ∈ (𝐴 ∖ 𝑦))) ∧ DECID ∃𝑥 ∈ 𝑦 𝜑) → DECID ∃𝑥 ∈ (𝑦 ∪ {𝑧})𝜑)
56	55	ex 115	. 2 ⊢ ((((𝐴 ∈ Fin ∧ ∀𝑥 ∈ 𝐴 DECID 𝜑) ∧ 𝑦 ∈ Fin) ∧ (𝑦 ⊆ 𝐴 ∧ 𝑧 ∈ (𝐴 ∖ 𝑦))) → (DECID ∃𝑥 ∈ 𝑦 𝜑 → DECID ∃𝑥 ∈ (𝑦 ∪ {𝑧})𝜑))
57		simpl 109	. 2 ⊢ ((𝐴 ∈ Fin ∧ ∀𝑥 ∈ 𝐴 DECID 𝜑) → 𝐴 ∈ Fin)
58	2, 4, 6, 8, 13, 56, 57	findcard2sd 7148	1 ⊢ ((𝐴 ∈ Fin ∧ ∀𝑥 ∈ 𝐴 DECID 𝜑) → DECID ∃𝑥 ∈ 𝐴 𝜑)

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 104   ∨ wo 716  DECID wdc 842   = wceq 1398  [wsb 1811   ∈ wcel 2203  ∀wral 2520  ∃wrex 2521  [wsbc 3041   ∖ cdif 3207   ∪ cun 3208   ⊆ wss 3210  ∅c0 3507  {csn 3688  Fincfn 6974

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 619  ax-in2 620  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2205  ax-14 2206  ax-ext 2214  ax-coll 4224  ax-sep 4227  ax-nul 4235  ax-pow 4286  ax-pr 4321  ax-un 4553  ax-setind 4658  ax-iinf 4709

This theorem depends on definitions:  df-bi 117  df-dc 843  df-3or 1006  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1812  df-eu 2083  df-mo 2084  df-clab 2219  df-cleq 2225  df-clel 2228  df-nfc 2373  df-ne 2413  df-ral 2525  df-rex 2526  df-reu 2527  df-rab 2529  df-v 2814  df-sbc 3042  df-csb 3138  df-dif 3212  df-un 3214  df-in 3216  df-ss 3223  df-nul 3508  df-if 3620  df-pw 3670  df-sn 3694  df-pr 3695  df-op 3697  df-uni 3914  df-int 3949  df-iun 3992  df-br 4109  df-opab 4171  df-mpt 4172  df-tr 4208  df-id 4413  df-iord 4486  df-on 4488  df-suc 4491  df-iom 4712  df-xp 4754  df-rel 4755  df-cnv 4756  df-co 4757  df-dm 4758  df-rn 4759  df-res 4760  df-ima 4761  df-iota 5311  df-fun 5353  df-fn 5354  df-f 5355  df-f1 5356  df-fo 5357  df-f1o 5358  df-fv 5359  df-er 6766  df-en 6975  df-fin 6977

This theorem is referenced by:  dfrex2fin  7160  nninfwlpoimlemg  7465  nninfwlpoimlemginf  7466  4sqleminfi  13088