Theorem smfpimcclem 45823

Description: Lemma for smfpimcc 45824 given the choice function 𝐶. (Contributed by Glauco Siliprandi, 23-Oct-2021.)

Hypotheses

Ref	Expression
smfpimcclem.n	⊢ Ⅎ𝑛𝜑
smfpimcclem.z	⊢ 𝑍 ∈ 𝑉
smfpimcclem.s	⊢ (𝜑 → 𝑆 ∈ 𝑊)
smfpimcclem.c	⊢ ((𝜑 ∧ 𝑦 ∈ ran (𝑛 ∈ 𝑍 ↦ {𝑠 ∈ 𝑆 ∣ (◡(𝐹‘𝑛) “ 𝐴) = (𝑠 ∩ dom (𝐹‘𝑛))})) → (𝐶‘𝑦) ∈ 𝑦)
smfpimcclem.h	⊢ 𝐻 = (𝑛 ∈ 𝑍 ↦ (𝐶‘{𝑠 ∈ 𝑆 ∣ (◡(𝐹‘𝑛) “ 𝐴) = (𝑠 ∩ dom (𝐹‘𝑛))}))

Assertion

Ref	Expression
smfpimcclem	⊢ (𝜑 → ∃ℎ(ℎ:𝑍⟶𝑆 ∧ ∀𝑛 ∈ 𝑍 (◡(𝐹‘𝑛) “ 𝐴) = ((ℎ‘𝑛) ∩ dom (𝐹‘𝑛))))

Distinct variable groups:   𝐴,ℎ   𝐴,𝑠,𝑦   𝐶,𝑠,𝑦   ℎ,𝐹   𝐹,𝑠,𝑦   ℎ,𝐻   𝑆,ℎ,𝑛   𝑆,𝑠,𝑦,𝑛   ℎ,𝑍,𝑛   𝑦,𝑍   𝜑,𝑦

Allowed substitution hints:   𝜑(ℎ,𝑛,𝑠)   𝐴(𝑛)   𝐶(ℎ,𝑛)   𝐹(𝑛)   𝐻(𝑦,𝑛,𝑠)   𝑉(𝑦,ℎ,𝑛,𝑠)   𝑊(𝑦,ℎ,𝑛,𝑠)   𝑍(𝑠)

Proof of Theorem smfpimcclem

Step	Hyp	Ref	Expression
1		smfpimcclem.n	. . 3 ⊢ Ⅎ𝑛𝜑
2		nfcv 2902	. . . . 5 ⊢ Ⅎ𝑠𝑆
3	2	ssrab2f 44109	. . . 4 ⊢ {𝑠 ∈ 𝑆 ∣ (◡(𝐹‘𝑛) “ 𝐴) = (𝑠 ∩ dom (𝐹‘𝑛))} ⊆ 𝑆
4		eqid 2731	. . . . . . 7 ⊢ {𝑠 ∈ 𝑆 ∣ (◡(𝐹‘𝑛) “ 𝐴) = (𝑠 ∩ dom (𝐹‘𝑛))} = {𝑠 ∈ 𝑆 ∣ (◡(𝐹‘𝑛) “ 𝐴) = (𝑠 ∩ dom (𝐹‘𝑛))}
5		smfpimcclem.s	. . . . . . 7 ⊢ (𝜑 → 𝑆 ∈ 𝑊)
6	4, 5	rabexd 5334	. . . . . 6 ⊢ (𝜑 → {𝑠 ∈ 𝑆 ∣ (◡(𝐹‘𝑛) “ 𝐴) = (𝑠 ∩ dom (𝐹‘𝑛))} ∈ V)
7	6	adantr 480	. . . . 5 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍) → {𝑠 ∈ 𝑆 ∣ (◡(𝐹‘𝑛) “ 𝐴) = (𝑠 ∩ dom (𝐹‘𝑛))} ∈ V)
8		simpl 482	. . . . . 6 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍) → 𝜑)
9		simpr 484	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍) → 𝑛 ∈ 𝑍)
10		eqid 2731	. . . . . . . 8 ⊢ (𝑛 ∈ 𝑍 ↦ {𝑠 ∈ 𝑆 ∣ (◡(𝐹‘𝑛) “ 𝐴) = (𝑠 ∩ dom (𝐹‘𝑛))}) = (𝑛 ∈ 𝑍 ↦ {𝑠 ∈ 𝑆 ∣ (◡(𝐹‘𝑛) “ 𝐴) = (𝑠 ∩ dom (𝐹‘𝑛))})
11	10	elrnmpt1 5958	. . . . . . 7 ⊢ ((𝑛 ∈ 𝑍 ∧ {𝑠 ∈ 𝑆 ∣ (◡(𝐹‘𝑛) “ 𝐴) = (𝑠 ∩ dom (𝐹‘𝑛))} ∈ V) → {𝑠 ∈ 𝑆 ∣ (◡(𝐹‘𝑛) “ 𝐴) = (𝑠 ∩ dom (𝐹‘𝑛))} ∈ ran (𝑛 ∈ 𝑍 ↦ {𝑠 ∈ 𝑆 ∣ (◡(𝐹‘𝑛) “ 𝐴) = (𝑠 ∩ dom (𝐹‘𝑛))}))
12	9, 7, 11	syl2anc 583	. . . . . 6 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍) → {𝑠 ∈ 𝑆 ∣ (◡(𝐹‘𝑛) “ 𝐴) = (𝑠 ∩ dom (𝐹‘𝑛))} ∈ ran (𝑛 ∈ 𝑍 ↦ {𝑠 ∈ 𝑆 ∣ (◡(𝐹‘𝑛) “ 𝐴) = (𝑠 ∩ dom (𝐹‘𝑛))}))
13	8, 12	jca 511	. . . . 5 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍) → (𝜑 ∧ {𝑠 ∈ 𝑆 ∣ (◡(𝐹‘𝑛) “ 𝐴) = (𝑠 ∩ dom (𝐹‘𝑛))} ∈ ran (𝑛 ∈ 𝑍 ↦ {𝑠 ∈ 𝑆 ∣ (◡(𝐹‘𝑛) “ 𝐴) = (𝑠 ∩ dom (𝐹‘𝑛))})))
14		eleq1 2820	. . . . . . . 8 ⊢ (𝑦 = {𝑠 ∈ 𝑆 ∣ (◡(𝐹‘𝑛) “ 𝐴) = (𝑠 ∩ dom (𝐹‘𝑛))} → (𝑦 ∈ ran (𝑛 ∈ 𝑍 ↦ {𝑠 ∈ 𝑆 ∣ (◡(𝐹‘𝑛) “ 𝐴) = (𝑠 ∩ dom (𝐹‘𝑛))}) ↔ {𝑠 ∈ 𝑆 ∣ (◡(𝐹‘𝑛) “ 𝐴) = (𝑠 ∩ dom (𝐹‘𝑛))} ∈ ran (𝑛 ∈ 𝑍 ↦ {𝑠 ∈ 𝑆 ∣ (◡(𝐹‘𝑛) “ 𝐴) = (𝑠 ∩ dom (𝐹‘𝑛))})))
15	14	anbi2d 628	. . . . . . 7 ⊢ (𝑦 = {𝑠 ∈ 𝑆 ∣ (◡(𝐹‘𝑛) “ 𝐴) = (𝑠 ∩ dom (𝐹‘𝑛))} → ((𝜑 ∧ 𝑦 ∈ ran (𝑛 ∈ 𝑍 ↦ {𝑠 ∈ 𝑆 ∣ (◡(𝐹‘𝑛) “ 𝐴) = (𝑠 ∩ dom (𝐹‘𝑛))})) ↔ (𝜑 ∧ {𝑠 ∈ 𝑆 ∣ (◡(𝐹‘𝑛) “ 𝐴) = (𝑠 ∩ dom (𝐹‘𝑛))} ∈ ran (𝑛 ∈ 𝑍 ↦ {𝑠 ∈ 𝑆 ∣ (◡(𝐹‘𝑛) “ 𝐴) = (𝑠 ∩ dom (𝐹‘𝑛))}))))
16		fveq2 6892	. . . . . . . 8 ⊢ (𝑦 = {𝑠 ∈ 𝑆 ∣ (◡(𝐹‘𝑛) “ 𝐴) = (𝑠 ∩ dom (𝐹‘𝑛))} → (𝐶‘𝑦) = (𝐶‘{𝑠 ∈ 𝑆 ∣ (◡(𝐹‘𝑛) “ 𝐴) = (𝑠 ∩ dom (𝐹‘𝑛))}))
17		id 22	. . . . . . . 8 ⊢ (𝑦 = {𝑠 ∈ 𝑆 ∣ (◡(𝐹‘𝑛) “ 𝐴) = (𝑠 ∩ dom (𝐹‘𝑛))} → 𝑦 = {𝑠 ∈ 𝑆 ∣ (◡(𝐹‘𝑛) “ 𝐴) = (𝑠 ∩ dom (𝐹‘𝑛))})
18	16, 17	eleq12d 2826	. . . . . . 7 ⊢ (𝑦 = {𝑠 ∈ 𝑆 ∣ (◡(𝐹‘𝑛) “ 𝐴) = (𝑠 ∩ dom (𝐹‘𝑛))} → ((𝐶‘𝑦) ∈ 𝑦 ↔ (𝐶‘{𝑠 ∈ 𝑆 ∣ (◡(𝐹‘𝑛) “ 𝐴) = (𝑠 ∩ dom (𝐹‘𝑛))}) ∈ {𝑠 ∈ 𝑆 ∣ (◡(𝐹‘𝑛) “ 𝐴) = (𝑠 ∩ dom (𝐹‘𝑛))}))
19	15, 18	imbi12d 343	. . . . . 6 ⊢ (𝑦 = {𝑠 ∈ 𝑆 ∣ (◡(𝐹‘𝑛) “ 𝐴) = (𝑠 ∩ dom (𝐹‘𝑛))} → (((𝜑 ∧ 𝑦 ∈ ran (𝑛 ∈ 𝑍 ↦ {𝑠 ∈ 𝑆 ∣ (◡(𝐹‘𝑛) “ 𝐴) = (𝑠 ∩ dom (𝐹‘𝑛))})) → (𝐶‘𝑦) ∈ 𝑦) ↔ ((𝜑 ∧ {𝑠 ∈ 𝑆 ∣ (◡(𝐹‘𝑛) “ 𝐴) = (𝑠 ∩ dom (𝐹‘𝑛))} ∈ ran (𝑛 ∈ 𝑍 ↦ {𝑠 ∈ 𝑆 ∣ (◡(𝐹‘𝑛) “ 𝐴) = (𝑠 ∩ dom (𝐹‘𝑛))})) → (𝐶‘{𝑠 ∈ 𝑆 ∣ (◡(𝐹‘𝑛) “ 𝐴) = (𝑠 ∩ dom (𝐹‘𝑛))}) ∈ {𝑠 ∈ 𝑆 ∣ (◡(𝐹‘𝑛) “ 𝐴) = (𝑠 ∩ dom (𝐹‘𝑛))})))
20		smfpimcclem.c	. . . . . 6 ⊢ ((𝜑 ∧ 𝑦 ∈ ran (𝑛 ∈ 𝑍 ↦ {𝑠 ∈ 𝑆 ∣ (◡(𝐹‘𝑛) “ 𝐴) = (𝑠 ∩ dom (𝐹‘𝑛))})) → (𝐶‘𝑦) ∈ 𝑦)
21	19, 20	vtoclg 3557	. . . . 5 ⊢ ({𝑠 ∈ 𝑆 ∣ (◡(𝐹‘𝑛) “ 𝐴) = (𝑠 ∩ dom (𝐹‘𝑛))} ∈ V → ((𝜑 ∧ {𝑠 ∈ 𝑆 ∣ (◡(𝐹‘𝑛) “ 𝐴) = (𝑠 ∩ dom (𝐹‘𝑛))} ∈ ran (𝑛 ∈ 𝑍 ↦ {𝑠 ∈ 𝑆 ∣ (◡(𝐹‘𝑛) “ 𝐴) = (𝑠 ∩ dom (𝐹‘𝑛))})) → (𝐶‘{𝑠 ∈ 𝑆 ∣ (◡(𝐹‘𝑛) “ 𝐴) = (𝑠 ∩ dom (𝐹‘𝑛))}) ∈ {𝑠 ∈ 𝑆 ∣ (◡(𝐹‘𝑛) “ 𝐴) = (𝑠 ∩ dom (𝐹‘𝑛))}))
22	7, 13, 21	sylc 65	. . . 4 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍) → (𝐶‘{𝑠 ∈ 𝑆 ∣ (◡(𝐹‘𝑛) “ 𝐴) = (𝑠 ∩ dom (𝐹‘𝑛))}) ∈ {𝑠 ∈ 𝑆 ∣ (◡(𝐹‘𝑛) “ 𝐴) = (𝑠 ∩ dom (𝐹‘𝑛))})
23	3, 22	sselid 3981	. . 3 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍) → (𝐶‘{𝑠 ∈ 𝑆 ∣ (◡(𝐹‘𝑛) “ 𝐴) = (𝑠 ∩ dom (𝐹‘𝑛))}) ∈ 𝑆)
24		smfpimcclem.h	. . 3 ⊢ 𝐻 = (𝑛 ∈ 𝑍 ↦ (𝐶‘{𝑠 ∈ 𝑆 ∣ (◡(𝐹‘𝑛) “ 𝐴) = (𝑠 ∩ dom (𝐹‘𝑛))}))
25	1, 23, 24	fmptdf 7119	. 2 ⊢ (𝜑 → 𝐻:𝑍⟶𝑆)
26		nfcv 2902	. . . . . . . . 9 ⊢ Ⅎ𝑠𝐶
27		nfrab1 3450	. . . . . . . . 9 ⊢ Ⅎ𝑠{𝑠 ∈ 𝑆 ∣ (◡(𝐹‘𝑛) “ 𝐴) = (𝑠 ∩ dom (𝐹‘𝑛))}
28	26, 27	nffv 6902	. . . . . . . 8 ⊢ Ⅎ𝑠(𝐶‘{𝑠 ∈ 𝑆 ∣ (◡(𝐹‘𝑛) “ 𝐴) = (𝑠 ∩ dom (𝐹‘𝑛))})
29		nfcv 2902	. . . . . . . . 9 ⊢ Ⅎ𝑠(◡(𝐹‘𝑛) “ 𝐴)
30		nfcv 2902	. . . . . . . . . 10 ⊢ Ⅎ𝑠dom (𝐹‘𝑛)
31	28, 30	nfin 4217	. . . . . . . . 9 ⊢ Ⅎ𝑠((𝐶‘{𝑠 ∈ 𝑆 ∣ (◡(𝐹‘𝑛) “ 𝐴) = (𝑠 ∩ dom (𝐹‘𝑛))}) ∩ dom (𝐹‘𝑛))
32	29, 31	nfeq 2915	. . . . . . . 8 ⊢ Ⅎ𝑠(◡(𝐹‘𝑛) “ 𝐴) = ((𝐶‘{𝑠 ∈ 𝑆 ∣ (◡(𝐹‘𝑛) “ 𝐴) = (𝑠 ∩ dom (𝐹‘𝑛))}) ∩ dom (𝐹‘𝑛))
33		ineq1 4206	. . . . . . . . 9 ⊢ (𝑠 = (𝐶‘{𝑠 ∈ 𝑆 ∣ (◡(𝐹‘𝑛) “ 𝐴) = (𝑠 ∩ dom (𝐹‘𝑛))}) → (𝑠 ∩ dom (𝐹‘𝑛)) = ((𝐶‘{𝑠 ∈ 𝑆 ∣ (◡(𝐹‘𝑛) “ 𝐴) = (𝑠 ∩ dom (𝐹‘𝑛))}) ∩ dom (𝐹‘𝑛)))
34	33	eqeq2d 2742	. . . . . . . 8 ⊢ (𝑠 = (𝐶‘{𝑠 ∈ 𝑆 ∣ (◡(𝐹‘𝑛) “ 𝐴) = (𝑠 ∩ dom (𝐹‘𝑛))}) → ((◡(𝐹‘𝑛) “ 𝐴) = (𝑠 ∩ dom (𝐹‘𝑛)) ↔ (◡(𝐹‘𝑛) “ 𝐴) = ((𝐶‘{𝑠 ∈ 𝑆 ∣ (◡(𝐹‘𝑛) “ 𝐴) = (𝑠 ∩ dom (𝐹‘𝑛))}) ∩ dom (𝐹‘𝑛))))
35	28, 2, 32, 34	elrabf 3680	. . . . . . 7 ⊢ ((𝐶‘{𝑠 ∈ 𝑆 ∣ (◡(𝐹‘𝑛) “ 𝐴) = (𝑠 ∩ dom (𝐹‘𝑛))}) ∈ {𝑠 ∈ 𝑆 ∣ (◡(𝐹‘𝑛) “ 𝐴) = (𝑠 ∩ dom (𝐹‘𝑛))} ↔ ((𝐶‘{𝑠 ∈ 𝑆 ∣ (◡(𝐹‘𝑛) “ 𝐴) = (𝑠 ∩ dom (𝐹‘𝑛))}) ∈ 𝑆 ∧ (◡(𝐹‘𝑛) “ 𝐴) = ((𝐶‘{𝑠 ∈ 𝑆 ∣ (◡(𝐹‘𝑛) “ 𝐴) = (𝑠 ∩ dom (𝐹‘𝑛))}) ∩ dom (𝐹‘𝑛))))
36	22, 35	sylib 217	. . . . . 6 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍) → ((𝐶‘{𝑠 ∈ 𝑆 ∣ (◡(𝐹‘𝑛) “ 𝐴) = (𝑠 ∩ dom (𝐹‘𝑛))}) ∈ 𝑆 ∧ (◡(𝐹‘𝑛) “ 𝐴) = ((𝐶‘{𝑠 ∈ 𝑆 ∣ (◡(𝐹‘𝑛) “ 𝐴) = (𝑠 ∩ dom (𝐹‘𝑛))}) ∩ dom (𝐹‘𝑛))))
37	36	simprd 495	. . . . 5 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍) → (◡(𝐹‘𝑛) “ 𝐴) = ((𝐶‘{𝑠 ∈ 𝑆 ∣ (◡(𝐹‘𝑛) “ 𝐴) = (𝑠 ∩ dom (𝐹‘𝑛))}) ∩ dom (𝐹‘𝑛)))
38	24	a1i 11	. . . . . . 7 ⊢ (𝜑 → 𝐻 = (𝑛 ∈ 𝑍 ↦ (𝐶‘{𝑠 ∈ 𝑆 ∣ (◡(𝐹‘𝑛) “ 𝐴) = (𝑠 ∩ dom (𝐹‘𝑛))})))
39	22	elexd 3494	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍) → (𝐶‘{𝑠 ∈ 𝑆 ∣ (◡(𝐹‘𝑛) “ 𝐴) = (𝑠 ∩ dom (𝐹‘𝑛))}) ∈ V)
40	38, 39	fvmpt2d 7012	. . . . . 6 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍) → (𝐻‘𝑛) = (𝐶‘{𝑠 ∈ 𝑆 ∣ (◡(𝐹‘𝑛) “ 𝐴) = (𝑠 ∩ dom (𝐹‘𝑛))}))
41	40	ineq1d 4212	. . . . 5 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍) → ((𝐻‘𝑛) ∩ dom (𝐹‘𝑛)) = ((𝐶‘{𝑠 ∈ 𝑆 ∣ (◡(𝐹‘𝑛) “ 𝐴) = (𝑠 ∩ dom (𝐹‘𝑛))}) ∩ dom (𝐹‘𝑛)))
42	37, 41	eqtr4d 2774	. . . 4 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍) → (◡(𝐹‘𝑛) “ 𝐴) = ((𝐻‘𝑛) ∩ dom (𝐹‘𝑛)))
43	42	ex 412	. . 3 ⊢ (𝜑 → (𝑛 ∈ 𝑍 → (◡(𝐹‘𝑛) “ 𝐴) = ((𝐻‘𝑛) ∩ dom (𝐹‘𝑛))))
44	1, 43	ralrimi 3253	. 2 ⊢ (𝜑 → ∀𝑛 ∈ 𝑍 (◡(𝐹‘𝑛) “ 𝐴) = ((𝐻‘𝑛) ∩ dom (𝐹‘𝑛)))
45		smfpimcclem.z	. . . . . 6 ⊢ 𝑍 ∈ 𝑉
46	45	elexi 3493	. . . . 5 ⊢ 𝑍 ∈ V
47	46	mptex 7228	. . . 4 ⊢ (𝑛 ∈ 𝑍 ↦ (𝐶‘{𝑠 ∈ 𝑆 ∣ (◡(𝐹‘𝑛) “ 𝐴) = (𝑠 ∩ dom (𝐹‘𝑛))})) ∈ V
48	24, 47	eqeltri 2828	. . 3 ⊢ 𝐻 ∈ V
49		feq1 6699	. . . 4 ⊢ (ℎ = 𝐻 → (ℎ:𝑍⟶𝑆 ↔ 𝐻:𝑍⟶𝑆))
50		nfcv 2902	. . . . . 6 ⊢ Ⅎ𝑛ℎ
51		nfmpt1 5257	. . . . . . 7 ⊢ Ⅎ𝑛(𝑛 ∈ 𝑍 ↦ (𝐶‘{𝑠 ∈ 𝑆 ∣ (◡(𝐹‘𝑛) “ 𝐴) = (𝑠 ∩ dom (𝐹‘𝑛))}))
52	24, 51	nfcxfr 2900	. . . . . 6 ⊢ Ⅎ𝑛𝐻
53	50, 52	nfeq 2915	. . . . 5 ⊢ Ⅎ𝑛 ℎ = 𝐻
54		fveq1 6891	. . . . . . 7 ⊢ (ℎ = 𝐻 → (ℎ‘𝑛) = (𝐻‘𝑛))
55	54	ineq1d 4212	. . . . . 6 ⊢ (ℎ = 𝐻 → ((ℎ‘𝑛) ∩ dom (𝐹‘𝑛)) = ((𝐻‘𝑛) ∩ dom (𝐹‘𝑛)))
56	55	eqeq2d 2742	. . . . 5 ⊢ (ℎ = 𝐻 → ((◡(𝐹‘𝑛) “ 𝐴) = ((ℎ‘𝑛) ∩ dom (𝐹‘𝑛)) ↔ (◡(𝐹‘𝑛) “ 𝐴) = ((𝐻‘𝑛) ∩ dom (𝐹‘𝑛))))
57	53, 56	ralbid 3269	. . . 4 ⊢ (ℎ = 𝐻 → (∀𝑛 ∈ 𝑍 (◡(𝐹‘𝑛) “ 𝐴) = ((ℎ‘𝑛) ∩ dom (𝐹‘𝑛)) ↔ ∀𝑛 ∈ 𝑍 (◡(𝐹‘𝑛) “ 𝐴) = ((𝐻‘𝑛) ∩ dom (𝐹‘𝑛))))
58	49, 57	anbi12d 630	. . 3 ⊢ (ℎ = 𝐻 → ((ℎ:𝑍⟶𝑆 ∧ ∀𝑛 ∈ 𝑍 (◡(𝐹‘𝑛) “ 𝐴) = ((ℎ‘𝑛) ∩ dom (𝐹‘𝑛))) ↔ (𝐻:𝑍⟶𝑆 ∧ ∀𝑛 ∈ 𝑍 (◡(𝐹‘𝑛) “ 𝐴) = ((𝐻‘𝑛) ∩ dom (𝐹‘𝑛)))))
59	48, 58	spcev 3597	. 2 ⊢ ((𝐻:𝑍⟶𝑆 ∧ ∀𝑛 ∈ 𝑍 (◡(𝐹‘𝑛) “ 𝐴) = ((𝐻‘𝑛) ∩ dom (𝐹‘𝑛))) → ∃ℎ(ℎ:𝑍⟶𝑆 ∧ ∀𝑛 ∈ 𝑍 (◡(𝐹‘𝑛) “ 𝐴) = ((ℎ‘𝑛) ∩ dom (𝐹‘𝑛))))
60	25, 44, 59	syl2anc 583	1 ⊢ (𝜑 → ∃ℎ(ℎ:𝑍⟶𝑆 ∧ ∀𝑛 ∈ 𝑍 (◡(𝐹‘𝑛) “ 𝐴) = ((ℎ‘𝑛) ∩ dom (𝐹‘𝑛))))

Syntax hints:   → wi 4   ∧ wa 395   = wceq 1540  ∃wex 1780  Ⅎwnf 1784   ∈ wcel 2105  ∀wral 3060  {crab 3431  Vcvv 3473   ∩ cin 3948   ↦ cmpt 5232  ^◡ccnv 5676  dom cdm 5677  ran crn 5678   “ cima 5680  ⟶wf 6540  ‘cfv 6544

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1912  ax-6 1970  ax-7 2010  ax-8 2107  ax-9 2115  ax-10 2136  ax-11 2153  ax-12 2170  ax-ext 2702  ax-rep 5286  ax-sep 5300  ax-nul 5307  ax-pr 5428

This theorem depends on definitions:  df-bi 206  df-an 396  df-or 845  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1781  df-nf 1785  df-sb 2067  df-mo 2533  df-eu 2562  df-clab 2709  df-cleq 2723  df-clel 2809  df-nfc 2884  df-ne 2940  df-ral 3061  df-rex 3070  df-reu 3376  df-rab 3432  df-v 3475  df-sbc 3779  df-csb 3895  df-dif 3952  df-un 3954  df-in 3956  df-ss 3966  df-nul 4324  df-if 4530  df-sn 4630  df-pr 4632  df-op 4636  df-uni 4910  df-iun 5000  df-br 5150  df-opab 5212  df-mpt 5233  df-id 5575  df-xp 5683  df-rel 5684  df-cnv 5685  df-co 5686  df-dm 5687  df-rn 5688  df-res 5689  df-ima 5690  df-iota 6496  df-fun 6546  df-fn 6547  df-f 6548  df-f1 6549  df-fo 6550  df-f1o 6551  df-fv 6552

This theorem is referenced by:  smfpimcc  45824