Theorem fidcenumlemr 7014

Description: Lemma for fidcenum 7015. 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 5481	. . 3 ⊢ (𝐹:𝑁–onto→𝐴 → (𝐹 “ 𝑁) = 𝐴)
3	1, 2	syl 14	. 2 ⊢ (𝜑 → (𝐹 “ 𝑁) = 𝐴)
4		ssid 3199	. . 3 ⊢ 𝑁 ⊆ 𝑁
5		fidcenumlemr.n	. . . . 5 ⊢ (𝜑 → 𝑁 ∈ ω)
6	5	adantr 276	. . . 4 ⊢ ((𝜑 ∧ 𝑁 ⊆ 𝑁) → 𝑁 ∈ ω)
7		sseq1 3202	. . . . . . 7 ⊢ (𝑤 = ∅ → (𝑤 ⊆ 𝑁 ↔ ∅ ⊆ 𝑁))
8	7	anbi2d 464	. . . . . 6 ⊢ (𝑤 = ∅ → ((𝜑 ∧ 𝑤 ⊆ 𝑁) ↔ (𝜑 ∧ ∅ ⊆ 𝑁)))
9		imaeq2 5001	. . . . . . 7 ⊢ (𝑤 = ∅ → (𝐹 “ 𝑤) = (𝐹 “ ∅))
10	9	eleq1d 2262	. . . . . 6 ⊢ (𝑤 = ∅ → ((𝐹 “ 𝑤) ∈ Fin ↔ (𝐹 “ ∅) ∈ Fin))
11	8, 10	imbi12d 234	. . . . 5 ⊢ (𝑤 = ∅ → (((𝜑 ∧ 𝑤 ⊆ 𝑁) → (𝐹 “ 𝑤) ∈ Fin) ↔ ((𝜑 ∧ ∅ ⊆ 𝑁) → (𝐹 “ ∅) ∈ Fin)))
12		sseq1 3202	. . . . . . 7 ⊢ (𝑤 = 𝑘 → (𝑤 ⊆ 𝑁 ↔ 𝑘 ⊆ 𝑁))
13	12	anbi2d 464	. . . . . 6 ⊢ (𝑤 = 𝑘 → ((𝜑 ∧ 𝑤 ⊆ 𝑁) ↔ (𝜑 ∧ 𝑘 ⊆ 𝑁)))
14		imaeq2 5001	. . . . . . 7 ⊢ (𝑤 = 𝑘 → (𝐹 “ 𝑤) = (𝐹 “ 𝑘))
15	14	eleq1d 2262	. . . . . 6 ⊢ (𝑤 = 𝑘 → ((𝐹 “ 𝑤) ∈ Fin ↔ (𝐹 “ 𝑘) ∈ Fin))
16	13, 15	imbi12d 234	. . . . 5 ⊢ (𝑤 = 𝑘 → (((𝜑 ∧ 𝑤 ⊆ 𝑁) → (𝐹 “ 𝑤) ∈ Fin) ↔ ((𝜑 ∧ 𝑘 ⊆ 𝑁) → (𝐹 “ 𝑘) ∈ Fin)))
17		sseq1 3202	. . . . . . 7 ⊢ (𝑤 = suc 𝑘 → (𝑤 ⊆ 𝑁 ↔ suc 𝑘 ⊆ 𝑁))
18	17	anbi2d 464	. . . . . 6 ⊢ (𝑤 = suc 𝑘 → ((𝜑 ∧ 𝑤 ⊆ 𝑁) ↔ (𝜑 ∧ suc 𝑘 ⊆ 𝑁)))
19		imaeq2 5001	. . . . . . 7 ⊢ (𝑤 = suc 𝑘 → (𝐹 “ 𝑤) = (𝐹 “ suc 𝑘))
20	19	eleq1d 2262	. . . . . 6 ⊢ (𝑤 = suc 𝑘 → ((𝐹 “ 𝑤) ∈ Fin ↔ (𝐹 “ suc 𝑘) ∈ Fin))
21	18, 20	imbi12d 234	. . . . 5 ⊢ (𝑤 = suc 𝑘 → (((𝜑 ∧ 𝑤 ⊆ 𝑁) → (𝐹 “ 𝑤) ∈ Fin) ↔ ((𝜑 ∧ suc 𝑘 ⊆ 𝑁) → (𝐹 “ suc 𝑘) ∈ Fin)))
22		sseq1 3202	. . . . . . 7 ⊢ (𝑤 = 𝑁 → (𝑤 ⊆ 𝑁 ↔ 𝑁 ⊆ 𝑁))
23	22	anbi2d 464	. . . . . 6 ⊢ (𝑤 = 𝑁 → ((𝜑 ∧ 𝑤 ⊆ 𝑁) ↔ (𝜑 ∧ 𝑁 ⊆ 𝑁)))
24		imaeq2 5001	. . . . . . 7 ⊢ (𝑤 = 𝑁 → (𝐹 “ 𝑤) = (𝐹 “ 𝑁))
25	24	eleq1d 2262	. . . . . 6 ⊢ (𝑤 = 𝑁 → ((𝐹 “ 𝑤) ∈ Fin ↔ (𝐹 “ 𝑁) ∈ Fin))
26	23, 25	imbi12d 234	. . . . 5 ⊢ (𝑤 = 𝑁 → (((𝜑 ∧ 𝑤 ⊆ 𝑁) → (𝐹 “ 𝑤) ∈ Fin) ↔ ((𝜑 ∧ 𝑁 ⊆ 𝑁) → (𝐹 “ 𝑁) ∈ Fin)))
27		ima0 5024	. . . . . . 7 ⊢ (𝐹 “ ∅) = ∅
28		0fin 6940	. . . . . . 7 ⊢ ∅ ∈ Fin
29	27, 28	eqeltri 2266	. . . . . 6 ⊢ (𝐹 “ ∅) ∈ Fin
30	29	a1i 9	. . . . 5 ⊢ ((𝜑 ∧ ∅ ⊆ 𝑁) → (𝐹 “ ∅) ∈ Fin)
31		simprl 529	. . . . . . . . . . . . . 14 ⊢ (((𝑘 ∈ ω ∧ ((𝜑 ∧ 𝑘 ⊆ 𝑁) → (𝐹 “ 𝑘) ∈ Fin)) ∧ (𝜑 ∧ suc 𝑘 ⊆ 𝑁)) → 𝜑)
32		fofn 5478	. . . . . . . . . . . . . . 15 ⊢ (𝐹:𝑁–onto→𝐴 → 𝐹 Fn 𝑁)
33	1, 32	syl 14	. . . . . . . . . . . . . 14 ⊢ (𝜑 → 𝐹 Fn 𝑁)
34	31, 33	syl 14	. . . . . . . . . . . . 13 ⊢ (((𝑘 ∈ ω ∧ ((𝜑 ∧ 𝑘 ⊆ 𝑁) → (𝐹 “ 𝑘) ∈ Fin)) ∧ (𝜑 ∧ suc 𝑘 ⊆ 𝑁)) → 𝐹 Fn 𝑁)
35		simprr 531	. . . . . . . . . . . . . 14 ⊢ (((𝑘 ∈ ω ∧ ((𝜑 ∧ 𝑘 ⊆ 𝑁) → (𝐹 “ 𝑘) ∈ Fin)) ∧ (𝜑 ∧ suc 𝑘 ⊆ 𝑁)) → suc 𝑘 ⊆ 𝑁)
36		vex 2763	. . . . . . . . . . . . . . . 16 ⊢ 𝑘 ∈ V
37	36	sucid 4448	. . . . . . . . . . . . . . 15 ⊢ 𝑘 ∈ suc 𝑘
38	37	a1i 9	. . . . . . . . . . . . . 14 ⊢ (((𝑘 ∈ ω ∧ ((𝜑 ∧ 𝑘 ⊆ 𝑁) → (𝐹 “ 𝑘) ∈ Fin)) ∧ (𝜑 ∧ suc 𝑘 ⊆ 𝑁)) → 𝑘 ∈ suc 𝑘)
39	35, 38	sseldd 3180	. . . . . . . . . . . . 13 ⊢ (((𝑘 ∈ ω ∧ ((𝜑 ∧ 𝑘 ⊆ 𝑁) → (𝐹 “ 𝑘) ∈ Fin)) ∧ (𝜑 ∧ suc 𝑘 ⊆ 𝑁)) → 𝑘 ∈ 𝑁)
40		fnsnfv 5616	. . . . . . . . . . . . 13 ⊢ ((𝐹 Fn 𝑁 ∧ 𝑘 ∈ 𝑁) → {(𝐹‘𝑘)} = (𝐹 “ {𝑘}))
41	34, 39, 40	syl2anc 411	. . . . . . . . . . . 12 ⊢ (((𝑘 ∈ ω ∧ ((𝜑 ∧ 𝑘 ⊆ 𝑁) → (𝐹 “ 𝑘) ∈ Fin)) ∧ (𝜑 ∧ suc 𝑘 ⊆ 𝑁)) → {(𝐹‘𝑘)} = (𝐹 “ {𝑘}))
42	41	uneq2d 3313	. . . . . . . . . . 11 ⊢ (((𝑘 ∈ ω ∧ ((𝜑 ∧ 𝑘 ⊆ 𝑁) → (𝐹 “ 𝑘) ∈ Fin)) ∧ (𝜑 ∧ suc 𝑘 ⊆ 𝑁)) → ((𝐹 “ 𝑘) ∪ {(𝐹‘𝑘)}) = ((𝐹 “ 𝑘) ∪ (𝐹 “ {𝑘})))
43		df-suc 4402	. . . . . . . . . . . . 13 ⊢ suc 𝑘 = (𝑘 ∪ {𝑘})
44	43	imaeq2i 5003	. . . . . . . . . . . 12 ⊢ (𝐹 “ suc 𝑘) = (𝐹 “ (𝑘 ∪ {𝑘}))
45		imaundi 5078	. . . . . . . . . . . 12 ⊢ (𝐹 “ (𝑘 ∪ {𝑘})) = ((𝐹 “ 𝑘) ∪ (𝐹 “ {𝑘}))
46	44, 45	eqtri 2214	. . . . . . . . . . 11 ⊢ (𝐹 “ suc 𝑘) = ((𝐹 “ 𝑘) ∪ (𝐹 “ {𝑘}))
47	42, 46	eqtr4di 2244	. . . . . . . . . 10 ⊢ (((𝑘 ∈ ω ∧ ((𝜑 ∧ 𝑘 ⊆ 𝑁) → (𝐹 “ 𝑘) ∈ Fin)) ∧ (𝜑 ∧ suc 𝑘 ⊆ 𝑁)) → ((𝐹 “ 𝑘) ∪ {(𝐹‘𝑘)}) = (𝐹 “ suc 𝑘))
48	47	adantr 276	. . . . . . . . 9 ⊢ ((((𝑘 ∈ ω ∧ ((𝜑 ∧ 𝑘 ⊆ 𝑁) → (𝐹 “ 𝑘) ∈ Fin)) ∧ (𝜑 ∧ suc 𝑘 ⊆ 𝑁)) ∧ (𝐹‘𝑘) ∈ (𝐹 “ 𝑘)) → ((𝐹 “ 𝑘) ∪ {(𝐹‘𝑘)}) = (𝐹 “ suc 𝑘))
49		simpr 110	. . . . . . . . . . 11 ⊢ ((((𝑘 ∈ ω ∧ ((𝜑 ∧ 𝑘 ⊆ 𝑁) → (𝐹 “ 𝑘) ∈ Fin)) ∧ (𝜑 ∧ suc 𝑘 ⊆ 𝑁)) ∧ (𝐹‘𝑘) ∈ (𝐹 “ 𝑘)) → (𝐹‘𝑘) ∈ (𝐹 “ 𝑘))
50	49	snssd 3763	. . . . . . . . . 10 ⊢ ((((𝑘 ∈ ω ∧ ((𝜑 ∧ 𝑘 ⊆ 𝑁) → (𝐹 “ 𝑘) ∈ Fin)) ∧ (𝜑 ∧ suc 𝑘 ⊆ 𝑁)) ∧ (𝐹‘𝑘) ∈ (𝐹 “ 𝑘)) → {(𝐹‘𝑘)} ⊆ (𝐹 “ 𝑘))
51		ssequn2 3332	. . . . . . . . . 10 ⊢ ({(𝐹‘𝑘)} ⊆ (𝐹 “ 𝑘) ↔ ((𝐹 “ 𝑘) ∪ {(𝐹‘𝑘)}) = (𝐹 “ 𝑘))
52	50, 51	sylib 122	. . . . . . . . 9 ⊢ ((((𝑘 ∈ ω ∧ ((𝜑 ∧ 𝑘 ⊆ 𝑁) → (𝐹 “ 𝑘) ∈ Fin)) ∧ (𝜑 ∧ suc 𝑘 ⊆ 𝑁)) ∧ (𝐹‘𝑘) ∈ (𝐹 “ 𝑘)) → ((𝐹 “ 𝑘) ∪ {(𝐹‘𝑘)}) = (𝐹 “ 𝑘))
53	48, 52	eqtr3d 2228	. . . . . . . 8 ⊢ ((((𝑘 ∈ ω ∧ ((𝜑 ∧ 𝑘 ⊆ 𝑁) → (𝐹 “ 𝑘) ∈ Fin)) ∧ (𝜑 ∧ suc 𝑘 ⊆ 𝑁)) ∧ (𝐹‘𝑘) ∈ (𝐹 “ 𝑘)) → (𝐹 “ suc 𝑘) = (𝐹 “ 𝑘))
54		sssucid 4446	. . . . . . . . . . . 12 ⊢ 𝑘 ⊆ suc 𝑘
55		sstr 3187	. . . . . . . . . . . 12 ⊢ ((𝑘 ⊆ suc 𝑘 ∧ suc 𝑘 ⊆ 𝑁) → 𝑘 ⊆ 𝑁)
56	54, 55	mpan 424	. . . . . . . . . . 11 ⊢ (suc 𝑘 ⊆ 𝑁 → 𝑘 ⊆ 𝑁)
57	56	ad2antll 491	. . . . . . . . . 10 ⊢ (((𝑘 ∈ ω ∧ ((𝜑 ∧ 𝑘 ⊆ 𝑁) → (𝐹 “ 𝑘) ∈ Fin)) ∧ (𝜑 ∧ suc 𝑘 ⊆ 𝑁)) → 𝑘 ⊆ 𝑁)
58		simplr 528	. . . . . . . . . 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 2270	. . . . . . 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 5476	. . . . . . . . . . . 12 ⊢ (𝐹:𝑁–onto→𝐴 → 𝐹:𝑁⟶𝐴)
66	64, 65	syl 14	. . . . . . . . . . 11 ⊢ (((𝑘 ∈ ω ∧ ((𝜑 ∧ 𝑘 ⊆ 𝑁) → (𝐹 “ 𝑘) ∈ Fin)) ∧ (𝜑 ∧ suc 𝑘 ⊆ 𝑁)) → 𝐹:𝑁⟶𝐴)
67	66, 39	ffvelcdmd 5694	. . . . . . . . . 10 ⊢ (((𝑘 ∈ ω ∧ ((𝜑 ∧ 𝑘 ⊆ 𝑁) → (𝐹 “ 𝑘) ∈ Fin)) ∧ (𝜑 ∧ suc 𝑘 ⊆ 𝑁)) → (𝐹‘𝑘) ∈ 𝐴)
68	67	adantr 276	. . . . . . . . 9 ⊢ ((((𝑘 ∈ ω ∧ ((𝜑 ∧ 𝑘 ⊆ 𝑁) → (𝐹 “ 𝑘) ∈ Fin)) ∧ (𝜑 ∧ suc 𝑘 ⊆ 𝑁)) ∧ ¬ (𝐹‘𝑘) ∈ (𝐹 “ 𝑘)) → (𝐹‘𝑘) ∈ 𝐴)
69		simpr 110	. . . . . . . . 9 ⊢ ((((𝑘 ∈ ω ∧ ((𝜑 ∧ 𝑘 ⊆ 𝑁) → (𝐹 “ 𝑘) ∈ Fin)) ∧ (𝜑 ∧ suc 𝑘 ⊆ 𝑁)) ∧ ¬ (𝐹‘𝑘) ∈ (𝐹 “ 𝑘)) → ¬ (𝐹‘𝑘) ∈ (𝐹 “ 𝑘))
70		unsnfi 6975	. . . . . . . . 9 ⊢ (((𝐹 “ 𝑘) ∈ Fin ∧ (𝐹‘𝑘) ∈ 𝐴 ∧ ¬ (𝐹‘𝑘) ∈ (𝐹 “ 𝑘)) → ((𝐹 “ 𝑘) ∪ {(𝐹‘𝑘)}) ∈ Fin)
71	63, 68, 69, 70	syl3anc 1249	. . . . . . . 8 ⊢ ((((𝑘 ∈ ω ∧ ((𝜑 ∧ 𝑘 ⊆ 𝑁) → (𝐹 “ 𝑘) ∈ Fin)) ∧ (𝜑 ∧ suc 𝑘 ⊆ 𝑁)) ∧ ¬ (𝐹‘𝑘) ∈ (𝐹 “ 𝑘)) → ((𝐹 “ 𝑘) ∪ {(𝐹‘𝑘)}) ∈ Fin)
72	62, 71	eqeltrrd 2271	. . . . . . 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 7013	. . . . . . 7 ⊢ (((𝑘 ∈ ω ∧ ((𝜑 ∧ 𝑘 ⊆ 𝑁) → (𝐹 “ 𝑘) ∈ Fin)) ∧ (𝜑 ∧ suc 𝑘 ⊆ 𝑁)) → ((𝐹‘𝑘) ∈ (𝐹 “ 𝑘) ∨ ¬ (𝐹‘𝑘) ∈ (𝐹 “ 𝑘)))
77	61, 72, 76	mpjaodan 799	. . . . . 6 ⊢ (((𝑘 ∈ ω ∧ ((𝜑 ∧ 𝑘 ⊆ 𝑁) → (𝐹 “ 𝑘) ∈ Fin)) ∧ (𝜑 ∧ suc 𝑘 ⊆ 𝑁)) → (𝐹 “ suc 𝑘) ∈ Fin)
78	77	exp31 364	. . . . 5 ⊢ (𝑘 ∈ ω → (((𝜑 ∧ 𝑘 ⊆ 𝑁) → (𝐹 “ 𝑘) ∈ Fin) → ((𝜑 ∧ suc 𝑘 ⊆ 𝑁) → (𝐹 “ suc 𝑘) ∈ Fin)))
79	11, 16, 21, 26, 30, 78	finds 4632	. . . 4 ⊢ (𝑁 ∈ ω → ((𝜑 ∧ 𝑁 ⊆ 𝑁) → (𝐹 “ 𝑁) ∈ Fin))
80	6, 79	mpcom 36	. . 3 ⊢ ((𝜑 ∧ 𝑁 ⊆ 𝑁) → (𝐹 “ 𝑁) ∈ Fin)
81	4, 80	mpan2 425	. 2 ⊢ (𝜑 → (𝐹 “ 𝑁) ∈ Fin)
82	3, 81	eqeltrrd 2271	1 ⊢ (𝜑 → 𝐴 ∈ Fin)

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 104  DECID wdc 835   = wceq 1364   ∈ wcel 2164  ∀wral 2472   ∪ cun 3151   ⊆ wss 3153  ∅c0 3446  {csn 3618  suc csuc 4396  ωcom 4622   “ cima 4662   Fn wfn 5249  ⟶wf 5250  –onto→wfo 5252  ‘cfv 5254  Fincfn 6794

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 615  ax-in2 616  ax-io 710  ax-5 1458  ax-7 1459  ax-gen 1460  ax-ie1 1504  ax-ie2 1505  ax-8 1515  ax-10 1516  ax-11 1517  ax-i12 1518  ax-bndl 1520  ax-4 1521  ax-17 1537  ax-i9 1541  ax-ial 1545  ax-i5r 1546  ax-13 2166  ax-14 2167  ax-ext 2175  ax-sep 4147  ax-nul 4155  ax-pow 4203  ax-pr 4238  ax-un 4464  ax-setind 4569  ax-iinf 4620

This theorem depends on definitions:  df-bi 117  df-dc 836  df-3an 982  df-tru 1367  df-fal 1370  df-nf 1472  df-sb 1774  df-eu 2045  df-mo 2046  df-clab 2180  df-cleq 2186  df-clel 2189  df-nfc 2325  df-ne 2365  df-ral 2477  df-rex 2478  df-v 2762  df-sbc 2986  df-dif 3155  df-un 3157  df-in 3159  df-ss 3166  df-nul 3447  df-pw 3603  df-sn 3624  df-pr 3625  df-op 3627  df-uni 3836  df-int 3871  df-br 4030  df-opab 4091  df-tr 4128  df-id 4324  df-iord 4397  df-on 4399  df-suc 4402  df-iom 4623  df-xp 4665  df-rel 4666  df-cnv 4667  df-co 4668  df-dm 4669  df-rn 4670  df-res 4671  df-ima 4672  df-iota 5215  df-fun 5256  df-fn 5257  df-f 5258  df-f1 5259  df-fo 5260  df-f1o 5261  df-fv 5262  df-1o 6469  df-er 6587  df-en 6795  df-fin 6797

This theorem is referenced by:  fidcenum  7015