Theorem exfzdc 10233

Description: Decidability of the existence of an integer defined by a decidable proposition. (Contributed by Jim Kingdon, 28-Jan-2022.)

Hypotheses

Ref	Expression
exfzdc.1	⊢ (𝜑 → 𝑀 ∈ ℤ)
exfzdc.2	⊢ (𝜑 → 𝑁 ∈ ℤ)
exfzdc.3	⊢ ((𝜑 ∧ 𝑛 ∈ (𝑀...𝑁)) → DECID 𝜓)

Assertion

Ref	Expression
exfzdc	⊢ (𝜑 → DECID ∃𝑛 ∈ (𝑀...𝑁)𝜓)

Distinct variable groups:   𝑛,𝑀   𝑛,𝑁   𝜑,𝑛

Allowed substitution hint:   𝜓(𝑛)

Proof of Theorem exfzdc

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

Step	Hyp	Ref	Expression
1		exfzdc.1	. . . . 5 ⊢ (𝜑 → 𝑀 ∈ ℤ)
2		exfzdc.2	. . . . 5 ⊢ (𝜑 → 𝑁 ∈ ℤ)
3		eluz 9535	. . . . 5 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝑁 ∈ (ℤ≥‘𝑀) ↔ 𝑀 ≤ 𝑁))
4	1, 2, 3	syl2anc 411	. . . 4 ⊢ (𝜑 → (𝑁 ∈ (ℤ≥‘𝑀) ↔ 𝑀 ≤ 𝑁))
5	4	biimpar 297	. . 3 ⊢ ((𝜑 ∧ 𝑀 ≤ 𝑁) → 𝑁 ∈ (ℤ≥‘𝑀))
6		simpl 109	. . 3 ⊢ ((𝜑 ∧ 𝑀 ≤ 𝑁) → 𝜑)
7		eluzfz2 10025	. . . 4 ⊢ (𝑁 ∈ (ℤ≥‘𝑀) → 𝑁 ∈ (𝑀...𝑁))
8		oveq2 5878	. . . . . . . 8 ⊢ (𝑤 = 𝑀 → (𝑀...𝑤) = (𝑀...𝑀))
9	8	rexeqdv 2679	. . . . . . 7 ⊢ (𝑤 = 𝑀 → (∃𝑛 ∈ (𝑀...𝑤)𝜓 ↔ ∃𝑛 ∈ (𝑀...𝑀)𝜓))
10	9	dcbid 838	. . . . . 6 ⊢ (𝑤 = 𝑀 → (DECID ∃𝑛 ∈ (𝑀...𝑤)𝜓 ↔ DECID ∃𝑛 ∈ (𝑀...𝑀)𝜓))
11	10	imbi2d 230	. . . . 5 ⊢ (𝑤 = 𝑀 → ((𝜑 → DECID ∃𝑛 ∈ (𝑀...𝑤)𝜓) ↔ (𝜑 → DECID ∃𝑛 ∈ (𝑀...𝑀)𝜓)))
12		oveq2 5878	. . . . . . . 8 ⊢ (𝑤 = 𝑦 → (𝑀...𝑤) = (𝑀...𝑦))
13	12	rexeqdv 2679	. . . . . . 7 ⊢ (𝑤 = 𝑦 → (∃𝑛 ∈ (𝑀...𝑤)𝜓 ↔ ∃𝑛 ∈ (𝑀...𝑦)𝜓))
14	13	dcbid 838	. . . . . 6 ⊢ (𝑤 = 𝑦 → (DECID ∃𝑛 ∈ (𝑀...𝑤)𝜓 ↔ DECID ∃𝑛 ∈ (𝑀...𝑦)𝜓))
15	14	imbi2d 230	. . . . 5 ⊢ (𝑤 = 𝑦 → ((𝜑 → DECID ∃𝑛 ∈ (𝑀...𝑤)𝜓) ↔ (𝜑 → DECID ∃𝑛 ∈ (𝑀...𝑦)𝜓)))
16		oveq2 5878	. . . . . . . 8 ⊢ (𝑤 = (𝑦 + 1) → (𝑀...𝑤) = (𝑀...(𝑦 + 1)))
17	16	rexeqdv 2679	. . . . . . 7 ⊢ (𝑤 = (𝑦 + 1) → (∃𝑛 ∈ (𝑀...𝑤)𝜓 ↔ ∃𝑛 ∈ (𝑀...(𝑦 + 1))𝜓))
18	17	dcbid 838	. . . . . 6 ⊢ (𝑤 = (𝑦 + 1) → (DECID ∃𝑛 ∈ (𝑀...𝑤)𝜓 ↔ DECID ∃𝑛 ∈ (𝑀...(𝑦 + 1))𝜓))
19	18	imbi2d 230	. . . . 5 ⊢ (𝑤 = (𝑦 + 1) → ((𝜑 → DECID ∃𝑛 ∈ (𝑀...𝑤)𝜓) ↔ (𝜑 → DECID ∃𝑛 ∈ (𝑀...(𝑦 + 1))𝜓)))
20		oveq2 5878	. . . . . . . 8 ⊢ (𝑤 = 𝑁 → (𝑀...𝑤) = (𝑀...𝑁))
21	20	rexeqdv 2679	. . . . . . 7 ⊢ (𝑤 = 𝑁 → (∃𝑛 ∈ (𝑀...𝑤)𝜓 ↔ ∃𝑛 ∈ (𝑀...𝑁)𝜓))
22	21	dcbid 838	. . . . . 6 ⊢ (𝑤 = 𝑁 → (DECID ∃𝑛 ∈ (𝑀...𝑤)𝜓 ↔ DECID ∃𝑛 ∈ (𝑀...𝑁)𝜓))
23	22	imbi2d 230	. . . . 5 ⊢ (𝑤 = 𝑁 → ((𝜑 → DECID ∃𝑛 ∈ (𝑀...𝑤)𝜓) ↔ (𝜑 → DECID ∃𝑛 ∈ (𝑀...𝑁)𝜓)))
24		eluzfz1 10024	. . . . . . . . 9 ⊢ (𝑁 ∈ (ℤ≥‘𝑀) → 𝑀 ∈ (𝑀...𝑁))
25	24	adantl 277	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑁 ∈ (ℤ≥‘𝑀)) → 𝑀 ∈ (𝑀...𝑁))
26		exfzdc.3	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑛 ∈ (𝑀...𝑁)) → DECID 𝜓)
27	26	ralrimiva 2550	. . . . . . . . 9 ⊢ (𝜑 → ∀𝑛 ∈ (𝑀...𝑁)DECID 𝜓)
28	27	adantr 276	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑁 ∈ (ℤ≥‘𝑀)) → ∀𝑛 ∈ (𝑀...𝑁)DECID 𝜓)
29		nfsbc1v 2981	. . . . . . . . . 10 ⊢ Ⅎ𝑛[𝑀 / 𝑛]𝜓
30	29	nfdc 1659	. . . . . . . . 9 ⊢ Ⅎ𝑛DECID [𝑀 / 𝑛]𝜓
31		sbceq1a 2972	. . . . . . . . . 10 ⊢ (𝑛 = 𝑀 → (𝜓 ↔ [𝑀 / 𝑛]𝜓))
32	31	dcbid 838	. . . . . . . . 9 ⊢ (𝑛 = 𝑀 → (DECID 𝜓 ↔ DECID [𝑀 / 𝑛]𝜓))
33	30, 32	rspc 2835	. . . . . . . 8 ⊢ (𝑀 ∈ (𝑀...𝑁) → (∀𝑛 ∈ (𝑀...𝑁)DECID 𝜓 → DECID [𝑀 / 𝑛]𝜓))
34	25, 28, 33	sylc 62	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑁 ∈ (ℤ≥‘𝑀)) → DECID [𝑀 / 𝑛]𝜓)
35	1	adantr 276	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑁 ∈ (ℤ≥‘𝑀)) → 𝑀 ∈ ℤ)
36		fzsn 10059	. . . . . . . . . . 11 ⊢ (𝑀 ∈ ℤ → (𝑀...𝑀) = {𝑀})
37	35, 36	syl 14	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑁 ∈ (ℤ≥‘𝑀)) → (𝑀...𝑀) = {𝑀})
38	37	rexeqdv 2679	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑁 ∈ (ℤ≥‘𝑀)) → (∃𝑛 ∈ (𝑀...𝑀)𝜓 ↔ ∃𝑛 ∈ {𝑀}𝜓))
39		rexsns 3631	. . . . . . . . 9 ⊢ (∃𝑛 ∈ {𝑀}𝜓 ↔ [𝑀 / 𝑛]𝜓)
40	38, 39	bitrdi 196	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑁 ∈ (ℤ≥‘𝑀)) → (∃𝑛 ∈ (𝑀...𝑀)𝜓 ↔ [𝑀 / 𝑛]𝜓))
41	40	dcbid 838	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑁 ∈ (ℤ≥‘𝑀)) → (DECID ∃𝑛 ∈ (𝑀...𝑀)𝜓 ↔ DECID [𝑀 / 𝑛]𝜓))
42	34, 41	mpbird 167	. . . . . 6 ⊢ ((𝜑 ∧ 𝑁 ∈ (ℤ≥‘𝑀)) → DECID ∃𝑛 ∈ (𝑀...𝑀)𝜓)
43	42	expcom 116	. . . . 5 ⊢ (𝑁 ∈ (ℤ≥‘𝑀) → (𝜑 → DECID ∃𝑛 ∈ (𝑀...𝑀)𝜓))
44		simpr 110	. . . . . . . . . 10 ⊢ (((𝑦 ∈ (𝑀..^𝑁) ∧ 𝜑) ∧ DECID ∃𝑛 ∈ (𝑀...𝑦)𝜓) → DECID ∃𝑛 ∈ (𝑀...𝑦)𝜓)
45		fzofzp1 10220	. . . . . . . . . . . . 13 ⊢ (𝑦 ∈ (𝑀..^𝑁) → (𝑦 + 1) ∈ (𝑀...𝑁))
46	45	ad2antrr 488	. . . . . . . . . . . 12 ⊢ (((𝑦 ∈ (𝑀..^𝑁) ∧ 𝜑) ∧ DECID ∃𝑛 ∈ (𝑀...𝑦)𝜓) → (𝑦 + 1) ∈ (𝑀...𝑁))
47	27	ad2antlr 489	. . . . . . . . . . . 12 ⊢ (((𝑦 ∈ (𝑀..^𝑁) ∧ 𝜑) ∧ DECID ∃𝑛 ∈ (𝑀...𝑦)𝜓) → ∀𝑛 ∈ (𝑀...𝑁)DECID 𝜓)
48		nfsbc1v 2981	. . . . . . . . . . . . . 14 ⊢ Ⅎ𝑛[(𝑦 + 1) / 𝑛]𝜓
49	48	nfdc 1659	. . . . . . . . . . . . 13 ⊢ Ⅎ𝑛DECID [(𝑦 + 1) / 𝑛]𝜓
50		sbceq1a 2972	. . . . . . . . . . . . . 14 ⊢ (𝑛 = (𝑦 + 1) → (𝜓 ↔ [(𝑦 + 1) / 𝑛]𝜓))
51	50	dcbid 838	. . . . . . . . . . . . 13 ⊢ (𝑛 = (𝑦 + 1) → (DECID 𝜓 ↔ DECID [(𝑦 + 1) / 𝑛]𝜓))
52	49, 51	rspc 2835	. . . . . . . . . . . 12 ⊢ ((𝑦 + 1) ∈ (𝑀...𝑁) → (∀𝑛 ∈ (𝑀...𝑁)DECID 𝜓 → DECID [(𝑦 + 1) / 𝑛]𝜓))
53	46, 47, 52	sylc 62	. . . . . . . . . . 11 ⊢ (((𝑦 ∈ (𝑀..^𝑁) ∧ 𝜑) ∧ DECID ∃𝑛 ∈ (𝑀...𝑦)𝜓) → DECID [(𝑦 + 1) / 𝑛]𝜓)
54		rexsns 3631	. . . . . . . . . . . 12 ⊢ (∃𝑛 ∈ {(𝑦 + 1)}𝜓 ↔ [(𝑦 + 1) / 𝑛]𝜓)
55	54	dcbii 840	. . . . . . . . . . 11 ⊢ (DECID ∃𝑛 ∈ {(𝑦 + 1)}𝜓 ↔ DECID [(𝑦 + 1) / 𝑛]𝜓)
56	53, 55	sylibr 134	. . . . . . . . . 10 ⊢ (((𝑦 ∈ (𝑀..^𝑁) ∧ 𝜑) ∧ DECID ∃𝑛 ∈ (𝑀...𝑦)𝜓) → DECID ∃𝑛 ∈ {(𝑦 + 1)}𝜓)
57		dcor 935	. . . . . . . . . 10 ⊢ (DECID ∃𝑛 ∈ (𝑀...𝑦)𝜓 → (DECID ∃𝑛 ∈ {(𝑦 + 1)}𝜓 → DECID (∃𝑛 ∈ (𝑀...𝑦)𝜓 ∨ ∃𝑛 ∈ {(𝑦 + 1)}𝜓)))
58	44, 56, 57	sylc 62	. . . . . . . . 9 ⊢ (((𝑦 ∈ (𝑀..^𝑁) ∧ 𝜑) ∧ DECID ∃𝑛 ∈ (𝑀...𝑦)𝜓) → DECID (∃𝑛 ∈ (𝑀...𝑦)𝜓 ∨ ∃𝑛 ∈ {(𝑦 + 1)}𝜓))
59		rexun 3315	. . . . . . . . . 10 ⊢ (∃𝑛 ∈ ((𝑀...𝑦) ∪ {(𝑦 + 1)})𝜓 ↔ (∃𝑛 ∈ (𝑀...𝑦)𝜓 ∨ ∃𝑛 ∈ {(𝑦 + 1)}𝜓))
60	59	dcbii 840	. . . . . . . . 9 ⊢ (DECID ∃𝑛 ∈ ((𝑀...𝑦) ∪ {(𝑦 + 1)})𝜓 ↔ DECID (∃𝑛 ∈ (𝑀...𝑦)𝜓 ∨ ∃𝑛 ∈ {(𝑦 + 1)}𝜓))
61	58, 60	sylibr 134	. . . . . . . 8 ⊢ (((𝑦 ∈ (𝑀..^𝑁) ∧ 𝜑) ∧ DECID ∃𝑛 ∈ (𝑀...𝑦)𝜓) → DECID ∃𝑛 ∈ ((𝑀...𝑦) ∪ {(𝑦 + 1)})𝜓)
62		elfzouz 10144	. . . . . . . . . . . 12 ⊢ (𝑦 ∈ (𝑀..^𝑁) → 𝑦 ∈ (ℤ≥‘𝑀))
63	62	ad2antrr 488	. . . . . . . . . . 11 ⊢ (((𝑦 ∈ (𝑀..^𝑁) ∧ 𝜑) ∧ DECID ∃𝑛 ∈ (𝑀...𝑦)𝜓) → 𝑦 ∈ (ℤ≥‘𝑀))
64		fzsuc 10062	. . . . . . . . . . 11 ⊢ (𝑦 ∈ (ℤ≥‘𝑀) → (𝑀...(𝑦 + 1)) = ((𝑀...𝑦) ∪ {(𝑦 + 1)}))
65	63, 64	syl 14	. . . . . . . . . 10 ⊢ (((𝑦 ∈ (𝑀..^𝑁) ∧ 𝜑) ∧ DECID ∃𝑛 ∈ (𝑀...𝑦)𝜓) → (𝑀...(𝑦 + 1)) = ((𝑀...𝑦) ∪ {(𝑦 + 1)}))
66	65	rexeqdv 2679	. . . . . . . . 9 ⊢ (((𝑦 ∈ (𝑀..^𝑁) ∧ 𝜑) ∧ DECID ∃𝑛 ∈ (𝑀...𝑦)𝜓) → (∃𝑛 ∈ (𝑀...(𝑦 + 1))𝜓 ↔ ∃𝑛 ∈ ((𝑀...𝑦) ∪ {(𝑦 + 1)})𝜓))
67	66	dcbid 838	. . . . . . . 8 ⊢ (((𝑦 ∈ (𝑀..^𝑁) ∧ 𝜑) ∧ DECID ∃𝑛 ∈ (𝑀...𝑦)𝜓) → (DECID ∃𝑛 ∈ (𝑀...(𝑦 + 1))𝜓 ↔ DECID ∃𝑛 ∈ ((𝑀...𝑦) ∪ {(𝑦 + 1)})𝜓))
68	61, 67	mpbird 167	. . . . . . 7 ⊢ (((𝑦 ∈ (𝑀..^𝑁) ∧ 𝜑) ∧ DECID ∃𝑛 ∈ (𝑀...𝑦)𝜓) → DECID ∃𝑛 ∈ (𝑀...(𝑦 + 1))𝜓)
69	68	exp31 364	. . . . . 6 ⊢ (𝑦 ∈ (𝑀..^𝑁) → (𝜑 → (DECID ∃𝑛 ∈ (𝑀...𝑦)𝜓 → DECID ∃𝑛 ∈ (𝑀...(𝑦 + 1))𝜓)))
70	69	a2d 26	. . . . 5 ⊢ (𝑦 ∈ (𝑀..^𝑁) → ((𝜑 → DECID ∃𝑛 ∈ (𝑀...𝑦)𝜓) → (𝜑 → DECID ∃𝑛 ∈ (𝑀...(𝑦 + 1))𝜓)))
71	11, 15, 19, 23, 43, 70	fzind2 10232	. . . 4 ⊢ (𝑁 ∈ (𝑀...𝑁) → (𝜑 → DECID ∃𝑛 ∈ (𝑀...𝑁)𝜓))
72	7, 71	syl 14	. . 3 ⊢ (𝑁 ∈ (ℤ≥‘𝑀) → (𝜑 → DECID ∃𝑛 ∈ (𝑀...𝑁)𝜓))
73	5, 6, 72	sylc 62	. 2 ⊢ ((𝜑 ∧ 𝑀 ≤ 𝑁) → DECID ∃𝑛 ∈ (𝑀...𝑁)𝜓)
74		rex0 3440	. . . . 5 ⊢ ¬ ∃𝑛 ∈ ∅ 𝜓
75		zltnle 9293	. . . . . . . . 9 ⊢ ((𝑁 ∈ ℤ ∧ 𝑀 ∈ ℤ) → (𝑁 < 𝑀 ↔ ¬ 𝑀 ≤ 𝑁))
76	2, 1, 75	syl2anc 411	. . . . . . . 8 ⊢ (𝜑 → (𝑁 < 𝑀 ↔ ¬ 𝑀 ≤ 𝑁))
77	76	biimpar 297	. . . . . . 7 ⊢ ((𝜑 ∧ ¬ 𝑀 ≤ 𝑁) → 𝑁 < 𝑀)
78		fzn 10035	. . . . . . . . 9 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝑁 < 𝑀 ↔ (𝑀...𝑁) = ∅))
79	1, 2, 78	syl2anc 411	. . . . . . . 8 ⊢ (𝜑 → (𝑁 < 𝑀 ↔ (𝑀...𝑁) = ∅))
80	79	adantr 276	. . . . . . 7 ⊢ ((𝜑 ∧ ¬ 𝑀 ≤ 𝑁) → (𝑁 < 𝑀 ↔ (𝑀...𝑁) = ∅))
81	77, 80	mpbid 147	. . . . . 6 ⊢ ((𝜑 ∧ ¬ 𝑀 ≤ 𝑁) → (𝑀...𝑁) = ∅)
82	81	rexeqdv 2679	. . . . 5 ⊢ ((𝜑 ∧ ¬ 𝑀 ≤ 𝑁) → (∃𝑛 ∈ (𝑀...𝑁)𝜓 ↔ ∃𝑛 ∈ ∅ 𝜓))
83	74, 82	mtbiri 675	. . . 4 ⊢ ((𝜑 ∧ ¬ 𝑀 ≤ 𝑁) → ¬ ∃𝑛 ∈ (𝑀...𝑁)𝜓)
84	83	olcd 734	. . 3 ⊢ ((𝜑 ∧ ¬ 𝑀 ≤ 𝑁) → (∃𝑛 ∈ (𝑀...𝑁)𝜓 ∨ ¬ ∃𝑛 ∈ (𝑀...𝑁)𝜓))
85		df-dc 835	. . 3 ⊢ (DECID ∃𝑛 ∈ (𝑀...𝑁)𝜓 ↔ (∃𝑛 ∈ (𝑀...𝑁)𝜓 ∨ ¬ ∃𝑛 ∈ (𝑀...𝑁)𝜓))
86	84, 85	sylibr 134	. 2 ⊢ ((𝜑 ∧ ¬ 𝑀 ≤ 𝑁) → DECID ∃𝑛 ∈ (𝑀...𝑁)𝜓)
87		zdcle 9323	. . . 4 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → DECID 𝑀 ≤ 𝑁)
88		exmiddc 836	. . . 4 ⊢ (DECID 𝑀 ≤ 𝑁 → (𝑀 ≤ 𝑁 ∨ ¬ 𝑀 ≤ 𝑁))
89	87, 88	syl 14	. . 3 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝑀 ≤ 𝑁 ∨ ¬ 𝑀 ≤ 𝑁))
90	1, 2, 89	syl2anc 411	. 2 ⊢ (𝜑 → (𝑀 ≤ 𝑁 ∨ ¬ 𝑀 ≤ 𝑁))
91	73, 86, 90	mpjaodan 798	1 ⊢ (𝜑 → DECID ∃𝑛 ∈ (𝑀...𝑁)𝜓)

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 104   ↔ wb 105   ∨ wo 708  DECID wdc 834   = wceq 1353   ∈ wcel 2148  ∀wral 2455  ∃wrex 2456  [wsbc 2962   ∪ cun 3127  ∅c0 3422  {csn 3592   class class class wbr 4001  ‘cfv 5213  (class class class)co 5870  1c1 7807   + caddc 7809   < clt 7986   ≤ cle 7987  ℤcz 9247  ℤ_≥cuz 9522  ...cfz 10002  ..^cfzo 10135

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 614  ax-in2 615  ax-io 709  ax-5 1447  ax-7 1448  ax-gen 1449  ax-ie1 1493  ax-ie2 1494  ax-8 1504  ax-10 1505  ax-11 1506  ax-i12 1507  ax-bndl 1509  ax-4 1510  ax-17 1526  ax-i9 1530  ax-ial 1534  ax-i5r 1535  ax-13 2150  ax-14 2151  ax-ext 2159  ax-sep 4119  ax-pow 4172  ax-pr 4207  ax-un 4431  ax-setind 4534  ax-cnex 7897  ax-resscn 7898  ax-1cn 7899  ax-1re 7900  ax-icn 7901  ax-addcl 7902  ax-addrcl 7903  ax-mulcl 7904  ax-addcom 7906  ax-addass 7908  ax-distr 7910  ax-i2m1 7911  ax-0lt1 7912  ax-0id 7914  ax-rnegex 7915  ax-cnre 7917  ax-pre-ltirr 7918  ax-pre-ltwlin 7919  ax-pre-lttrn 7920  ax-pre-apti 7921  ax-pre-ltadd 7922

This theorem depends on definitions:  df-bi 117  df-dc 835  df-3or 979  df-3an 980  df-tru 1356  df-fal 1359  df-nf 1461  df-sb 1763  df-eu 2029  df-mo 2030  df-clab 2164  df-cleq 2170  df-clel 2173  df-nfc 2308  df-ne 2348  df-nel 2443  df-ral 2460  df-rex 2461  df-reu 2462  df-rab 2464  df-v 2739  df-sbc 2963  df-csb 3058  df-dif 3131  df-un 3133  df-in 3135  df-ss 3142  df-nul 3423  df-pw 3577  df-sn 3598  df-pr 3599  df-op 3601  df-uni 3809  df-int 3844  df-iun 3887  df-br 4002  df-opab 4063  df-mpt 4064  df-id 4291  df-xp 4630  df-rel 4631  df-cnv 4632  df-co 4633  df-dm 4634  df-rn 4635  df-res 4636  df-ima 4637  df-iota 5175  df-fun 5215  df-fn 5216  df-f 5217  df-fv 5221  df-riota 5826  df-ov 5873  df-oprab 5874  df-mpo 5875  df-1st 6136  df-2nd 6137  df-pnf 7988  df-mnf 7989  df-xr 7990  df-ltxr 7991  df-le 7992  df-sub 8124  df-neg 8125  df-inn 8914  df-n0 9171  df-z 9248  df-uz 9523  df-fz 10003  df-fzo 10136

This theorem is referenced by:  prmind2  12110