Theorem tmachlem-agreeprod 48150

Description: Agreement set can be written as infinite product of acceptable values for tape's cells. (Contributed by Ender Ting, 27-Jul-2026.)

Hypotheses

Ref	Expression
tmach.finalph	⊢ (𝜑 → 𝑈 ∈ Fin)
tmach.exindex	⊢ (𝜑 → 𝐼 ∈ V)
tmach.tapelist	⊢ (𝜑 → 𝑇 = (𝑈 ↑m 𝐼))
tmach.scanmap	⊢ (𝜑 → 𝑆:𝑇⟶(𝒫 𝐼 ∩ Fin))
tmach.agreemap	⊢ (𝜑 → 𝐴 = (𝑧 ∈ 𝑇 ↦ {𝑦 ∈ 𝑇 ∣ (𝑦 ↾ (𝑆‘𝑧)) = (𝑧 ↾ (𝑆‘𝑧))}))
tmach.agreement	⊢ (𝜑 → ∀𝑧 ∈ 𝑇 ∀𝑦 ∈ (𝐴‘𝑧)(𝑆‘𝑦) = (𝑆‘𝑧))

Assertion

Ref	Expression
tmachlem-agreeprod	⊢ ((𝜑 ∧ 𝑎 ∈ 𝑇) → (𝐴‘𝑎) = X𝑖 ∈ 𝐼 if(𝑖 ∈ (𝑆‘𝑎), {(𝑎‘𝑖)}, 𝑈))

Distinct variable groups:   𝑈,𝑎,𝑖,𝑦,𝑧   𝐼,𝑎,𝑖,𝑦,𝑧   𝜑,𝑎,𝑖,𝑦,𝑧   𝑆,𝑎,𝑖,𝑦,𝑧   𝐴,𝑎,𝑖,𝑦,𝑧   𝑇,𝑎,𝑖,𝑦,𝑧

Proof of Theorem tmachlem-agreeprod

Step	Hyp	Ref	Expression
1		fveq2 6905	. . . . . 6 ⊢ (𝑧 = 𝑎 → (𝑆‘𝑧) = (𝑆‘𝑎))
2	1	reseq2d 5980	. . . . 5 ⊢ (𝑧 = 𝑎 → (𝑦 ↾ (𝑆‘𝑧)) = (𝑦 ↾ (𝑆‘𝑎)))
3		id 23	. . . . . 6 ⊢ (𝑧 = 𝑎 → 𝑧 = 𝑎)
4	3, 1	reseq12d 5981	. . . . 5 ⊢ (𝑧 = 𝑎 → (𝑧 ↾ (𝑆‘𝑧)) = (𝑎 ↾ (𝑆‘𝑎)))
5	2, 4	eqeq12d 2779	. . . 4 ⊢ (𝑧 = 𝑎 → ((𝑦 ↾ (𝑆‘𝑧)) = (𝑧 ↾ (𝑆‘𝑧)) ↔ (𝑦 ↾ (𝑆‘𝑎)) = (𝑎 ↾ (𝑆‘𝑎))))
6	5	rabbidv 3423	. . 3 ⊢ (𝑧 = 𝑎 → {𝑦 ∈ 𝑇 ∣ (𝑦 ↾ (𝑆‘𝑧)) = (𝑧 ↾ (𝑆‘𝑧))} = {𝑦 ∈ 𝑇 ∣ (𝑦 ↾ (𝑆‘𝑎)) = (𝑎 ↾ (𝑆‘𝑎))})
7		tmach.agreemap	. . . 4 ⊢ (𝜑 → 𝐴 = (𝑧 ∈ 𝑇 ↦ {𝑦 ∈ 𝑇 ∣ (𝑦 ↾ (𝑆‘𝑧)) = (𝑧 ↾ (𝑆‘𝑧))}))
8	7	adantr 486	. . 3 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝑇) → 𝐴 = (𝑧 ∈ 𝑇 ↦ {𝑦 ∈ 𝑇 ∣ (𝑦 ↾ (𝑆‘𝑧)) = (𝑧 ↾ (𝑆‘𝑧))}))
9		simpr 490	. . 3 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝑇) → 𝑎 ∈ 𝑇)
10		tmach.finalph	. . . . . 6 ⊢ (𝜑 → 𝑈 ∈ Fin)
11		tmach.exindex	. . . . . 6 ⊢ (𝜑 → 𝐼 ∈ V)
12		tmach.tapelist	. . . . . 6 ⊢ (𝜑 → 𝑇 = (𝑈 ↑m 𝐼))
13		tmach.scanmap	. . . . . 6 ⊢ (𝜑 → 𝑆:𝑇⟶(𝒫 𝐼 ∩ Fin))
14		tmach.agreement	. . . . . 6 ⊢ (𝜑 → ∀𝑧 ∈ 𝑇 ∀𝑦 ∈ (𝐴‘𝑧)(𝑆‘𝑦) = (𝑆‘𝑧))
15	10, 11, 12, 13, 7, 14	tmachlem-extapes 48147	. . . . 5 ⊢ (𝜑 → 𝑇 ∈ V)
16	15	adantr 486	. . . 4 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝑇) → 𝑇 ∈ V)
17		ssrab2 4008	. . . . 5 ⊢ {𝑦 ∈ 𝑇 ∣ (𝑦 ↾ (𝑆‘𝑎)) = (𝑎 ↾ (𝑆‘𝑎))} ⊆ 𝑇
18	17	a1i 11	. . . 4 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝑇) → {𝑦 ∈ 𝑇 ∣ (𝑦 ↾ (𝑆‘𝑎)) = (𝑎 ↾ (𝑆‘𝑎))} ⊆ 𝑇)
19	16, 18	ssexd 5290	. . 3 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝑇) → {𝑦 ∈ 𝑇 ∣ (𝑦 ↾ (𝑆‘𝑎)) = (𝑎 ↾ (𝑆‘𝑎))} ∈ V)
20	6, 8, 9, 19	fvmptd4 7038	. 2 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝑇) → (𝐴‘𝑎) = {𝑦 ∈ 𝑇 ∣ (𝑦 ↾ (𝑆‘𝑎)) = (𝑎 ↾ (𝑆‘𝑎))})
21		snfi 9096	. . . . . . . . 9 ⊢ {(𝑎‘𝑖)} ∈ Fin
22	21	a1i 11	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑎 ∈ 𝑇) ∧ 𝑖 ∈ 𝐼) → {(𝑎‘𝑖)} ∈ Fin)
23	10	ad2antrr 739	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑎 ∈ 𝑇) ∧ 𝑖 ∈ 𝐼) → 𝑈 ∈ Fin)
24	22, 23	ifcld 4532	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑎 ∈ 𝑇) ∧ 𝑖 ∈ 𝐼) → if(𝑖 ∈ (𝑆‘𝑎), {(𝑎‘𝑖)}, 𝑈) ∈ Fin)
25	24	ralrimiva 3158	. . . . . 6 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝑇) → ∀𝑖 ∈ 𝐼 if(𝑖 ∈ (𝑆‘𝑎), {(𝑎‘𝑖)}, 𝑈) ∈ Fin)
26		ixpssmapg 8981	. . . . . 6 ⊢ (∀𝑖 ∈ 𝐼 if(𝑖 ∈ (𝑆‘𝑎), {(𝑎‘𝑖)}, 𝑈) ∈ Fin → X𝑖 ∈ 𝐼 if(𝑖 ∈ (𝑆‘𝑎), {(𝑎‘𝑖)}, 𝑈) ⊆ (∪ 𝑖 ∈ 𝐼 if(𝑖 ∈ (𝑆‘𝑎), {(𝑎‘𝑖)}, 𝑈) ↑m 𝐼))
27	25, 26	syl 18	. . . . 5 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝑇) → X𝑖 ∈ 𝐼 if(𝑖 ∈ (𝑆‘𝑎), {(𝑎‘𝑖)}, 𝑈) ⊆ (∪ 𝑖 ∈ 𝐼 if(𝑖 ∈ (𝑆‘𝑎), {(𝑎‘𝑖)}, 𝑈) ↑m 𝐼))
28		ifssun 4503	. . . . . . . 8 ⊢ if(𝑖 ∈ (𝑆‘𝑎), {(𝑎‘𝑖)}, 𝑈) ⊆ ({(𝑎‘𝑖)} ∪ 𝑈)
29	12	eleq2d 2850	. . . . . . . . . . . . . 14 ⊢ (𝜑 → (𝑎 ∈ 𝑇 ↔ 𝑎 ∈ (𝑈 ↑m 𝐼)))
30	29	biimpd 232	. . . . . . . . . . . . 13 ⊢ (𝜑 → (𝑎 ∈ 𝑇 → 𝑎 ∈ (𝑈 ↑m 𝐼)))
31	30	imp 412	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝑇) → 𝑎 ∈ (𝑈 ↑m 𝐼))
32		elmapi 8894	. . . . . . . . . . . 12 ⊢ (𝑎 ∈ (𝑈 ↑m 𝐼) → 𝑎:𝐼⟶𝑈)
33	31, 32	syl 18	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝑇) → 𝑎:𝐼⟶𝑈)
34	33	ffvelcdmda 7105	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑎 ∈ 𝑇) ∧ 𝑖 ∈ 𝐼) → (𝑎‘𝑖) ∈ 𝑈)
35	34	snssd 4747	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑎 ∈ 𝑇) ∧ 𝑖 ∈ 𝐼) → {(𝑎‘𝑖)} ⊆ 𝑈)
36		ssequn1 4187	. . . . . . . . 9 ⊢ ({(𝑎‘𝑖)} ⊆ 𝑈 ↔ ({(𝑎‘𝑖)} ∪ 𝑈) = 𝑈)
37	35, 36	sylib 221	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑎 ∈ 𝑇) ∧ 𝑖 ∈ 𝐼) → ({(𝑎‘𝑖)} ∪ 𝑈) = 𝑈)
38	28, 37	sseqtrid 3955	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑎 ∈ 𝑇) ∧ 𝑖 ∈ 𝐼) → if(𝑖 ∈ (𝑆‘𝑎), {(𝑎‘𝑖)}, 𝑈) ⊆ 𝑈)
39	38	iunssd 5012	. . . . . 6 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝑇) → ∪ 𝑖 ∈ 𝐼 if(𝑖 ∈ (𝑆‘𝑎), {(𝑎‘𝑖)}, 𝑈) ⊆ 𝑈)
40		mapss 8942	. . . . . 6 ⊢ ((𝑈 ∈ Fin ∧ ∪ 𝑖 ∈ 𝐼 if(𝑖 ∈ (𝑆‘𝑎), {(𝑎‘𝑖)}, 𝑈) ⊆ 𝑈) → (∪ 𝑖 ∈ 𝐼 if(𝑖 ∈ (𝑆‘𝑎), {(𝑎‘𝑖)}, 𝑈) ↑m 𝐼) ⊆ (𝑈 ↑m 𝐼))
41	10, 39, 40	syl2an2r 698	. . . . 5 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝑇) → (∪ 𝑖 ∈ 𝐼 if(𝑖 ∈ (𝑆‘𝑎), {(𝑎‘𝑖)}, 𝑈) ↑m 𝐼) ⊆ (𝑈 ↑m 𝐼))
42	27, 41	sstrd 3923	. . . 4 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝑇) → X𝑖 ∈ 𝐼 if(𝑖 ∈ (𝑆‘𝑎), {(𝑎‘𝑖)}, 𝑈) ⊆ (𝑈 ↑m 𝐼))
43	12	adantr 486	. . . 4 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝑇) → 𝑇 = (𝑈 ↑m 𝐼))
44	42, 43	sseqtrrd 3950	. . 3 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝑇) → X𝑖 ∈ 𝐼 if(𝑖 ∈ (𝑆‘𝑎), {(𝑎‘𝑖)}, 𝑈) ⊆ 𝑇)
45		simplr 781	. . . . . . . . . . . . 13 ⊢ (((((𝜑 ∧ 𝑎 ∈ 𝑇) ∧ 𝑦 ∈ 𝑇) ∧ 𝑖 ∈ (𝑆‘𝑎)) ∧ (𝑖 ∈ (𝑆‘𝑎) → (𝑦‘𝑖) = (𝑎‘𝑖))) → 𝑖 ∈ (𝑆‘𝑎))
46		simpr 490	. . . . . . . . . . . . 13 ⊢ (((((𝜑 ∧ 𝑎 ∈ 𝑇) ∧ 𝑦 ∈ 𝑇) ∧ 𝑖 ∈ (𝑆‘𝑎)) ∧ (𝑖 ∈ (𝑆‘𝑎) → (𝑦‘𝑖) = (𝑎‘𝑖))) → (𝑖 ∈ (𝑆‘𝑎) → (𝑦‘𝑖) = (𝑎‘𝑖)))
47	45, 46	mpd 16	. . . . . . . . . . . 12 ⊢ (((((𝜑 ∧ 𝑎 ∈ 𝑇) ∧ 𝑦 ∈ 𝑇) ∧ 𝑖 ∈ (𝑆‘𝑎)) ∧ (𝑖 ∈ (𝑆‘𝑎) → (𝑦‘𝑖) = (𝑎‘𝑖))) → (𝑦‘𝑖) = (𝑎‘𝑖))
48		fvex 6918	. . . . . . . . . . . . 13 ⊢ (𝑦‘𝑖) ∈ V
49	48	elsn 4599	. . . . . . . . . . . 12 ⊢ ((𝑦‘𝑖) ∈ {(𝑎‘𝑖)} ↔ (𝑦‘𝑖) = (𝑎‘𝑖))
50	47, 49	sylibr 237	. . . . . . . . . . 11 ⊢ (((((𝜑 ∧ 𝑎 ∈ 𝑇) ∧ 𝑦 ∈ 𝑇) ∧ 𝑖 ∈ (𝑆‘𝑎)) ∧ (𝑖 ∈ (𝑆‘𝑎) → (𝑦‘𝑖) = (𝑎‘𝑖))) → (𝑦‘𝑖) ∈ {(𝑎‘𝑖)})
51	45	iftrued 4493	. . . . . . . . . . 11 ⊢ (((((𝜑 ∧ 𝑎 ∈ 𝑇) ∧ 𝑦 ∈ 𝑇) ∧ 𝑖 ∈ (𝑆‘𝑎)) ∧ (𝑖 ∈ (𝑆‘𝑎) → (𝑦‘𝑖) = (𝑎‘𝑖))) → if(𝑖 ∈ (𝑆‘𝑎), {(𝑎‘𝑖)}, 𝑈) = {(𝑎‘𝑖)})
52	50, 51	eleqtrrd 2867	. . . . . . . . . 10 ⊢ (((((𝜑 ∧ 𝑎 ∈ 𝑇) ∧ 𝑦 ∈ 𝑇) ∧ 𝑖 ∈ (𝑆‘𝑎)) ∧ (𝑖 ∈ (𝑆‘𝑎) → (𝑦‘𝑖) = (𝑎‘𝑖))) → (𝑦‘𝑖) ∈ if(𝑖 ∈ (𝑆‘𝑎), {(𝑎‘𝑖)}, 𝑈))
53	52	ex 418	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝑎 ∈ 𝑇) ∧ 𝑦 ∈ 𝑇) ∧ 𝑖 ∈ (𝑆‘𝑎)) → ((𝑖 ∈ (𝑆‘𝑎) → (𝑦‘𝑖) = (𝑎‘𝑖)) → (𝑦‘𝑖) ∈ if(𝑖 ∈ (𝑆‘𝑎), {(𝑎‘𝑖)}, 𝑈)))
54	53	a1dd 51	. . . . . . . 8 ⊢ ((((𝜑 ∧ 𝑎 ∈ 𝑇) ∧ 𝑦 ∈ 𝑇) ∧ 𝑖 ∈ (𝑆‘𝑎)) → ((𝑖 ∈ (𝑆‘𝑎) → (𝑦‘𝑖) = (𝑎‘𝑖)) → (𝑖 ∈ 𝐼 → (𝑦‘𝑖) ∈ if(𝑖 ∈ (𝑆‘𝑎), {(𝑎‘𝑖)}, 𝑈))))
55	13	ffvelcdmda 7105	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝑇) → (𝑆‘𝑎) ∈ (𝒫 𝐼 ∩ Fin))
56	55	elin1d 4104	. . . . . . . . . . . . . . . . 17 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝑇) → (𝑆‘𝑎) ∈ 𝒫 𝐼)
57	56	elpwid 4569	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝑇) → (𝑆‘𝑎) ⊆ 𝐼)
58	57	adantr 486	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝑎 ∈ 𝑇) ∧ 𝑦 ∈ 𝑇) → (𝑆‘𝑎) ⊆ 𝐼)
59	58	sselda 3913	. . . . . . . . . . . . . 14 ⊢ ((((𝜑 ∧ 𝑎 ∈ 𝑇) ∧ 𝑦 ∈ 𝑇) ∧ 𝑖 ∈ (𝑆‘𝑎)) → 𝑖 ∈ 𝐼)
60	59	adantr 486	. . . . . . . . . . . . 13 ⊢ (((((𝜑 ∧ 𝑎 ∈ 𝑇) ∧ 𝑦 ∈ 𝑇) ∧ 𝑖 ∈ (𝑆‘𝑎)) ∧ (𝑖 ∈ 𝐼 → (𝑦‘𝑖) ∈ if(𝑖 ∈ (𝑆‘𝑎), {(𝑎‘𝑖)}, 𝑈))) → 𝑖 ∈ 𝐼)
61		simpr 490	. . . . . . . . . . . . 13 ⊢ (((((𝜑 ∧ 𝑎 ∈ 𝑇) ∧ 𝑦 ∈ 𝑇) ∧ 𝑖 ∈ (𝑆‘𝑎)) ∧ (𝑖 ∈ 𝐼 → (𝑦‘𝑖) ∈ if(𝑖 ∈ (𝑆‘𝑎), {(𝑎‘𝑖)}, 𝑈))) → (𝑖 ∈ 𝐼 → (𝑦‘𝑖) ∈ if(𝑖 ∈ (𝑆‘𝑎), {(𝑎‘𝑖)}, 𝑈)))
62	60, 61	mpd 16	. . . . . . . . . . . 12 ⊢ (((((𝜑 ∧ 𝑎 ∈ 𝑇) ∧ 𝑦 ∈ 𝑇) ∧ 𝑖 ∈ (𝑆‘𝑎)) ∧ (𝑖 ∈ 𝐼 → (𝑦‘𝑖) ∈ if(𝑖 ∈ (𝑆‘𝑎), {(𝑎‘𝑖)}, 𝑈))) → (𝑦‘𝑖) ∈ if(𝑖 ∈ (𝑆‘𝑎), {(𝑎‘𝑖)}, 𝑈))
63		simplr 781	. . . . . . . . . . . . 13 ⊢ (((((𝜑 ∧ 𝑎 ∈ 𝑇) ∧ 𝑦 ∈ 𝑇) ∧ 𝑖 ∈ (𝑆‘𝑎)) ∧ (𝑖 ∈ 𝐼 → (𝑦‘𝑖) ∈ if(𝑖 ∈ (𝑆‘𝑎), {(𝑎‘𝑖)}, 𝑈))) → 𝑖 ∈ (𝑆‘𝑎))
64	63	iftrued 4493	. . . . . . . . . . . 12 ⊢ (((((𝜑 ∧ 𝑎 ∈ 𝑇) ∧ 𝑦 ∈ 𝑇) ∧ 𝑖 ∈ (𝑆‘𝑎)) ∧ (𝑖 ∈ 𝐼 → (𝑦‘𝑖) ∈ if(𝑖 ∈ (𝑆‘𝑎), {(𝑎‘𝑖)}, 𝑈))) → if(𝑖 ∈ (𝑆‘𝑎), {(𝑎‘𝑖)}, 𝑈) = {(𝑎‘𝑖)})
65	62, 64	eleqtrd 2866	. . . . . . . . . . 11 ⊢ (((((𝜑 ∧ 𝑎 ∈ 𝑇) ∧ 𝑦 ∈ 𝑇) ∧ 𝑖 ∈ (𝑆‘𝑎)) ∧ (𝑖 ∈ 𝐼 → (𝑦‘𝑖) ∈ if(𝑖 ∈ (𝑆‘𝑎), {(𝑎‘𝑖)}, 𝑈))) → (𝑦‘𝑖) ∈ {(𝑎‘𝑖)})
66	65	elsnd 4602	. . . . . . . . . 10 ⊢ (((((𝜑 ∧ 𝑎 ∈ 𝑇) ∧ 𝑦 ∈ 𝑇) ∧ 𝑖 ∈ (𝑆‘𝑎)) ∧ (𝑖 ∈ 𝐼 → (𝑦‘𝑖) ∈ if(𝑖 ∈ (𝑆‘𝑎), {(𝑎‘𝑖)}, 𝑈))) → (𝑦‘𝑖) = (𝑎‘𝑖))
67	66	ex 418	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝑎 ∈ 𝑇) ∧ 𝑦 ∈ 𝑇) ∧ 𝑖 ∈ (𝑆‘𝑎)) → ((𝑖 ∈ 𝐼 → (𝑦‘𝑖) ∈ if(𝑖 ∈ (𝑆‘𝑎), {(𝑎‘𝑖)}, 𝑈)) → (𝑦‘𝑖) = (𝑎‘𝑖)))
68	67	a1dd 51	. . . . . . . 8 ⊢ ((((𝜑 ∧ 𝑎 ∈ 𝑇) ∧ 𝑦 ∈ 𝑇) ∧ 𝑖 ∈ (𝑆‘𝑎)) → ((𝑖 ∈ 𝐼 → (𝑦‘𝑖) ∈ if(𝑖 ∈ (𝑆‘𝑎), {(𝑎‘𝑖)}, 𝑈)) → (𝑖 ∈ (𝑆‘𝑎) → (𝑦‘𝑖) = (𝑎‘𝑖))))
69	54, 68	impbid 215	. . . . . . 7 ⊢ ((((𝜑 ∧ 𝑎 ∈ 𝑇) ∧ 𝑦 ∈ 𝑇) ∧ 𝑖 ∈ (𝑆‘𝑎)) → ((𝑖 ∈ (𝑆‘𝑎) → (𝑦‘𝑖) = (𝑎‘𝑖)) ↔ (𝑖 ∈ 𝐼 → (𝑦‘𝑖) ∈ if(𝑖 ∈ (𝑆‘𝑎), {(𝑎‘𝑖)}, 𝑈))))
70	12	eleq2d 2850	. . . . . . . . . . . . . . . . 17 ⊢ (𝜑 → (𝑦 ∈ 𝑇 ↔ 𝑦 ∈ (𝑈 ↑m 𝐼)))
71	70	biimpd 232	. . . . . . . . . . . . . . . 16 ⊢ (𝜑 → (𝑦 ∈ 𝑇 → 𝑦 ∈ (𝑈 ↑m 𝐼)))
72	71	adantr 486	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝑇) → (𝑦 ∈ 𝑇 → 𝑦 ∈ (𝑈 ↑m 𝐼)))
73	72	imp 412	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑎 ∈ 𝑇) ∧ 𝑦 ∈ 𝑇) → 𝑦 ∈ (𝑈 ↑m 𝐼))
74		elmapi 8894	. . . . . . . . . . . . . 14 ⊢ (𝑦 ∈ (𝑈 ↑m 𝐼) → 𝑦:𝐼⟶𝑈)
75	73, 74	syl 18	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑎 ∈ 𝑇) ∧ 𝑦 ∈ 𝑇) → 𝑦:𝐼⟶𝑈)
76	75	adantr 486	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ 𝑎 ∈ 𝑇) ∧ 𝑦 ∈ 𝑇) ∧ ¬ 𝑖 ∈ (𝑆‘𝑎)) → 𝑦:𝐼⟶𝑈)
77	76	ffvelcdmda 7105	. . . . . . . . . . 11 ⊢ (((((𝜑 ∧ 𝑎 ∈ 𝑇) ∧ 𝑦 ∈ 𝑇) ∧ ¬ 𝑖 ∈ (𝑆‘𝑎)) ∧ 𝑖 ∈ 𝐼) → (𝑦‘𝑖) ∈ 𝑈)
78		simplr 781	. . . . . . . . . . . 12 ⊢ (((((𝜑 ∧ 𝑎 ∈ 𝑇) ∧ 𝑦 ∈ 𝑇) ∧ ¬ 𝑖 ∈ (𝑆‘𝑎)) ∧ 𝑖 ∈ 𝐼) → ¬ 𝑖 ∈ (𝑆‘𝑎))
79	78	iffalsed 4496	. . . . . . . . . . 11 ⊢ (((((𝜑 ∧ 𝑎 ∈ 𝑇) ∧ 𝑦 ∈ 𝑇) ∧ ¬ 𝑖 ∈ (𝑆‘𝑎)) ∧ 𝑖 ∈ 𝐼) → if(𝑖 ∈ (𝑆‘𝑎), {(𝑎‘𝑖)}, 𝑈) = 𝑈)
80	77, 79	eleqtrrd 2867	. . . . . . . . . 10 ⊢ (((((𝜑 ∧ 𝑎 ∈ 𝑇) ∧ 𝑦 ∈ 𝑇) ∧ ¬ 𝑖 ∈ (𝑆‘𝑎)) ∧ 𝑖 ∈ 𝐼) → (𝑦‘𝑖) ∈ if(𝑖 ∈ (𝑆‘𝑎), {(𝑎‘𝑖)}, 𝑈))
81	80	ex 418	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝑎 ∈ 𝑇) ∧ 𝑦 ∈ 𝑇) ∧ ¬ 𝑖 ∈ (𝑆‘𝑎)) → (𝑖 ∈ 𝐼 → (𝑦‘𝑖) ∈ if(𝑖 ∈ (𝑆‘𝑎), {(𝑎‘𝑖)}, 𝑈)))
82	81	a1d 26	. . . . . . . 8 ⊢ ((((𝜑 ∧ 𝑎 ∈ 𝑇) ∧ 𝑦 ∈ 𝑇) ∧ ¬ 𝑖 ∈ (𝑆‘𝑎)) → ((𝑖 ∈ (𝑆‘𝑎) → (𝑦‘𝑖) = (𝑎‘𝑖)) → (𝑖 ∈ 𝐼 → (𝑦‘𝑖) ∈ if(𝑖 ∈ (𝑆‘𝑎), {(𝑎‘𝑖)}, 𝑈))))
83		simplr 781	. . . . . . . . . 10 ⊢ (((((𝜑 ∧ 𝑎 ∈ 𝑇) ∧ 𝑦 ∈ 𝑇) ∧ ¬ 𝑖 ∈ (𝑆‘𝑎)) ∧ (𝑖 ∈ 𝐼 → (𝑦‘𝑖) ∈ if(𝑖 ∈ (𝑆‘𝑎), {(𝑎‘𝑖)}, 𝑈))) → ¬ 𝑖 ∈ (𝑆‘𝑎))
84	83	pm2.21d 122	. . . . . . . . 9 ⊢ (((((𝜑 ∧ 𝑎 ∈ 𝑇) ∧ 𝑦 ∈ 𝑇) ∧ ¬ 𝑖 ∈ (𝑆‘𝑎)) ∧ (𝑖 ∈ 𝐼 → (𝑦‘𝑖) ∈ if(𝑖 ∈ (𝑆‘𝑎), {(𝑎‘𝑖)}, 𝑈))) → (𝑖 ∈ (𝑆‘𝑎) → (𝑦‘𝑖) = (𝑎‘𝑖)))
85	84	ex 418	. . . . . . . 8 ⊢ ((((𝜑 ∧ 𝑎 ∈ 𝑇) ∧ 𝑦 ∈ 𝑇) ∧ ¬ 𝑖 ∈ (𝑆‘𝑎)) → ((𝑖 ∈ 𝐼 → (𝑦‘𝑖) ∈ if(𝑖 ∈ (𝑆‘𝑎), {(𝑎‘𝑖)}, 𝑈)) → (𝑖 ∈ (𝑆‘𝑎) → (𝑦‘𝑖) = (𝑎‘𝑖))))
86	82, 85	impbid 215	. . . . . . 7 ⊢ ((((𝜑 ∧ 𝑎 ∈ 𝑇) ∧ 𝑦 ∈ 𝑇) ∧ ¬ 𝑖 ∈ (𝑆‘𝑎)) → ((𝑖 ∈ (𝑆‘𝑎) → (𝑦‘𝑖) = (𝑎‘𝑖)) ↔ (𝑖 ∈ 𝐼 → (𝑦‘𝑖) ∈ if(𝑖 ∈ (𝑆‘𝑎), {(𝑎‘𝑖)}, 𝑈))))
87	69, 86	pm2.61dan 825	. . . . . 6 ⊢ (((𝜑 ∧ 𝑎 ∈ 𝑇) ∧ 𝑦 ∈ 𝑇) → ((𝑖 ∈ (𝑆‘𝑎) → (𝑦‘𝑖) = (𝑎‘𝑖)) ↔ (𝑖 ∈ 𝐼 → (𝑦‘𝑖) ∈ if(𝑖 ∈ (𝑆‘𝑎), {(𝑎‘𝑖)}, 𝑈))))
88	87	ralbidv2 3185	. . . . 5 ⊢ (((𝜑 ∧ 𝑎 ∈ 𝑇) ∧ 𝑦 ∈ 𝑇) → (∀𝑖 ∈ (𝑆‘𝑎)(𝑦‘𝑖) = (𝑎‘𝑖) ↔ ∀𝑖 ∈ 𝐼 (𝑦‘𝑖) ∈ if(𝑖 ∈ (𝑆‘𝑎), {(𝑎‘𝑖)}, 𝑈)))
89	71	imp 412	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝑇) → 𝑦 ∈ (𝑈 ↑m 𝐼))
90		elmapfn 8912	. . . . . . . 8 ⊢ (𝑦 ∈ (𝑈 ↑m 𝐼) → 𝑦 Fn 𝐼)
91	89, 90	syl 18	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝑇) → 𝑦 Fn 𝐼)
92	91	adantlr 728	. . . . . 6 ⊢ (((𝜑 ∧ 𝑎 ∈ 𝑇) ∧ 𝑦 ∈ 𝑇) → 𝑦 Fn 𝐼)
93	92	biantrurd 542	. . . . 5 ⊢ (((𝜑 ∧ 𝑎 ∈ 𝑇) ∧ 𝑦 ∈ 𝑇) → (∀𝑖 ∈ 𝐼 (𝑦‘𝑖) ∈ if(𝑖 ∈ (𝑆‘𝑎), {(𝑎‘𝑖)}, 𝑈) ↔ (𝑦 Fn 𝐼 ∧ ∀𝑖 ∈ 𝐼 (𝑦‘𝑖) ∈ if(𝑖 ∈ (𝑆‘𝑎), {(𝑎‘𝑖)}, 𝑈))))
94	88, 93	bitr2d 283	. . . 4 ⊢ (((𝜑 ∧ 𝑎 ∈ 𝑇) ∧ 𝑦 ∈ 𝑇) → ((𝑦 Fn 𝐼 ∧ ∀𝑖 ∈ 𝐼 (𝑦‘𝑖) ∈ if(𝑖 ∈ (𝑆‘𝑎), {(𝑎‘𝑖)}, 𝑈)) ↔ ∀𝑖 ∈ (𝑆‘𝑎)(𝑦‘𝑖) = (𝑎‘𝑖)))
95		vex 3458	. . . . . 6 ⊢ 𝑦 ∈ V
96	95	elixp 8957	. . . . 5 ⊢ (𝑦 ∈ X𝑖 ∈ 𝐼 if(𝑖 ∈ (𝑆‘𝑎), {(𝑎‘𝑖)}, 𝑈) ↔ (𝑦 Fn 𝐼 ∧ ∀𝑖 ∈ 𝐼 (𝑦‘𝑖) ∈ if(𝑖 ∈ (𝑆‘𝑎), {(𝑎‘𝑖)}, 𝑈)))
97	96	a1i 11	. . . 4 ⊢ (((𝜑 ∧ 𝑎 ∈ 𝑇) ∧ 𝑦 ∈ 𝑇) → (𝑦 ∈ X𝑖 ∈ 𝐼 if(𝑖 ∈ (𝑆‘𝑎), {(𝑎‘𝑖)}, 𝑈) ↔ (𝑦 Fn 𝐼 ∧ ∀𝑖 ∈ 𝐼 (𝑦‘𝑖) ∈ if(𝑖 ∈ (𝑆‘𝑎), {(𝑎‘𝑖)}, 𝑈))))
98		elmapfn 8912	. . . . . . 7 ⊢ (𝑎 ∈ (𝑈 ↑m 𝐼) → 𝑎 Fn 𝐼)
99	31, 98	syl 18	. . . . . 6 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝑇) → 𝑎 Fn 𝐼)
100	99	adantr 486	. . . . 5 ⊢ (((𝜑 ∧ 𝑎 ∈ 𝑇) ∧ 𝑦 ∈ 𝑇) → 𝑎 Fn 𝐼)
101		fvreseq 7059	. . . . 5 ⊢ (((𝑦 Fn 𝐼 ∧ 𝑎 Fn 𝐼) ∧ (𝑆‘𝑎) ⊆ 𝐼) → ((𝑦 ↾ (𝑆‘𝑎)) = (𝑎 ↾ (𝑆‘𝑎)) ↔ ∀𝑖 ∈ (𝑆‘𝑎)(𝑦‘𝑖) = (𝑎‘𝑖)))
102	92, 100, 58, 101	syl21anc 851	. . . 4 ⊢ (((𝜑 ∧ 𝑎 ∈ 𝑇) ∧ 𝑦 ∈ 𝑇) → ((𝑦 ↾ (𝑆‘𝑎)) = (𝑎 ↾ (𝑆‘𝑎)) ↔ ∀𝑖 ∈ (𝑆‘𝑎)(𝑦‘𝑖) = (𝑎‘𝑖)))
103	94, 97, 102	3bitr4d 314	. . 3 ⊢ (((𝜑 ∧ 𝑎 ∈ 𝑇) ∧ 𝑦 ∈ 𝑇) → (𝑦 ∈ X𝑖 ∈ 𝐼 if(𝑖 ∈ (𝑆‘𝑎), {(𝑎‘𝑖)}, 𝑈) ↔ (𝑦 ↾ (𝑆‘𝑎)) = (𝑎 ↾ (𝑆‘𝑎))))
104	44, 103	eqrrabd 4014	. 2 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝑇) → X𝑖 ∈ 𝐼 if(𝑖 ∈ (𝑆‘𝑎), {(𝑎‘𝑖)}, 𝑈) = {𝑦 ∈ 𝑇 ∣ (𝑦 ↾ (𝑆‘𝑎)) = (𝑎 ↾ (𝑆‘𝑎))})
105	20, 104	eqtr4d 2801	1 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝑇) → (𝐴‘𝑎) = X𝑖 ∈ 𝐼 if(𝑖 ∈ (𝑆‘𝑎), {(𝑎‘𝑖)}, 𝑈))

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2147  ∀wral 3080  {crab 3416  Vcvv 3454   ⊆ wss 3900   ∩ cin 4092   ∪ cun 4152  ifcif 4485  𝒫 cpw 4560  {csn 4588  ∪ ciun 4954   ↦ cmpt 5189   ↾ cres 5657   Fn wfn 6550  ⟶wf 6551  ‘cfv 6555  (class class class)co 7440   ↑_m cmap 8872  Xcixp 8950  Fincfn 8998

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-rep 5235  ax-sep 5252  ax-nul 5263  ax-pow 5331  ax-pr 5395  ax-un 7772

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-pss 4017  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-iun 4956  df-br 5107  df-opab 5171  df-mpt 5190  df-tr 5216  df-id 5550  df-eprel 5555  df-po 5563  df-so 5564  df-fr 5608  df-we 5610  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-ord 6380  df-on 6381  df-lim 6382  df-suc 6383  df-iota 6509  df-fun 6557  df-fn 6558  df-f 6559  df-f1 6560  df-fo 6561  df-f1o 6562  df-fv 6563  df-ov 7443  df-oprab 7444  df-mpo 7445  df-om 7899  df-1st 8022  df-2nd 8023  df-1o 8501  df-map 8874  df-ixp 8951  df-en 8999  df-fin 9002

This theorem is used by:  tmachlem-tpopen2  48155