Theorem fidcenumlemr 7159

Description: Lemma for fidcenum 7160. Reverse direction (put into deduction form). (Contributed by Jim Kingdon, 19-Oct-2022.)

Hypotheses

Ref	Expression
fidcenumlemr.dc	⊢ (𝜑 → ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦)
fidcenumlemr.f	⊢ (𝜑 → 𝐹:𝑁–onto→𝐴)
fidcenumlemr.n	⊢ (𝜑 → 𝑁 ∈ ω)

Assertion

Ref	Expression
fidcenumlemr	⊢ (𝜑 → 𝐴 ∈ Fin)

Distinct variable groups:   𝑥,𝐴,𝑦   𝑥,𝐹,𝑦

Allowed substitution hints:   𝜑(𝑥,𝑦)   𝑁(𝑥,𝑦)

Proof of Theorem fidcenumlemr

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

Step	Hyp	Ref	Expression
1		fidcenumlemr.f	. . 3 ⊢ (𝜑 → 𝐹:𝑁–onto→𝐴)
2		foima 5567	. . 3 ⊢ (𝐹:𝑁–onto→𝐴 → (𝐹 “ 𝑁) = 𝐴)
3	1, 2	syl 14	. 2 ⊢ (𝜑 → (𝐹 “ 𝑁) = 𝐴)
4		ssid 3246	. . 3 ⊢ 𝑁 ⊆ 𝑁
5		fidcenumlemr.n	. . . . 5 ⊢ (𝜑 → 𝑁 ∈ ω)
6	5	adantr 276	. . . 4 ⊢ ((𝜑 ∧ 𝑁 ⊆ 𝑁) → 𝑁 ∈ ω)
7		sseq1 3249	. . . . . . 7 ⊢ (𝑤 = ∅ → (𝑤 ⊆ 𝑁 ↔ ∅ ⊆ 𝑁))
8	7	anbi2d 464	. . . . . 6 ⊢ (𝑤 = ∅ → ((𝜑 ∧ 𝑤 ⊆ 𝑁) ↔ (𝜑 ∧ ∅ ⊆ 𝑁)))
9		imaeq2 5074	. . . . . . 7 ⊢ (𝑤 = ∅ → (𝐹 “ 𝑤) = (𝐹 “ ∅))
10	9	eleq1d 2299	. . . . . 6 ⊢ (𝑤 = ∅ → ((𝐹 “ 𝑤) ∈ Fin ↔ (𝐹 “ ∅) ∈ Fin))
11	8, 10	imbi12d 234	. . . . 5 ⊢ (𝑤 = ∅ → (((𝜑 ∧ 𝑤 ⊆ 𝑁) → (𝐹 “ 𝑤) ∈ Fin) ↔ ((𝜑 ∧ ∅ ⊆ 𝑁) → (𝐹 “ ∅) ∈ Fin)))
12		sseq1 3249	. . . . . . 7 ⊢ (𝑤 = 𝑘 → (𝑤 ⊆ 𝑁 ↔ 𝑘 ⊆ 𝑁))
13	12	anbi2d 464	. . . . . 6 ⊢ (𝑤 = 𝑘 → ((𝜑 ∧ 𝑤 ⊆ 𝑁) ↔ (𝜑 ∧ 𝑘 ⊆ 𝑁)))
14		imaeq2 5074	. . . . . . 7 ⊢ (𝑤 = 𝑘 → (𝐹 “ 𝑤) = (𝐹 “ 𝑘))
15	14	eleq1d 2299	. . . . . 6 ⊢ (𝑤 = 𝑘 → ((𝐹 “ 𝑤) ∈ Fin ↔ (𝐹 “ 𝑘) ∈ Fin))
16	13, 15	imbi12d 234	. . . . 5 ⊢ (𝑤 = 𝑘 → (((𝜑 ∧ 𝑤 ⊆ 𝑁) → (𝐹 “ 𝑤) ∈ Fin) ↔ ((𝜑 ∧ 𝑘 ⊆ 𝑁) → (𝐹 “ 𝑘) ∈ Fin)))
17		sseq1 3249	. . . . . . 7 ⊢ (𝑤 = suc 𝑘 → (𝑤 ⊆ 𝑁 ↔ suc 𝑘 ⊆ 𝑁))
18	17	anbi2d 464	. . . . . 6 ⊢ (𝑤 = suc 𝑘 → ((𝜑 ∧ 𝑤 ⊆ 𝑁) ↔ (𝜑 ∧ suc 𝑘 ⊆ 𝑁)))
19		imaeq2 5074	. . . . . . 7 ⊢ (𝑤 = suc 𝑘 → (𝐹 “ 𝑤) = (𝐹 “ suc 𝑘))
20	19	eleq1d 2299	. . . . . 6 ⊢ (𝑤 = suc 𝑘 → ((𝐹 “ 𝑤) ∈ Fin ↔ (𝐹 “ suc 𝑘) ∈ Fin))
21	18, 20	imbi12d 234	. . . . 5 ⊢ (𝑤 = suc 𝑘 → (((𝜑 ∧ 𝑤 ⊆ 𝑁) → (𝐹 “ 𝑤) ∈ Fin) ↔ ((𝜑 ∧ suc 𝑘 ⊆ 𝑁) → (𝐹 “ suc 𝑘) ∈ Fin)))
22		sseq1 3249	. . . . . . 7 ⊢ (𝑤 = 𝑁 → (𝑤 ⊆ 𝑁 ↔ 𝑁 ⊆ 𝑁))
23	22	anbi2d 464	. . . . . 6 ⊢ (𝑤 = 𝑁 → ((𝜑 ∧ 𝑤 ⊆ 𝑁) ↔ (𝜑 ∧ 𝑁 ⊆ 𝑁)))
24		imaeq2 5074	. . . . . . 7 ⊢ (𝑤 = 𝑁 → (𝐹 “ 𝑤) = (𝐹 “ 𝑁))
25	24	eleq1d 2299	. . . . . 6 ⊢ (𝑤 = 𝑁 → ((𝐹 “ 𝑤) ∈ Fin ↔ (𝐹 “ 𝑁) ∈ Fin))
26	23, 25	imbi12d 234	. . . . 5 ⊢ (𝑤 = 𝑁 → (((𝜑 ∧ 𝑤 ⊆ 𝑁) → (𝐹 “ 𝑤) ∈ Fin) ↔ ((𝜑 ∧ 𝑁 ⊆ 𝑁) → (𝐹 “ 𝑁) ∈ Fin)))
27		ima0 5097	. . . . . . 7 ⊢ (𝐹 “ ∅) = ∅
28		0fi 7078	. . . . . . 7 ⊢ ∅ ∈ Fin
29	27, 28	eqeltri 2303	. . . . . 6 ⊢ (𝐹 “ ∅) ∈ Fin
30	29	a1i 9	. . . . 5 ⊢ ((𝜑 ∧ ∅ ⊆ 𝑁) → (𝐹 “ ∅) ∈ Fin)
31		simprl 531	. . . . . . . . . . . . . 14 ⊢ (((𝑘 ∈ ω ∧ ((𝜑 ∧ 𝑘 ⊆ 𝑁) → (𝐹 “ 𝑘) ∈ Fin)) ∧ (𝜑 ∧ suc 𝑘 ⊆ 𝑁)) → 𝜑)
32		fofn 5564	. . . . . . . . . . . . . . 15 ⊢ (𝐹:𝑁–onto→𝐴 → 𝐹 Fn 𝑁)
33	1, 32	syl 14	. . . . . . . . . . . . . 14 ⊢ (𝜑 → 𝐹 Fn 𝑁)
34	31, 33	syl 14	. . . . . . . . . . . . 13 ⊢ (((𝑘 ∈ ω ∧ ((𝜑 ∧ 𝑘 ⊆ 𝑁) → (𝐹 “ 𝑘) ∈ Fin)) ∧ (𝜑 ∧ suc 𝑘 ⊆ 𝑁)) → 𝐹 Fn 𝑁)
35		simprr 533	. . . . . . . . . . . . . 14 ⊢ (((𝑘 ∈ ω ∧ ((𝜑 ∧ 𝑘 ⊆ 𝑁) → (𝐹 “ 𝑘) ∈ Fin)) ∧ (𝜑 ∧ suc 𝑘 ⊆ 𝑁)) → suc 𝑘 ⊆ 𝑁)
36		vex 2804	. . . . . . . . . . . . . . . 16 ⊢ 𝑘 ∈ V
37	36	sucid 4516	. . . . . . . . . . . . . . 15 ⊢ 𝑘 ∈ suc 𝑘
38	37	a1i 9	. . . . . . . . . . . . . 14 ⊢ (((𝑘 ∈ ω ∧ ((𝜑 ∧ 𝑘 ⊆ 𝑁) → (𝐹 “ 𝑘) ∈ Fin)) ∧ (𝜑 ∧ suc 𝑘 ⊆ 𝑁)) → 𝑘 ∈ suc 𝑘)
39	35, 38	sseldd 3227	. . . . . . . . . . . . 13 ⊢ (((𝑘 ∈ ω ∧ ((𝜑 ∧ 𝑘 ⊆ 𝑁) → (𝐹 “ 𝑘) ∈ Fin)) ∧ (𝜑 ∧ suc 𝑘 ⊆ 𝑁)) → 𝑘 ∈ 𝑁)
40		fnsnfv 5708	. . . . . . . . . . . . 13 ⊢ ((𝐹 Fn 𝑁 ∧ 𝑘 ∈ 𝑁) → {(𝐹‘𝑘)} = (𝐹 “ {𝑘}))
41	34, 39, 40	syl2anc 411	. . . . . . . . . . . 12 ⊢ (((𝑘 ∈ ω ∧ ((𝜑 ∧ 𝑘 ⊆ 𝑁) → (𝐹 “ 𝑘) ∈ Fin)) ∧ (𝜑 ∧ suc 𝑘 ⊆ 𝑁)) → {(𝐹‘𝑘)} = (𝐹 “ {𝑘}))
42	41	uneq2d 3360	. . . . . . . . . . 11 ⊢ (((𝑘 ∈ ω ∧ ((𝜑 ∧ 𝑘 ⊆ 𝑁) → (𝐹 “ 𝑘) ∈ Fin)) ∧ (𝜑 ∧ suc 𝑘 ⊆ 𝑁)) → ((𝐹 “ 𝑘) ∪ {(𝐹‘𝑘)}) = ((𝐹 “ 𝑘) ∪ (𝐹 “ {𝑘})))
43		df-suc 4470	. . . . . . . . . . . . 13 ⊢ suc 𝑘 = (𝑘 ∪ {𝑘})
44	43	imaeq2i 5076	. . . . . . . . . . . 12 ⊢ (𝐹 “ suc 𝑘) = (𝐹 “ (𝑘 ∪ {𝑘}))
45		imaundi 5151	. . . . . . . . . . . 12 ⊢ (𝐹 “ (𝑘 ∪ {𝑘})) = ((𝐹 “ 𝑘) ∪ (𝐹 “ {𝑘}))
46	44, 45	eqtri 2251	. . . . . . . . . . 11 ⊢ (𝐹 “ suc 𝑘) = ((𝐹 “ 𝑘) ∪ (𝐹 “ {𝑘}))
47	42, 46	eqtr4di 2281	. . . . . . . . . 10 ⊢ (((𝑘 ∈ ω ∧ ((𝜑 ∧ 𝑘 ⊆ 𝑁) → (𝐹 “ 𝑘) ∈ Fin)) ∧ (𝜑 ∧ suc 𝑘 ⊆ 𝑁)) → ((𝐹 “ 𝑘) ∪ {(𝐹‘𝑘)}) = (𝐹 “ suc 𝑘))
48	47	adantr 276	. . . . . . . . 9 ⊢ ((((𝑘 ∈ ω ∧ ((𝜑 ∧ 𝑘 ⊆ 𝑁) → (𝐹 “ 𝑘) ∈ Fin)) ∧ (𝜑 ∧ suc 𝑘 ⊆ 𝑁)) ∧ (𝐹‘𝑘) ∈ (𝐹 “ 𝑘)) → ((𝐹 “ 𝑘) ∪ {(𝐹‘𝑘)}) = (𝐹 “ suc 𝑘))
49		simpr 110	. . . . . . . . . . 11 ⊢ ((((𝑘 ∈ ω ∧ ((𝜑 ∧ 𝑘 ⊆ 𝑁) → (𝐹 “ 𝑘) ∈ Fin)) ∧ (𝜑 ∧ suc 𝑘 ⊆ 𝑁)) ∧ (𝐹‘𝑘) ∈ (𝐹 “ 𝑘)) → (𝐹‘𝑘) ∈ (𝐹 “ 𝑘))
50	49	snssd 3819	. . . . . . . . . 10 ⊢ ((((𝑘 ∈ ω ∧ ((𝜑 ∧ 𝑘 ⊆ 𝑁) → (𝐹 “ 𝑘) ∈ Fin)) ∧ (𝜑 ∧ suc 𝑘 ⊆ 𝑁)) ∧ (𝐹‘𝑘) ∈ (𝐹 “ 𝑘)) → {(𝐹‘𝑘)} ⊆ (𝐹 “ 𝑘))
51		ssequn2 3379	. . . . . . . . . 10 ⊢ ({(𝐹‘𝑘)} ⊆ (𝐹 “ 𝑘) ↔ ((𝐹 “ 𝑘) ∪ {(𝐹‘𝑘)}) = (𝐹 “ 𝑘))
52	50, 51	sylib 122	. . . . . . . . 9 ⊢ ((((𝑘 ∈ ω ∧ ((𝜑 ∧ 𝑘 ⊆ 𝑁) → (𝐹 “ 𝑘) ∈ Fin)) ∧ (𝜑 ∧ suc 𝑘 ⊆ 𝑁)) ∧ (𝐹‘𝑘) ∈ (𝐹 “ 𝑘)) → ((𝐹 “ 𝑘) ∪ {(𝐹‘𝑘)}) = (𝐹 “ 𝑘))
53	48, 52	eqtr3d 2265	. . . . . . . 8 ⊢ ((((𝑘 ∈ ω ∧ ((𝜑 ∧ 𝑘 ⊆ 𝑁) → (𝐹 “ 𝑘) ∈ Fin)) ∧ (𝜑 ∧ suc 𝑘 ⊆ 𝑁)) ∧ (𝐹‘𝑘) ∈ (𝐹 “ 𝑘)) → (𝐹 “ suc 𝑘) = (𝐹 “ 𝑘))
54		sssucid 4514	. . . . . . . . . . . 12 ⊢ 𝑘 ⊆ suc 𝑘
55		sstr 3234	. . . . . . . . . . . 12 ⊢ ((𝑘 ⊆ suc 𝑘 ∧ suc 𝑘 ⊆ 𝑁) → 𝑘 ⊆ 𝑁)
56	54, 55	mpan 424	. . . . . . . . . . 11 ⊢ (suc 𝑘 ⊆ 𝑁 → 𝑘 ⊆ 𝑁)
57	56	ad2antll 491	. . . . . . . . . 10 ⊢ (((𝑘 ∈ ω ∧ ((𝜑 ∧ 𝑘 ⊆ 𝑁) → (𝐹 “ 𝑘) ∈ Fin)) ∧ (𝜑 ∧ suc 𝑘 ⊆ 𝑁)) → 𝑘 ⊆ 𝑁)
58		simplr 529	. . . . . . . . . 10 ⊢ (((𝑘 ∈ ω ∧ ((𝜑 ∧ 𝑘 ⊆ 𝑁) → (𝐹 “ 𝑘) ∈ Fin)) ∧ (𝜑 ∧ suc 𝑘 ⊆ 𝑁)) → ((𝜑 ∧ 𝑘 ⊆ 𝑁) → (𝐹 “ 𝑘) ∈ Fin))
59	31, 57, 58	mp2and 433	. . . . . . . . 9 ⊢ (((𝑘 ∈ ω ∧ ((𝜑 ∧ 𝑘 ⊆ 𝑁) → (𝐹 “ 𝑘) ∈ Fin)) ∧ (𝜑 ∧ suc 𝑘 ⊆ 𝑁)) → (𝐹 “ 𝑘) ∈ Fin)
60	59	adantr 276	. . . . . . . 8 ⊢ ((((𝑘 ∈ ω ∧ ((𝜑 ∧ 𝑘 ⊆ 𝑁) → (𝐹 “ 𝑘) ∈ Fin)) ∧ (𝜑 ∧ suc 𝑘 ⊆ 𝑁)) ∧ (𝐹‘𝑘) ∈ (𝐹 “ 𝑘)) → (𝐹 “ 𝑘) ∈ Fin)
61	53, 60	eqeltrd 2307	. . . . . . 7 ⊢ ((((𝑘 ∈ ω ∧ ((𝜑 ∧ 𝑘 ⊆ 𝑁) → (𝐹 “ 𝑘) ∈ Fin)) ∧ (𝜑 ∧ suc 𝑘 ⊆ 𝑁)) ∧ (𝐹‘𝑘) ∈ (𝐹 “ 𝑘)) → (𝐹 “ suc 𝑘) ∈ Fin)
62	47	adantr 276	. . . . . . . 8 ⊢ ((((𝑘 ∈ ω ∧ ((𝜑 ∧ 𝑘 ⊆ 𝑁) → (𝐹 “ 𝑘) ∈ Fin)) ∧ (𝜑 ∧ suc 𝑘 ⊆ 𝑁)) ∧ ¬ (𝐹‘𝑘) ∈ (𝐹 “ 𝑘)) → ((𝐹 “ 𝑘) ∪ {(𝐹‘𝑘)}) = (𝐹 “ suc 𝑘))
63	59	adantr 276	. . . . . . . . 9 ⊢ ((((𝑘 ∈ ω ∧ ((𝜑 ∧ 𝑘 ⊆ 𝑁) → (𝐹 “ 𝑘) ∈ Fin)) ∧ (𝜑 ∧ suc 𝑘 ⊆ 𝑁)) ∧ ¬ (𝐹‘𝑘) ∈ (𝐹 “ 𝑘)) → (𝐹 “ 𝑘) ∈ Fin)
64	31, 1	syl 14	. . . . . . . . . . . 12 ⊢ (((𝑘 ∈ ω ∧ ((𝜑 ∧ 𝑘 ⊆ 𝑁) → (𝐹 “ 𝑘) ∈ Fin)) ∧ (𝜑 ∧ suc 𝑘 ⊆ 𝑁)) → 𝐹:𝑁–onto→𝐴)
65		fof 5562	. . . . . . . . . . . 12 ⊢ (𝐹:𝑁–onto→𝐴 → 𝐹:𝑁⟶𝐴)
66	64, 65	syl 14	. . . . . . . . . . 11 ⊢ (((𝑘 ∈ ω ∧ ((𝜑 ∧ 𝑘 ⊆ 𝑁) → (𝐹 “ 𝑘) ∈ Fin)) ∧ (𝜑 ∧ suc 𝑘 ⊆ 𝑁)) → 𝐹:𝑁⟶𝐴)
67	66, 39	ffvelcdmd 5786	. . . . . . . . . 10 ⊢ (((𝑘 ∈ ω ∧ ((𝜑 ∧ 𝑘 ⊆ 𝑁) → (𝐹 “ 𝑘) ∈ Fin)) ∧ (𝜑 ∧ suc 𝑘 ⊆ 𝑁)) → (𝐹‘𝑘) ∈ 𝐴)
68	67	adantr 276	. . . . . . . . 9 ⊢ ((((𝑘 ∈ ω ∧ ((𝜑 ∧ 𝑘 ⊆ 𝑁) → (𝐹 “ 𝑘) ∈ Fin)) ∧ (𝜑 ∧ suc 𝑘 ⊆ 𝑁)) ∧ ¬ (𝐹‘𝑘) ∈ (𝐹 “ 𝑘)) → (𝐹‘𝑘) ∈ 𝐴)
69		simpr 110	. . . . . . . . 9 ⊢ ((((𝑘 ∈ ω ∧ ((𝜑 ∧ 𝑘 ⊆ 𝑁) → (𝐹 “ 𝑘) ∈ Fin)) ∧ (𝜑 ∧ suc 𝑘 ⊆ 𝑁)) ∧ ¬ (𝐹‘𝑘) ∈ (𝐹 “ 𝑘)) → ¬ (𝐹‘𝑘) ∈ (𝐹 “ 𝑘))
70		unsnfi 7116	. . . . . . . . 9 ⊢ (((𝐹 “ 𝑘) ∈ Fin ∧ (𝐹‘𝑘) ∈ 𝐴 ∧ ¬ (𝐹‘𝑘) ∈ (𝐹 “ 𝑘)) → ((𝐹 “ 𝑘) ∪ {(𝐹‘𝑘)}) ∈ Fin)
71	63, 68, 69, 70	syl3anc 1273	. . . . . . . 8 ⊢ ((((𝑘 ∈ ω ∧ ((𝜑 ∧ 𝑘 ⊆ 𝑁) → (𝐹 “ 𝑘) ∈ Fin)) ∧ (𝜑 ∧ suc 𝑘 ⊆ 𝑁)) ∧ ¬ (𝐹‘𝑘) ∈ (𝐹 “ 𝑘)) → ((𝐹 “ 𝑘) ∪ {(𝐹‘𝑘)}) ∈ Fin)
72	62, 71	eqeltrrd 2308	. . . . . . 7 ⊢ ((((𝑘 ∈ ω ∧ ((𝜑 ∧ 𝑘 ⊆ 𝑁) → (𝐹 “ 𝑘) ∈ Fin)) ∧ (𝜑 ∧ suc 𝑘 ⊆ 𝑁)) ∧ ¬ (𝐹‘𝑘) ∈ (𝐹 “ 𝑘)) → (𝐹 “ suc 𝑘) ∈ Fin)
73		fidcenumlemr.dc	. . . . . . . . 9 ⊢ (𝜑 → ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦)
74	31, 73	syl 14	. . . . . . . 8 ⊢ (((𝑘 ∈ ω ∧ ((𝜑 ∧ 𝑘 ⊆ 𝑁) → (𝐹 “ 𝑘) ∈ Fin)) ∧ (𝜑 ∧ suc 𝑘 ⊆ 𝑁)) → ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦)
75		simpll 527	. . . . . . . 8 ⊢ (((𝑘 ∈ ω ∧ ((𝜑 ∧ 𝑘 ⊆ 𝑁) → (𝐹 “ 𝑘) ∈ Fin)) ∧ (𝜑 ∧ suc 𝑘 ⊆ 𝑁)) → 𝑘 ∈ ω)
76	74, 64, 75, 57, 67	fidcenumlemrk 7158	. . . . . . 7 ⊢ (((𝑘 ∈ ω ∧ ((𝜑 ∧ 𝑘 ⊆ 𝑁) → (𝐹 “ 𝑘) ∈ Fin)) ∧ (𝜑 ∧ suc 𝑘 ⊆ 𝑁)) → ((𝐹‘𝑘) ∈ (𝐹 “ 𝑘) ∨ ¬ (𝐹‘𝑘) ∈ (𝐹 “ 𝑘)))
77	61, 72, 76	mpjaodan 805	. . . . . 6 ⊢ (((𝑘 ∈ ω ∧ ((𝜑 ∧ 𝑘 ⊆ 𝑁) → (𝐹 “ 𝑘) ∈ Fin)) ∧ (𝜑 ∧ suc 𝑘 ⊆ 𝑁)) → (𝐹 “ suc 𝑘) ∈ Fin)
78	77	exp31 364	. . . . 5 ⊢ (𝑘 ∈ ω → (((𝜑 ∧ 𝑘 ⊆ 𝑁) → (𝐹 “ 𝑘) ∈ Fin) → ((𝜑 ∧ suc 𝑘 ⊆ 𝑁) → (𝐹 “ suc 𝑘) ∈ Fin)))
79	11, 16, 21, 26, 30, 78	finds 4700	. . . 4 ⊢ (𝑁 ∈ ω → ((𝜑 ∧ 𝑁 ⊆ 𝑁) → (𝐹 “ 𝑁) ∈ Fin))
80	6, 79	mpcom 36	. . 3 ⊢ ((𝜑 ∧ 𝑁 ⊆ 𝑁) → (𝐹 “ 𝑁) ∈ Fin)
81	4, 80	mpan2 425	. 2 ⊢ (𝜑 → (𝐹 “ 𝑁) ∈ Fin)
82	3, 81	eqeltrrd 2308	1 ⊢ (𝜑 → 𝐴 ∈ Fin)

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 104  DECID wdc 841   = wceq 1397   ∈ wcel 2201  ∀wral 2509   ∪ cun 3197   ⊆ wss 3199  ∅c0 3493  {csn 3670  suc csuc 4464  ωcom 4690   “ cima 4730   Fn wfn 5323  ⟶wf 5324  –onto→wfo 5326  ‘cfv 5328  Fincfn 6914

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 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-13 2203  ax-14 2204  ax-ext 2212  ax-sep 4208  ax-nul 4216  ax-pow 4266  ax-pr 4301  ax-un 4532  ax-setind 4637  ax-iinf 4688

This theorem depends on definitions:  df-bi 117  df-dc 842  df-3an 1006  df-tru 1400  df-fal 1403  df-nf 1509  df-sb 1810  df-eu 2081  df-mo 2082  df-clab 2217  df-cleq 2223  df-clel 2226  df-nfc 2362  df-ne 2402  df-ral 2514  df-rex 2515  df-v 2803  df-sbc 3031  df-dif 3201  df-un 3203  df-in 3205  df-ss 3212  df-nul 3494  df-pw 3655  df-sn 3676  df-pr 3677  df-op 3679  df-uni 3895  df-int 3930  df-br 4090  df-opab 4152  df-tr 4189  df-id 4392  df-iord 4465  df-on 4467  df-suc 4470  df-iom 4691  df-xp 4733  df-rel 4734  df-cnv 4735  df-co 4736  df-dm 4737  df-rn 4738  df-res 4739  df-ima 4740  df-iota 5288  df-fun 5330  df-fn 5331  df-f 5332  df-f1 5333  df-fo 5334  df-f1o 5335  df-fv 5336  df-1o 6587  df-er 6707  df-en 6915  df-fin 6917

This theorem is referenced by:  fidcenum  7160