Theorem choicefi 45511

Description: For a finite set, a choice function exists, without using the axiom of choice. (Contributed by Glauco Siliprandi, 24-Dec-2020.)

Hypotheses

Ref	Expression
choicefi.a	⊢ (𝜑 → 𝐴 ∈ Fin)
choicefi.b	⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐵 ∈ 𝑊)
choicefi.n	⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐵 ≠ ∅)

Assertion

Ref	Expression
choicefi	⊢ (𝜑 → ∃𝑓(𝑓 Fn 𝐴 ∧ ∀𝑥 ∈ 𝐴 (𝑓‘𝑥) ∈ 𝐵))

Distinct variable groups:   𝐴,𝑓,𝑥   𝐵,𝑓   𝜑,𝑥

Allowed substitution hints:   𝜑(𝑓)   𝐵(𝑥)   𝑊(𝑥,𝑓)

Proof of Theorem choicefi

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

Step	Hyp	Ref	Expression
1		choicefi.a	. . 3 ⊢ (𝜑 → 𝐴 ∈ Fin)
2		mptfi 9255	. . 3 ⊢ (𝐴 ∈ Fin → (𝑥 ∈ 𝐴 ↦ 𝐵) ∈ Fin)
3		rnfi 9244	. . 3 ⊢ ((𝑥 ∈ 𝐴 ↦ 𝐵) ∈ Fin → ran (𝑥 ∈ 𝐴 ↦ 𝐵) ∈ Fin)
4		fnchoice 45341	. . 3 ⊢ (ran (𝑥 ∈ 𝐴 ↦ 𝐵) ∈ Fin → ∃𝑔(𝑔 Fn ran (𝑥 ∈ 𝐴 ↦ 𝐵) ∧ ∀𝑦 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵)(𝑦 ≠ ∅ → (𝑔‘𝑦) ∈ 𝑦)))
5	1, 2, 3, 4	4syl 19	. 2 ⊢ (𝜑 → ∃𝑔(𝑔 Fn ran (𝑥 ∈ 𝐴 ↦ 𝐵) ∧ ∀𝑦 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵)(𝑦 ≠ ∅ → (𝑔‘𝑦) ∈ 𝑦)))
6		simpl 482	. . . . 5 ⊢ ((𝜑 ∧ (𝑔 Fn ran (𝑥 ∈ 𝐴 ↦ 𝐵) ∧ ∀𝑦 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵)(𝑦 ≠ ∅ → (𝑔‘𝑦) ∈ 𝑦))) → 𝜑)
7		simprl 771	. . . . 5 ⊢ ((𝜑 ∧ (𝑔 Fn ran (𝑥 ∈ 𝐴 ↦ 𝐵) ∧ ∀𝑦 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵)(𝑦 ≠ ∅ → (𝑔‘𝑦) ∈ 𝑦))) → 𝑔 Fn ran (𝑥 ∈ 𝐴 ↦ 𝐵))
8		nfv 1916	. . . . . . . 8 ⊢ Ⅎ𝑦𝜑
9		nfra1 3261	. . . . . . . 8 ⊢ Ⅎ𝑦∀𝑦 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵)(𝑦 ≠ ∅ → (𝑔‘𝑦) ∈ 𝑦)
10	8, 9	nfan 1901	. . . . . . 7 ⊢ Ⅎ𝑦(𝜑 ∧ ∀𝑦 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵)(𝑦 ≠ ∅ → (𝑔‘𝑦) ∈ 𝑦))
11		rspa 3226	. . . . . . . . . . . 12 ⊢ ((∀𝑦 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵)(𝑦 ≠ ∅ → (𝑔‘𝑦) ∈ 𝑦) ∧ 𝑦 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵)) → (𝑦 ≠ ∅ → (𝑔‘𝑦) ∈ 𝑦))
12	11	adantll 715	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ ∀𝑦 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵)(𝑦 ≠ ∅ → (𝑔‘𝑦) ∈ 𝑦)) ∧ 𝑦 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵)) → (𝑦 ≠ ∅ → (𝑔‘𝑦) ∈ 𝑦))
13		vex 3445	. . . . . . . . . . . . . . . 16 ⊢ 𝑦 ∈ V
14		eqid 2737	. . . . . . . . . . . . . . . . 17 ⊢ (𝑥 ∈ 𝐴 ↦ 𝐵) = (𝑥 ∈ 𝐴 ↦ 𝐵)
15	14	elrnmpt 5908	. . . . . . . . . . . . . . . 16 ⊢ (𝑦 ∈ V → (𝑦 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵) ↔ ∃𝑥 ∈ 𝐴 𝑦 = 𝐵))
16	13, 15	ax-mp 5	. . . . . . . . . . . . . . 15 ⊢ (𝑦 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵) ↔ ∃𝑥 ∈ 𝐴 𝑦 = 𝐵)
17	16	biimpi 216	. . . . . . . . . . . . . 14 ⊢ (𝑦 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵) → ∃𝑥 ∈ 𝐴 𝑦 = 𝐵)
18	17	adantl 481	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑦 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵)) → ∃𝑥 ∈ 𝐴 𝑦 = 𝐵)
19		simp3 1139	. . . . . . . . . . . . . . . . 17 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴 ∧ 𝑦 = 𝐵) → 𝑦 = 𝐵)
20		choicefi.n	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐵 ≠ ∅)
21	20	3adant3 1133	. . . . . . . . . . . . . . . . 17 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴 ∧ 𝑦 = 𝐵) → 𝐵 ≠ ∅)
22	19, 21	eqnetrd 3000	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴 ∧ 𝑦 = 𝐵) → 𝑦 ≠ ∅)
23	22	3exp 1120	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → (𝑥 ∈ 𝐴 → (𝑦 = 𝐵 → 𝑦 ≠ ∅)))
24	23	rexlimdv 3136	. . . . . . . . . . . . . 14 ⊢ (𝜑 → (∃𝑥 ∈ 𝐴 𝑦 = 𝐵 → 𝑦 ≠ ∅))
25	24	adantr 480	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑦 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵)) → (∃𝑥 ∈ 𝐴 𝑦 = 𝐵 → 𝑦 ≠ ∅))
26	18, 25	mpd 15	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑦 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵)) → 𝑦 ≠ ∅)
27	26	adantlr 716	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ ∀𝑦 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵)(𝑦 ≠ ∅ → (𝑔‘𝑦) ∈ 𝑦)) ∧ 𝑦 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵)) → 𝑦 ≠ ∅)
28		id 22	. . . . . . . . . . . 12 ⊢ ((𝑦 ≠ ∅ → (𝑔‘𝑦) ∈ 𝑦) → (𝑦 ≠ ∅ → (𝑔‘𝑦) ∈ 𝑦))
29	28	imp 406	. . . . . . . . . . 11 ⊢ (((𝑦 ≠ ∅ → (𝑔‘𝑦) ∈ 𝑦) ∧ 𝑦 ≠ ∅) → (𝑔‘𝑦) ∈ 𝑦)
30	12, 27, 29	syl2anc 585	. . . . . . . . . 10 ⊢ (((𝜑 ∧ ∀𝑦 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵)(𝑦 ≠ ∅ → (𝑔‘𝑦) ∈ 𝑦)) ∧ 𝑦 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵)) → (𝑔‘𝑦) ∈ 𝑦)
31	30	ex 412	. . . . . . . . 9 ⊢ ((𝜑 ∧ ∀𝑦 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵)(𝑦 ≠ ∅ → (𝑔‘𝑦) ∈ 𝑦)) → (𝑦 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵) → (𝑔‘𝑦) ∈ 𝑦))
32	10, 31	ralrimi 3235	. . . . . . . 8 ⊢ ((𝜑 ∧ ∀𝑦 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵)(𝑦 ≠ ∅ → (𝑔‘𝑦) ∈ 𝑦)) → ∀𝑦 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵)(𝑔‘𝑦) ∈ 𝑦)
33		rsp 3225	. . . . . . . 8 ⊢ (∀𝑦 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵)(𝑔‘𝑦) ∈ 𝑦 → (𝑦 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵) → (𝑔‘𝑦) ∈ 𝑦))
34	32, 33	syl 17	. . . . . . 7 ⊢ ((𝜑 ∧ ∀𝑦 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵)(𝑦 ≠ ∅ → (𝑔‘𝑦) ∈ 𝑦)) → (𝑦 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵) → (𝑔‘𝑦) ∈ 𝑦))
35	10, 34	ralrimi 3235	. . . . . 6 ⊢ ((𝜑 ∧ ∀𝑦 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵)(𝑦 ≠ ∅ → (𝑔‘𝑦) ∈ 𝑦)) → ∀𝑦 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵)(𝑔‘𝑦) ∈ 𝑦)
36	35	adantrl 717	. . . . 5 ⊢ ((𝜑 ∧ (𝑔 Fn ran (𝑥 ∈ 𝐴 ↦ 𝐵) ∧ ∀𝑦 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵)(𝑦 ≠ ∅ → (𝑔‘𝑦) ∈ 𝑦))) → ∀𝑦 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵)(𝑔‘𝑦) ∈ 𝑦)
37		vex 3445	. . . . . . . . 9 ⊢ 𝑔 ∈ V
38	37	a1i 11	. . . . . . . 8 ⊢ (𝜑 → 𝑔 ∈ V)
39	1	mptexd 7172	. . . . . . . 8 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ 𝐵) ∈ V)
40		coexg 7873	. . . . . . . 8 ⊢ ((𝑔 ∈ V ∧ (𝑥 ∈ 𝐴 ↦ 𝐵) ∈ V) → (𝑔 ∘ (𝑥 ∈ 𝐴 ↦ 𝐵)) ∈ V)
41	38, 39, 40	syl2anc 585	. . . . . . 7 ⊢ (𝜑 → (𝑔 ∘ (𝑥 ∈ 𝐴 ↦ 𝐵)) ∈ V)
42	41	3ad2ant1 1134	. . . . . 6 ⊢ ((𝜑 ∧ 𝑔 Fn ran (𝑥 ∈ 𝐴 ↦ 𝐵) ∧ ∀𝑦 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵)(𝑔‘𝑦) ∈ 𝑦) → (𝑔 ∘ (𝑥 ∈ 𝐴 ↦ 𝐵)) ∈ V)
43		simpr 484	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑔 Fn ran (𝑥 ∈ 𝐴 ↦ 𝐵)) → 𝑔 Fn ran (𝑥 ∈ 𝐴 ↦ 𝐵))
44		choicefi.b	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐵 ∈ 𝑊)
45	44	ralrimiva 3129	. . . . . . . . . . 11 ⊢ (𝜑 → ∀𝑥 ∈ 𝐴 𝐵 ∈ 𝑊)
46	14	fnmpt 6633	. . . . . . . . . . 11 ⊢ (∀𝑥 ∈ 𝐴 𝐵 ∈ 𝑊 → (𝑥 ∈ 𝐴 ↦ 𝐵) Fn 𝐴)
47	45, 46	syl 17	. . . . . . . . . 10 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ 𝐵) Fn 𝐴)
48	47	adantr 480	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑔 Fn ran (𝑥 ∈ 𝐴 ↦ 𝐵)) → (𝑥 ∈ 𝐴 ↦ 𝐵) Fn 𝐴)
49		ssidd 3958	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑔 Fn ran (𝑥 ∈ 𝐴 ↦ 𝐵)) → ran (𝑥 ∈ 𝐴 ↦ 𝐵) ⊆ ran (𝑥 ∈ 𝐴 ↦ 𝐵))
50		fnco 6611	. . . . . . . . 9 ⊢ ((𝑔 Fn ran (𝑥 ∈ 𝐴 ↦ 𝐵) ∧ (𝑥 ∈ 𝐴 ↦ 𝐵) Fn 𝐴 ∧ ran (𝑥 ∈ 𝐴 ↦ 𝐵) ⊆ ran (𝑥 ∈ 𝐴 ↦ 𝐵)) → (𝑔 ∘ (𝑥 ∈ 𝐴 ↦ 𝐵)) Fn 𝐴)
51	43, 48, 49, 50	syl3anc 1374	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑔 Fn ran (𝑥 ∈ 𝐴 ↦ 𝐵)) → (𝑔 ∘ (𝑥 ∈ 𝐴 ↦ 𝐵)) Fn 𝐴)
52	51	3adant3 1133	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑔 Fn ran (𝑥 ∈ 𝐴 ↦ 𝐵) ∧ ∀𝑦 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵)(𝑔‘𝑦) ∈ 𝑦) → (𝑔 ∘ (𝑥 ∈ 𝐴 ↦ 𝐵)) Fn 𝐴)
53		nfv 1916	. . . . . . . . 9 ⊢ Ⅎ𝑥𝜑
54		nfcv 2899	. . . . . . . . . 10 ⊢ Ⅎ𝑥𝑔
55		nfmpt1 5198	. . . . . . . . . . 11 ⊢ Ⅎ𝑥(𝑥 ∈ 𝐴 ↦ 𝐵)
56	55	nfrn 5902	. . . . . . . . . 10 ⊢ Ⅎ𝑥ran (𝑥 ∈ 𝐴 ↦ 𝐵)
57	54, 56	nffn 6592	. . . . . . . . 9 ⊢ Ⅎ𝑥 𝑔 Fn ran (𝑥 ∈ 𝐴 ↦ 𝐵)
58		nfv 1916	. . . . . . . . . 10 ⊢ Ⅎ𝑥(𝑔‘𝑦) ∈ 𝑦
59	56, 58	nfralw 3284	. . . . . . . . 9 ⊢ Ⅎ𝑥∀𝑦 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵)(𝑔‘𝑦) ∈ 𝑦
60	53, 57, 59	nf3an 1903	. . . . . . . 8 ⊢ Ⅎ𝑥(𝜑 ∧ 𝑔 Fn ran (𝑥 ∈ 𝐴 ↦ 𝐵) ∧ ∀𝑦 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵)(𝑔‘𝑦) ∈ 𝑦)
61		funmpt 6531	. . . . . . . . . . . . . 14 ⊢ Fun (𝑥 ∈ 𝐴 ↦ 𝐵)
62	61	a1i 11	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → Fun (𝑥 ∈ 𝐴 ↦ 𝐵))
63		simpr 484	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝑥 ∈ 𝐴)
64	14, 44	dmmptd 6638	. . . . . . . . . . . . . . . 16 ⊢ (𝜑 → dom (𝑥 ∈ 𝐴 ↦ 𝐵) = 𝐴)
65	64	eqcomd 2743	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → 𝐴 = dom (𝑥 ∈ 𝐴 ↦ 𝐵))
66	65	adantr 480	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐴 = dom (𝑥 ∈ 𝐴 ↦ 𝐵))
67	63, 66	eleqtrd 2839	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝑥 ∈ dom (𝑥 ∈ 𝐴 ↦ 𝐵))
68		fvco 6933	. . . . . . . . . . . . 13 ⊢ ((Fun (𝑥 ∈ 𝐴 ↦ 𝐵) ∧ 𝑥 ∈ dom (𝑥 ∈ 𝐴 ↦ 𝐵)) → ((𝑔 ∘ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑥) = (𝑔‘((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑥)))
69	62, 67, 68	syl2anc 585	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → ((𝑔 ∘ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑥) = (𝑔‘((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑥)))
70	14	fvmpt2 6954	. . . . . . . . . . . . . 14 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝐵 ∈ 𝑊) → ((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑥) = 𝐵)
71	63, 44, 70	syl2anc 585	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → ((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑥) = 𝐵)
72	71	fveq2d 6839	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (𝑔‘((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑥)) = (𝑔‘𝐵))
73	69, 72	eqtrd 2772	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → ((𝑔 ∘ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑥) = (𝑔‘𝐵))
74	73	3ad2antl1 1187	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑔 Fn ran (𝑥 ∈ 𝐴 ↦ 𝐵) ∧ ∀𝑦 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵)(𝑔‘𝑦) ∈ 𝑦) ∧ 𝑥 ∈ 𝐴) → ((𝑔 ∘ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑥) = (𝑔‘𝐵))
75	14	elrnmpt1 5910	. . . . . . . . . . . . 13 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝐵 ∈ 𝑊) → 𝐵 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵))
76	63, 44, 75	syl2anc 585	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐵 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵))
77	76	3ad2antl1 1187	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑔 Fn ran (𝑥 ∈ 𝐴 ↦ 𝐵) ∧ ∀𝑦 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵)(𝑔‘𝑦) ∈ 𝑦) ∧ 𝑥 ∈ 𝐴) → 𝐵 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵))
78		simpl3 1195	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑔 Fn ran (𝑥 ∈ 𝐴 ↦ 𝐵) ∧ ∀𝑦 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵)(𝑔‘𝑦) ∈ 𝑦) ∧ 𝑥 ∈ 𝐴) → ∀𝑦 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵)(𝑔‘𝑦) ∈ 𝑦)
79		fveq2 6835	. . . . . . . . . . . . 13 ⊢ (𝑦 = 𝐵 → (𝑔‘𝑦) = (𝑔‘𝐵))
80		id 22	. . . . . . . . . . . . 13 ⊢ (𝑦 = 𝐵 → 𝑦 = 𝐵)
81	79, 80	eleq12d 2831	. . . . . . . . . . . 12 ⊢ (𝑦 = 𝐵 → ((𝑔‘𝑦) ∈ 𝑦 ↔ (𝑔‘𝐵) ∈ 𝐵))
82	81	rspcva 3575	. . . . . . . . . . 11 ⊢ ((𝐵 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵) ∧ ∀𝑦 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵)(𝑔‘𝑦) ∈ 𝑦) → (𝑔‘𝐵) ∈ 𝐵)
83	77, 78, 82	syl2anc 585	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑔 Fn ran (𝑥 ∈ 𝐴 ↦ 𝐵) ∧ ∀𝑦 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵)(𝑔‘𝑦) ∈ 𝑦) ∧ 𝑥 ∈ 𝐴) → (𝑔‘𝐵) ∈ 𝐵)
84	74, 83	eqeltrd 2837	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑔 Fn ran (𝑥 ∈ 𝐴 ↦ 𝐵) ∧ ∀𝑦 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵)(𝑔‘𝑦) ∈ 𝑦) ∧ 𝑥 ∈ 𝐴) → ((𝑔 ∘ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑥) ∈ 𝐵)
85	84	ex 412	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑔 Fn ran (𝑥 ∈ 𝐴 ↦ 𝐵) ∧ ∀𝑦 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵)(𝑔‘𝑦) ∈ 𝑦) → (𝑥 ∈ 𝐴 → ((𝑔 ∘ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑥) ∈ 𝐵))
86	60, 85	ralrimi 3235	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑔 Fn ran (𝑥 ∈ 𝐴 ↦ 𝐵) ∧ ∀𝑦 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵)(𝑔‘𝑦) ∈ 𝑦) → ∀𝑥 ∈ 𝐴 ((𝑔 ∘ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑥) ∈ 𝐵)
87	52, 86	jca 511	. . . . . 6 ⊢ ((𝜑 ∧ 𝑔 Fn ran (𝑥 ∈ 𝐴 ↦ 𝐵) ∧ ∀𝑦 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵)(𝑔‘𝑦) ∈ 𝑦) → ((𝑔 ∘ (𝑥 ∈ 𝐴 ↦ 𝐵)) Fn 𝐴 ∧ ∀𝑥 ∈ 𝐴 ((𝑔 ∘ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑥) ∈ 𝐵))
88		fneq1 6584	. . . . . . . 8 ⊢ (𝑓 = (𝑔 ∘ (𝑥 ∈ 𝐴 ↦ 𝐵)) → (𝑓 Fn 𝐴 ↔ (𝑔 ∘ (𝑥 ∈ 𝐴 ↦ 𝐵)) Fn 𝐴))
89		nfcv 2899	. . . . . . . . . 10 ⊢ Ⅎ𝑥𝑓
90	54, 55	nfco 5815	. . . . . . . . . 10 ⊢ Ⅎ𝑥(𝑔 ∘ (𝑥 ∈ 𝐴 ↦ 𝐵))
91	89, 90	nfeq 2913	. . . . . . . . 9 ⊢ Ⅎ𝑥 𝑓 = (𝑔 ∘ (𝑥 ∈ 𝐴 ↦ 𝐵))
92		fveq1 6834	. . . . . . . . . 10 ⊢ (𝑓 = (𝑔 ∘ (𝑥 ∈ 𝐴 ↦ 𝐵)) → (𝑓‘𝑥) = ((𝑔 ∘ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑥))
93	92	eleq1d 2822	. . . . . . . . 9 ⊢ (𝑓 = (𝑔 ∘ (𝑥 ∈ 𝐴 ↦ 𝐵)) → ((𝑓‘𝑥) ∈ 𝐵 ↔ ((𝑔 ∘ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑥) ∈ 𝐵))
94	91, 93	ralbid 3250	. . . . . . . 8 ⊢ (𝑓 = (𝑔 ∘ (𝑥 ∈ 𝐴 ↦ 𝐵)) → (∀𝑥 ∈ 𝐴 (𝑓‘𝑥) ∈ 𝐵 ↔ ∀𝑥 ∈ 𝐴 ((𝑔 ∘ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑥) ∈ 𝐵))
95	88, 94	anbi12d 633	. . . . . . 7 ⊢ (𝑓 = (𝑔 ∘ (𝑥 ∈ 𝐴 ↦ 𝐵)) → ((𝑓 Fn 𝐴 ∧ ∀𝑥 ∈ 𝐴 (𝑓‘𝑥) ∈ 𝐵) ↔ ((𝑔 ∘ (𝑥 ∈ 𝐴 ↦ 𝐵)) Fn 𝐴 ∧ ∀𝑥 ∈ 𝐴 ((𝑔 ∘ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑥) ∈ 𝐵)))
96	95	spcegv 3552	. . . . . 6 ⊢ ((𝑔 ∘ (𝑥 ∈ 𝐴 ↦ 𝐵)) ∈ V → (((𝑔 ∘ (𝑥 ∈ 𝐴 ↦ 𝐵)) Fn 𝐴 ∧ ∀𝑥 ∈ 𝐴 ((𝑔 ∘ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑥) ∈ 𝐵) → ∃𝑓(𝑓 Fn 𝐴 ∧ ∀𝑥 ∈ 𝐴 (𝑓‘𝑥) ∈ 𝐵)))
97	42, 87, 96	sylc 65	. . . . 5 ⊢ ((𝜑 ∧ 𝑔 Fn ran (𝑥 ∈ 𝐴 ↦ 𝐵) ∧ ∀𝑦 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵)(𝑔‘𝑦) ∈ 𝑦) → ∃𝑓(𝑓 Fn 𝐴 ∧ ∀𝑥 ∈ 𝐴 (𝑓‘𝑥) ∈ 𝐵))
98	6, 7, 36, 97	syl3anc 1374	. . . 4 ⊢ ((𝜑 ∧ (𝑔 Fn ran (𝑥 ∈ 𝐴 ↦ 𝐵) ∧ ∀𝑦 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵)(𝑦 ≠ ∅ → (𝑔‘𝑦) ∈ 𝑦))) → ∃𝑓(𝑓 Fn 𝐴 ∧ ∀𝑥 ∈ 𝐴 (𝑓‘𝑥) ∈ 𝐵))
99	98	ex 412	. . 3 ⊢ (𝜑 → ((𝑔 Fn ran (𝑥 ∈ 𝐴 ↦ 𝐵) ∧ ∀𝑦 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵)(𝑦 ≠ ∅ → (𝑔‘𝑦) ∈ 𝑦)) → ∃𝑓(𝑓 Fn 𝐴 ∧ ∀𝑥 ∈ 𝐴 (𝑓‘𝑥) ∈ 𝐵)))
100	99	exlimdv 1935	. 2 ⊢ (𝜑 → (∃𝑔(𝑔 Fn ran (𝑥 ∈ 𝐴 ↦ 𝐵) ∧ ∀𝑦 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵)(𝑦 ≠ ∅ → (𝑔‘𝑦) ∈ 𝑦)) → ∃𝑓(𝑓 Fn 𝐴 ∧ ∀𝑥 ∈ 𝐴 (𝑓‘𝑥) ∈ 𝐵)))
101	5, 100	mpd 15	1 ⊢ (𝜑 → ∃𝑓(𝑓 Fn 𝐴 ∧ ∀𝑥 ∈ 𝐴 (𝑓‘𝑥) ∈ 𝐵))

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   ∧ w3a 1087   = wceq 1542  ∃wex 1781   ∈ wcel 2114   ≠ wne 2933  ∀wral 3052  ∃wrex 3061  Vcvv 3441   ⊆ wss 3902  ∅c0 4286   ↦ cmpt 5180  dom cdm 5625  ran crn 5626   ∘ ccom 5629  Fun wfun 6487   Fn wfn 6488  ‘cfv 6493  Fincfn 8887

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-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-rep 5225  ax-sep 5242  ax-nul 5252  ax-pow 5311  ax-pr 5378  ax-un 7682

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3or 1088  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-ral 3053  df-rex 3062  df-reu 3352  df-rab 3401  df-v 3443  df-sbc 3742  df-csb 3851  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-pss 3922  df-nul 4287  df-if 4481  df-pw 4557  df-sn 4582  df-pr 4584  df-op 4588  df-uni 4865  df-iun 4949  df-br 5100  df-opab 5162  df-mpt 5181  df-tr 5207  df-id 5520  df-eprel 5525  df-po 5533  df-so 5534  df-fr 5578  df-we 5580  df-xp 5631  df-rel 5632  df-cnv 5633  df-co 5634  df-dm 5635  df-rn 5636  df-res 5637  df-ima 5638  df-ord 6321  df-on 6322  df-lim 6323  df-suc 6324  df-iota 6449  df-fun 6495  df-fn 6496  df-f 6497  df-f1 6498  df-fo 6499  df-f1o 6500  df-fv 6501  df-om 7811  df-1st 7935  df-2nd 7936  df-1o 8399  df-en 8888  df-dom 8889  df-fin 8891

This theorem is referenced by:  axccdom  45533  axccd2  45541  qndenserrnbllem  46605  hoiqssbllem3  46935