Theorem tmachlem-agreesn 47760

Description: Scans for all tapes of a single agreement set are identical. (Contributed by Ender Ting, 28-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-agreesn	⊢ ((𝜑 ∧ 𝑎 ∈ 𝑇) → (𝑆 “ (𝐴‘𝑎)) = {(𝑆‘𝑎)})

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

Proof of Theorem tmachlem-agreesn

Step	Hyp	Ref	Expression
1		nfv 1947	. . 3 ⊢ Ⅎ𝑦(𝜑 ∧ 𝑎 ∈ 𝑇)
2		tmach.scanmap	. . . . 5 ⊢ (𝜑 → 𝑆:𝑇⟶(𝒫 𝐼 ∩ Fin))
3	2	ffund 6711	. . . 4 ⊢ (𝜑 → Fun 𝑆)
4	3	adantr 486	. . 3 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝑇) → Fun 𝑆)
5		tmach.agreement	. . . . . . 7 ⊢ (𝜑 → ∀𝑧 ∈ 𝑇 ∀𝑦 ∈ (𝐴‘𝑧)(𝑆‘𝑦) = (𝑆‘𝑧))
6		fveq2 6882	. . . . . . . . 9 ⊢ (𝑧 = 𝑎 → (𝐴‘𝑧) = (𝐴‘𝑎))
7		fveq2 6882	. . . . . . . . . 10 ⊢ (𝑧 = 𝑎 → (𝑆‘𝑧) = (𝑆‘𝑎))
8	7	eqeq2d 2773	. . . . . . . . 9 ⊢ (𝑧 = 𝑎 → ((𝑆‘𝑦) = (𝑆‘𝑧) ↔ (𝑆‘𝑦) = (𝑆‘𝑎)))
9	6, 8	raleqbidv 3336	. . . . . . . 8 ⊢ (𝑧 = 𝑎 → (∀𝑦 ∈ (𝐴‘𝑧)(𝑆‘𝑦) = (𝑆‘𝑧) ↔ ∀𝑦 ∈ (𝐴‘𝑎)(𝑆‘𝑦) = (𝑆‘𝑎)))
10	9	cbvralvw 3242	. . . . . . 7 ⊢ (∀𝑧 ∈ 𝑇 ∀𝑦 ∈ (𝐴‘𝑧)(𝑆‘𝑦) = (𝑆‘𝑧) ↔ ∀𝑎 ∈ 𝑇 ∀𝑦 ∈ (𝐴‘𝑎)(𝑆‘𝑦) = (𝑆‘𝑎))
11	5, 10	sylib 221	. . . . . 6 ⊢ (𝜑 → ∀𝑎 ∈ 𝑇 ∀𝑦 ∈ (𝐴‘𝑎)(𝑆‘𝑦) = (𝑆‘𝑎))
12	11	r19.21bi 3256	. . . . 5 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝑇) → ∀𝑦 ∈ (𝐴‘𝑎)(𝑆‘𝑦) = (𝑆‘𝑎))
13	12	r19.21bi 3256	. . . 4 ⊢ (((𝜑 ∧ 𝑎 ∈ 𝑇) ∧ 𝑦 ∈ (𝐴‘𝑎)) → (𝑆‘𝑦) = (𝑆‘𝑎))
14		fvex 6895	. . . . 5 ⊢ (𝑆‘𝑎) ∈ V
15	14	elsn2 4629	. . . 4 ⊢ ((𝑆‘𝑦) ∈ {(𝑆‘𝑎)} ↔ (𝑆‘𝑦) = (𝑆‘𝑎))
16	13, 15	sylibr 237	. . 3 ⊢ (((𝜑 ∧ 𝑎 ∈ 𝑇) ∧ 𝑦 ∈ (𝐴‘𝑎)) → (𝑆‘𝑦) ∈ {(𝑆‘𝑎)})
17	1, 4, 16	funimassd 6948	. 2 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝑇) → (𝑆 “ (𝐴‘𝑎)) ⊆ {(𝑆‘𝑎)})
18		tmach.finalph	. . . . 5 ⊢ (𝜑 → 𝑈 ∈ Fin)
19		tmach.exindex	. . . . 5 ⊢ (𝜑 → 𝐼 ∈ V)
20		tmach.tapelist	. . . . 5 ⊢ (𝜑 → 𝑇 = (𝑈 ↑m 𝐼))
21		tmach.agreemap	. . . . 5 ⊢ (𝜑 → 𝐴 = (𝑧 ∈ 𝑇 ↦ {𝑦 ∈ 𝑇 ∣ (𝑦 ↾ (𝑆‘𝑧)) = (𝑧 ↾ (𝑆‘𝑧))}))
22	18, 19, 20, 2, 21, 5	tmachlem-agreeself 47749	. . . 4 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝑇) → 𝑎 ∈ (𝐴‘𝑎))
23	2	fdmd 6717	. . . . . . 7 ⊢ (𝜑 → dom 𝑆 = 𝑇)
24	23	eleq2d 2848	. . . . . 6 ⊢ (𝜑 → (𝑎 ∈ dom 𝑆 ↔ 𝑎 ∈ 𝑇))
25	24	biimpar 483	. . . . 5 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝑇) → 𝑎 ∈ dom 𝑆)
26		funfvima 7232	. . . . 5 ⊢ ((Fun 𝑆 ∧ 𝑎 ∈ dom 𝑆) → (𝑎 ∈ (𝐴‘𝑎) → (𝑆‘𝑎) ∈ (𝑆 “ (𝐴‘𝑎))))
27	4, 25, 26	syl2anc 596	. . . 4 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝑇) → (𝑎 ∈ (𝐴‘𝑎) → (𝑆‘𝑎) ∈ (𝑆 “ (𝐴‘𝑎))))
28	22, 27	mpd 16	. . 3 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝑇) → (𝑆‘𝑎) ∈ (𝑆 “ (𝐴‘𝑎)))
29	28	snssd 4750	. 2 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝑇) → {(𝑆‘𝑎)} ⊆ (𝑆 “ (𝐴‘𝑎)))
30	17, 29	eqssd 3951	1 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝑇) → (𝑆 “ (𝐴‘𝑎)) = {(𝑆‘𝑎)})

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2145  ∀wral 3078  {crab 3414  Vcvv 3453   ∩ cin 3901  𝒫 cpw 4560  {csn 4587   ↦ cmpt 5190  dom cdm 5659   ↾ cres 5661   “ cima 5662  Fun wfun 6531  ⟶wf 6533  ‘cfv 6537  (class class class)co 7416   ↑_m cmap 8829  Fincfn 8955

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 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2215  ax-ext 2734  ax-sep 5255  ax-nul 5267  ax-pr 5402

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-ral 3079  df-rex 3089  df-rab 3415  df-v 3455  df-sbc 3743  df-csb 3851  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4283  df-if 4486  df-sn 4588  df-pr 4590  df-op 4594  df-uni 4871  df-br 5108  df-opab 5172  df-mpt 5191  df-id 5554  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-rn 5670  df-res 5671  df-ima 5672  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-fv 6545  df-ov 7419

This theorem is used by:  tmachlem-agreefin  47761