Theorem indexfi 9304

Description: If for every element of a finite indexing set 𝐴 there exists a corresponding element of another set 𝐵, then there exists a finite subset of 𝐵 consisting only of those elements which are indexed by 𝐴. Proven without the Axiom of Choice, unlike indexdom 36193. (Contributed by Jeff Madsen, 2-Sep-2009.) (Proof shortened by Mario Carneiro, 12-Sep-2015.)

Assertion

Ref	Expression
indexfi	⊢ ((𝐴 ∈ Fin ∧ 𝐵 ∈ 𝑀 ∧ ∀𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝜑) → ∃𝑐 ∈ Fin (𝑐 ⊆ 𝐵 ∧ ∀𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝑐 𝜑 ∧ ∀𝑦 ∈ 𝑐 ∃𝑥 ∈ 𝐴 𝜑))

Distinct variable groups:   𝑥,𝑐,𝑦,𝐴   𝐵,𝑐,𝑥,𝑦   𝜑,𝑐

Allowed substitution hints:   𝜑(𝑥,𝑦)   𝑀(𝑥,𝑦,𝑐)

Proof of Theorem indexfi

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

Step	Hyp	Ref	Expression
1		nfv 1917	. . . . . 6 ⊢ Ⅎ𝑧𝜑
2		nfsbc1v 3759	. . . . . 6 ⊢ Ⅎ𝑦[𝑧 / 𝑦]𝜑
3		sbceq1a 3750	. . . . . 6 ⊢ (𝑦 = 𝑧 → (𝜑 ↔ [𝑧 / 𝑦]𝜑))
4	1, 2, 3	cbvrexw 3290	. . . . 5 ⊢ (∃𝑦 ∈ 𝐵 𝜑 ↔ ∃𝑧 ∈ 𝐵 [𝑧 / 𝑦]𝜑)
5	4	ralbii 3096	. . . 4 ⊢ (∀𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝜑 ↔ ∀𝑥 ∈ 𝐴 ∃𝑧 ∈ 𝐵 [𝑧 / 𝑦]𝜑)
6		dfsbcq 3741	. . . . 5 ⊢ (𝑧 = (𝑓‘𝑥) → ([𝑧 / 𝑦]𝜑 ↔ [(𝑓‘𝑥) / 𝑦]𝜑))
7	6	ac6sfi 9231	. . . 4 ⊢ ((𝐴 ∈ Fin ∧ ∀𝑥 ∈ 𝐴 ∃𝑧 ∈ 𝐵 [𝑧 / 𝑦]𝜑) → ∃𝑓(𝑓:𝐴⟶𝐵 ∧ ∀𝑥 ∈ 𝐴 [(𝑓‘𝑥) / 𝑦]𝜑))
8	5, 7	sylan2b 594	. . 3 ⊢ ((𝐴 ∈ Fin ∧ ∀𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝜑) → ∃𝑓(𝑓:𝐴⟶𝐵 ∧ ∀𝑥 ∈ 𝐴 [(𝑓‘𝑥) / 𝑦]𝜑))
9		simpll 765	. . . . 5 ⊢ (((𝐴 ∈ Fin ∧ ∀𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝜑) ∧ (𝑓:𝐴⟶𝐵 ∧ ∀𝑥 ∈ 𝐴 [(𝑓‘𝑥) / 𝑦]𝜑)) → 𝐴 ∈ Fin)
10		ffn 6668	. . . . . . 7 ⊢ (𝑓:𝐴⟶𝐵 → 𝑓 Fn 𝐴)
11	10	ad2antrl 726	. . . . . 6 ⊢ (((𝐴 ∈ Fin ∧ ∀𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝜑) ∧ (𝑓:𝐴⟶𝐵 ∧ ∀𝑥 ∈ 𝐴 [(𝑓‘𝑥) / 𝑦]𝜑)) → 𝑓 Fn 𝐴)
12		dffn4 6762	. . . . . 6 ⊢ (𝑓 Fn 𝐴 ↔ 𝑓:𝐴–onto→ran 𝑓)
13	11, 12	sylib 217	. . . . 5 ⊢ (((𝐴 ∈ Fin ∧ ∀𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝜑) ∧ (𝑓:𝐴⟶𝐵 ∧ ∀𝑥 ∈ 𝐴 [(𝑓‘𝑥) / 𝑦]𝜑)) → 𝑓:𝐴–onto→ran 𝑓)
14		fofi 9282	. . . . 5 ⊢ ((𝐴 ∈ Fin ∧ 𝑓:𝐴–onto→ran 𝑓) → ran 𝑓 ∈ Fin)
15	9, 13, 14	syl2anc 584	. . . 4 ⊢ (((𝐴 ∈ Fin ∧ ∀𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝜑) ∧ (𝑓:𝐴⟶𝐵 ∧ ∀𝑥 ∈ 𝐴 [(𝑓‘𝑥) / 𝑦]𝜑)) → ran 𝑓 ∈ Fin)
16		frn 6675	. . . . 5 ⊢ (𝑓:𝐴⟶𝐵 → ran 𝑓 ⊆ 𝐵)
17	16	ad2antrl 726	. . . 4 ⊢ (((𝐴 ∈ Fin ∧ ∀𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝜑) ∧ (𝑓:𝐴⟶𝐵 ∧ ∀𝑥 ∈ 𝐴 [(𝑓‘𝑥) / 𝑦]𝜑)) → ran 𝑓 ⊆ 𝐵)
18		fnfvelrn 7031	. . . . . . . . 9 ⊢ ((𝑓 Fn 𝐴 ∧ 𝑥 ∈ 𝐴) → (𝑓‘𝑥) ∈ ran 𝑓)
19	10, 18	sylan 580	. . . . . . . 8 ⊢ ((𝑓:𝐴⟶𝐵 ∧ 𝑥 ∈ 𝐴) → (𝑓‘𝑥) ∈ ran 𝑓)
20		rspesbca 3837	. . . . . . . . 9 ⊢ (((𝑓‘𝑥) ∈ ran 𝑓 ∧ [(𝑓‘𝑥) / 𝑦]𝜑) → ∃𝑦 ∈ ran 𝑓𝜑)
21	20	ex 413	. . . . . . . 8 ⊢ ((𝑓‘𝑥) ∈ ran 𝑓 → ([(𝑓‘𝑥) / 𝑦]𝜑 → ∃𝑦 ∈ ran 𝑓𝜑))
22	19, 21	syl 17	. . . . . . 7 ⊢ ((𝑓:𝐴⟶𝐵 ∧ 𝑥 ∈ 𝐴) → ([(𝑓‘𝑥) / 𝑦]𝜑 → ∃𝑦 ∈ ran 𝑓𝜑))
23	22	ralimdva 3164	. . . . . 6 ⊢ (𝑓:𝐴⟶𝐵 → (∀𝑥 ∈ 𝐴 [(𝑓‘𝑥) / 𝑦]𝜑 → ∀𝑥 ∈ 𝐴 ∃𝑦 ∈ ran 𝑓𝜑))
24	23	imp 407	. . . . 5 ⊢ ((𝑓:𝐴⟶𝐵 ∧ ∀𝑥 ∈ 𝐴 [(𝑓‘𝑥) / 𝑦]𝜑) → ∀𝑥 ∈ 𝐴 ∃𝑦 ∈ ran 𝑓𝜑)
25	24	adantl 482	. . . 4 ⊢ (((𝐴 ∈ Fin ∧ ∀𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝜑) ∧ (𝑓:𝐴⟶𝐵 ∧ ∀𝑥 ∈ 𝐴 [(𝑓‘𝑥) / 𝑦]𝜑)) → ∀𝑥 ∈ 𝐴 ∃𝑦 ∈ ran 𝑓𝜑)
26		simpr 485	. . . . . . . 8 ⊢ ((((𝐴 ∈ Fin ∧ ∀𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝜑) ∧ (𝑓:𝐴⟶𝐵 ∧ ∀𝑥 ∈ 𝐴 [(𝑓‘𝑥) / 𝑦]𝜑)) ∧ 𝑤 ∈ 𝐴) → 𝑤 ∈ 𝐴)
27		simprr 771	. . . . . . . . . 10 ⊢ (((𝐴 ∈ Fin ∧ ∀𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝜑) ∧ (𝑓:𝐴⟶𝐵 ∧ ∀𝑥 ∈ 𝐴 [(𝑓‘𝑥) / 𝑦]𝜑)) → ∀𝑥 ∈ 𝐴 [(𝑓‘𝑥) / 𝑦]𝜑)
28		nfv 1917	. . . . . . . . . . 11 ⊢ Ⅎ𝑤[(𝑓‘𝑥) / 𝑦]𝜑
29		nfsbc1v 3759	. . . . . . . . . . 11 ⊢ Ⅎ𝑥[𝑤 / 𝑥][(𝑓‘𝑤) / 𝑦]𝜑
30		fveq2 6842	. . . . . . . . . . . . 13 ⊢ (𝑥 = 𝑤 → (𝑓‘𝑥) = (𝑓‘𝑤))
31	30	sbceq1d 3744	. . . . . . . . . . . 12 ⊢ (𝑥 = 𝑤 → ([(𝑓‘𝑥) / 𝑦]𝜑 ↔ [(𝑓‘𝑤) / 𝑦]𝜑))
32		sbceq1a 3750	. . . . . . . . . . . 12 ⊢ (𝑥 = 𝑤 → ([(𝑓‘𝑤) / 𝑦]𝜑 ↔ [𝑤 / 𝑥][(𝑓‘𝑤) / 𝑦]𝜑))
33	31, 32	bitrd 278	. . . . . . . . . . 11 ⊢ (𝑥 = 𝑤 → ([(𝑓‘𝑥) / 𝑦]𝜑 ↔ [𝑤 / 𝑥][(𝑓‘𝑤) / 𝑦]𝜑))
34	28, 29, 33	cbvralw 3289	. . . . . . . . . 10 ⊢ (∀𝑥 ∈ 𝐴 [(𝑓‘𝑥) / 𝑦]𝜑 ↔ ∀𝑤 ∈ 𝐴 [𝑤 / 𝑥][(𝑓‘𝑤) / 𝑦]𝜑)
35	27, 34	sylib 217	. . . . . . . . 9 ⊢ (((𝐴 ∈ Fin ∧ ∀𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝜑) ∧ (𝑓:𝐴⟶𝐵 ∧ ∀𝑥 ∈ 𝐴 [(𝑓‘𝑥) / 𝑦]𝜑)) → ∀𝑤 ∈ 𝐴 [𝑤 / 𝑥][(𝑓‘𝑤) / 𝑦]𝜑)
36	35	r19.21bi 3234	. . . . . . . 8 ⊢ ((((𝐴 ∈ Fin ∧ ∀𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝜑) ∧ (𝑓:𝐴⟶𝐵 ∧ ∀𝑥 ∈ 𝐴 [(𝑓‘𝑥) / 𝑦]𝜑)) ∧ 𝑤 ∈ 𝐴) → [𝑤 / 𝑥][(𝑓‘𝑤) / 𝑦]𝜑)
37		rspesbca 3837	. . . . . . . 8 ⊢ ((𝑤 ∈ 𝐴 ∧ [𝑤 / 𝑥][(𝑓‘𝑤) / 𝑦]𝜑) → ∃𝑥 ∈ 𝐴 [(𝑓‘𝑤) / 𝑦]𝜑)
38	26, 36, 37	syl2anc 584	. . . . . . 7 ⊢ ((((𝐴 ∈ Fin ∧ ∀𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝜑) ∧ (𝑓:𝐴⟶𝐵 ∧ ∀𝑥 ∈ 𝐴 [(𝑓‘𝑥) / 𝑦]𝜑)) ∧ 𝑤 ∈ 𝐴) → ∃𝑥 ∈ 𝐴 [(𝑓‘𝑤) / 𝑦]𝜑)
39	38	ralrimiva 3143	. . . . . 6 ⊢ (((𝐴 ∈ Fin ∧ ∀𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝜑) ∧ (𝑓:𝐴⟶𝐵 ∧ ∀𝑥 ∈ 𝐴 [(𝑓‘𝑥) / 𝑦]𝜑)) → ∀𝑤 ∈ 𝐴 ∃𝑥 ∈ 𝐴 [(𝑓‘𝑤) / 𝑦]𝜑)
40		dfsbcq 3741	. . . . . . . . 9 ⊢ (𝑧 = (𝑓‘𝑤) → ([𝑧 / 𝑦]𝜑 ↔ [(𝑓‘𝑤) / 𝑦]𝜑))
41	40	rexbidv 3175	. . . . . . . 8 ⊢ (𝑧 = (𝑓‘𝑤) → (∃𝑥 ∈ 𝐴 [𝑧 / 𝑦]𝜑 ↔ ∃𝑥 ∈ 𝐴 [(𝑓‘𝑤) / 𝑦]𝜑))
42	41	ralrn 7038	. . . . . . 7 ⊢ (𝑓 Fn 𝐴 → (∀𝑧 ∈ ran 𝑓∃𝑥 ∈ 𝐴 [𝑧 / 𝑦]𝜑 ↔ ∀𝑤 ∈ 𝐴 ∃𝑥 ∈ 𝐴 [(𝑓‘𝑤) / 𝑦]𝜑))
43	11, 42	syl 17	. . . . . 6 ⊢ (((𝐴 ∈ Fin ∧ ∀𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝜑) ∧ (𝑓:𝐴⟶𝐵 ∧ ∀𝑥 ∈ 𝐴 [(𝑓‘𝑥) / 𝑦]𝜑)) → (∀𝑧 ∈ ran 𝑓∃𝑥 ∈ 𝐴 [𝑧 / 𝑦]𝜑 ↔ ∀𝑤 ∈ 𝐴 ∃𝑥 ∈ 𝐴 [(𝑓‘𝑤) / 𝑦]𝜑))
44	39, 43	mpbird 256	. . . . 5 ⊢ (((𝐴 ∈ Fin ∧ ∀𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝜑) ∧ (𝑓:𝐴⟶𝐵 ∧ ∀𝑥 ∈ 𝐴 [(𝑓‘𝑥) / 𝑦]𝜑)) → ∀𝑧 ∈ ran 𝑓∃𝑥 ∈ 𝐴 [𝑧 / 𝑦]𝜑)
45		nfv 1917	. . . . . 6 ⊢ Ⅎ𝑧∃𝑥 ∈ 𝐴 𝜑
46		nfcv 2907	. . . . . . 7 ⊢ Ⅎ𝑦𝐴
47	46, 2	nfrexw 3296	. . . . . 6 ⊢ Ⅎ𝑦∃𝑥 ∈ 𝐴 [𝑧 / 𝑦]𝜑
48	3	rexbidv 3175	. . . . . 6 ⊢ (𝑦 = 𝑧 → (∃𝑥 ∈ 𝐴 𝜑 ↔ ∃𝑥 ∈ 𝐴 [𝑧 / 𝑦]𝜑))
49	45, 47, 48	cbvralw 3289	. . . . 5 ⊢ (∀𝑦 ∈ ran 𝑓∃𝑥 ∈ 𝐴 𝜑 ↔ ∀𝑧 ∈ ran 𝑓∃𝑥 ∈ 𝐴 [𝑧 / 𝑦]𝜑)
50	44, 49	sylibr 233	. . . 4 ⊢ (((𝐴 ∈ Fin ∧ ∀𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝜑) ∧ (𝑓:𝐴⟶𝐵 ∧ ∀𝑥 ∈ 𝐴 [(𝑓‘𝑥) / 𝑦]𝜑)) → ∀𝑦 ∈ ran 𝑓∃𝑥 ∈ 𝐴 𝜑)
51		sseq1 3969	. . . . . 6 ⊢ (𝑐 = ran 𝑓 → (𝑐 ⊆ 𝐵 ↔ ran 𝑓 ⊆ 𝐵))
52		rexeq 3310	. . . . . . 7 ⊢ (𝑐 = ran 𝑓 → (∃𝑦 ∈ 𝑐 𝜑 ↔ ∃𝑦 ∈ ran 𝑓𝜑))
53	52	ralbidv 3174	. . . . . 6 ⊢ (𝑐 = ran 𝑓 → (∀𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝑐 𝜑 ↔ ∀𝑥 ∈ 𝐴 ∃𝑦 ∈ ran 𝑓𝜑))
54		raleq 3309	. . . . . 6 ⊢ (𝑐 = ran 𝑓 → (∀𝑦 ∈ 𝑐 ∃𝑥 ∈ 𝐴 𝜑 ↔ ∀𝑦 ∈ ran 𝑓∃𝑥 ∈ 𝐴 𝜑))
55	51, 53, 54	3anbi123d 1436	. . . . 5 ⊢ (𝑐 = ran 𝑓 → ((𝑐 ⊆ 𝐵 ∧ ∀𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝑐 𝜑 ∧ ∀𝑦 ∈ 𝑐 ∃𝑥 ∈ 𝐴 𝜑) ↔ (ran 𝑓 ⊆ 𝐵 ∧ ∀𝑥 ∈ 𝐴 ∃𝑦 ∈ ran 𝑓𝜑 ∧ ∀𝑦 ∈ ran 𝑓∃𝑥 ∈ 𝐴 𝜑)))
56	55	rspcev 3581	. . . 4 ⊢ ((ran 𝑓 ∈ Fin ∧ (ran 𝑓 ⊆ 𝐵 ∧ ∀𝑥 ∈ 𝐴 ∃𝑦 ∈ ran 𝑓𝜑 ∧ ∀𝑦 ∈ ran 𝑓∃𝑥 ∈ 𝐴 𝜑)) → ∃𝑐 ∈ Fin (𝑐 ⊆ 𝐵 ∧ ∀𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝑐 𝜑 ∧ ∀𝑦 ∈ 𝑐 ∃𝑥 ∈ 𝐴 𝜑))
57	15, 17, 25, 50, 56	syl13anc 1372	. . 3 ⊢ (((𝐴 ∈ Fin ∧ ∀𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝜑) ∧ (𝑓:𝐴⟶𝐵 ∧ ∀𝑥 ∈ 𝐴 [(𝑓‘𝑥) / 𝑦]𝜑)) → ∃𝑐 ∈ Fin (𝑐 ⊆ 𝐵 ∧ ∀𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝑐 𝜑 ∧ ∀𝑦 ∈ 𝑐 ∃𝑥 ∈ 𝐴 𝜑))
58	8, 57	exlimddv 1938	. 2 ⊢ ((𝐴 ∈ Fin ∧ ∀𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝜑) → ∃𝑐 ∈ Fin (𝑐 ⊆ 𝐵 ∧ ∀𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝑐 𝜑 ∧ ∀𝑦 ∈ 𝑐 ∃𝑥 ∈ 𝐴 𝜑))
59	58	3adant2 1131	1 ⊢ ((𝐴 ∈ Fin ∧ 𝐵 ∈ 𝑀 ∧ ∀𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝜑) → ∃𝑐 ∈ Fin (𝑐 ⊆ 𝐵 ∧ ∀𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝑐 𝜑 ∧ ∀𝑦 ∈ 𝑐 ∃𝑥 ∈ 𝐴 𝜑))

Syntax hints:   → wi 4   ↔ wb 205   ∧ wa 396   ∧ w3a 1087   = wceq 1541  ∃wex 1781   ∈ wcel 2106  ∀wral 3064  ∃wrex 3073  [wsbc 3739   ⊆ wss 3910  ran crn 5634   Fn wfn 6491  ⟶wf 6492  –onto→wfo 6494  ‘cfv 6496  Fincfn 8883

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 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2707  ax-sep 5256  ax-nul 5263  ax-pow 5320  ax-pr 5384  ax-un 7672

This theorem depends on definitions:  df-bi 206  df-an 397  df-or 846  df-3or 1088  df-3an 1089  df-tru 1544  df-fal 1554  df-ex 1782  df-nf 1786  df-sb 2068  df-mo 2538  df-eu 2567  df-clab 2714  df-cleq 2728  df-clel 2814  df-nfc 2889  df-ne 2944  df-ral 3065  df-rex 3074  df-reu 3354  df-rab 3408  df-v 3447  df-sbc 3740  df-dif 3913  df-un 3915  df-in 3917  df-ss 3927  df-pss 3929  df-nul 4283  df-if 4487  df-pw 4562  df-sn 4587  df-pr 4589  df-op 4593  df-uni 4866  df-br 5106  df-opab 5168  df-mpt 5189  df-tr 5223  df-id 5531  df-eprel 5537  df-po 5545  df-so 5546  df-fr 5588  df-we 5590  df-xp 5639  df-rel 5640  df-cnv 5641  df-co 5642  df-dm 5643  df-rn 5644  df-res 5645  df-ima 5646  df-ord 6320  df-on 6321  df-lim 6322  df-suc 6323  df-iota 6448  df-fun 6498  df-fn 6499  df-f 6500  df-f1 6501  df-fo 6502  df-f1o 6503  df-fv 6504  df-om 7803  df-1o 8412  df-er 8648  df-en 8884  df-dom 8885  df-fin 8887

This theorem is referenced by:  filbcmb  36199