Users' Mathboxes Mathbox for Ender Ting < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  tmachlem-agreesn Structured version   Visualization version   GIF version

Theorem tmachlem-agreesn 48290
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
StepHypRef Expression
1 nfv 1951 . . 3 Ⅎ𝑦(𝜑 ∧ 𝑎 ∈ 𝑇)
2 tmach.scanmap . . . . 5 (𝜑 → 𝑆:𝑇⟶(𝒫 𝐼 ∩ Fin))
32ffund 6743 . . . 4 (𝜑 → Fun 𝑆)
43adantr 486 . . 3 ((𝜑 ∧ 𝑎 ∈ 𝑇) → Fun 𝑆)
5 tmach.agreement . . . . . . 7 (𝜑 → ∀𝑧 ∈ 𝑇 ∀𝑦 ∈ (𝐴‘𝑧)(𝑆‘𝑦) = (𝑆‘𝑧))
6 fveq2 6915 . . . . . . . . 9 (𝑧 = 𝑎 → (𝐴‘𝑧) = (𝐴‘𝑎))
7 fveq2 6915 . . . . . . . . . 10 (𝑧 = 𝑎 → (𝑆‘𝑧) = (𝑆‘𝑎))
87eqeq2d 2777 . . . . . . . . 9 (𝑧 = 𝑎 → ((𝑆‘𝑦) = (𝑆‘𝑧) ↔ (𝑆‘𝑦) = (𝑆‘𝑎)))
96, 8raleqbidv 3338 . . . . . . . 8 (𝑧 = 𝑎 → (∀𝑦 ∈ (𝐴‘𝑧)(𝑆‘𝑦) = (𝑆‘𝑧) ↔ ∀𝑦 ∈ (𝐴‘𝑎)(𝑆‘𝑦) = (𝑆‘𝑎)))
109cbvralvw 3244 . . . . . . 7 (∀𝑧 ∈ 𝑇 ∀𝑦 ∈ (𝐴‘𝑧)(𝑆‘𝑦) = (𝑆‘𝑧) ↔ ∀𝑎 ∈ 𝑇 ∀𝑦 ∈ (𝐴‘𝑎)(𝑆‘𝑦) = (𝑆‘𝑎))
115, 10sylib 221 . . . . . 6 (𝜑 → ∀𝑎 ∈ 𝑇 ∀𝑦 ∈ (𝐴‘𝑎)(𝑆‘𝑦) = (𝑆‘𝑎))
1211r19.21bi 3258 . . . . 5 ((𝜑 ∧ 𝑎 ∈ 𝑇) → ∀𝑦 ∈ (𝐴‘𝑎)(𝑆‘𝑦) = (𝑆‘𝑎))
1312r19.21bi 3258 . . . 4 (((𝜑 ∧ 𝑎 ∈ 𝑇) ∧ 𝑦 ∈ (𝐴‘𝑎)) → (𝑆‘𝑦) = (𝑆‘𝑎))
14 fvex 6928 . . . . 5 (𝑆‘𝑎) ∈ V
1514elsn2 4626 . . . 4 ((𝑆‘𝑦) ∈ {(𝑆‘𝑎)} ↔ (𝑆‘𝑦) = (𝑆‘𝑎))
1613, 15sylibr 237 . . 3 (((𝜑 ∧ 𝑎 ∈ 𝑇) ∧ 𝑦 ∈ (𝐴‘𝑎)) → (𝑆‘𝑦) ∈ {(𝑆‘𝑎)})
171, 4, 16funimassd 6981 . 2 ((𝜑 ∧ 𝑎 ∈ 𝑇) → (𝑆 “ (𝐴‘𝑎)) ⊆ {(𝑆‘𝑎)})
18 tmach.finalph . . . . 5 (𝜑 → 𝑈 ∈ Fin)
19 tmach.exindex . . . . 5 (𝜑 → 𝐼 ∈ V)
20 tmach.tapelist . . . . 5 (𝜑 → 𝑇 = (𝑈 ↑m 𝐼))
21 tmach.agreemap . . . . 5 (𝜑 → 𝐴 = (𝑧 ∈ 𝑇 ↦ {𝑦 ∈ 𝑇 ∣ (𝑦 ↾ (𝑆‘𝑧)) = (𝑧 ↾ (𝑆‘𝑧))}))
2218, 19, 20, 2, 21, 5tmachlem-agreeself 48279 . . . 4 ((𝜑 ∧ 𝑎 ∈ 𝑇) → 𝑎 ∈ (𝐴‘𝑎))
232fdmd 6749 . . . . . . 7 (𝜑 → dom 𝑆 = 𝑇)
2423eleq2d 2853 . . . . . 6 (𝜑 → (𝑎 ∈ dom 𝑆 ↔ 𝑎 ∈ 𝑇))
2524biimpar 483 . . . . 5 ((𝜑 ∧ 𝑎 ∈ 𝑇) → 𝑎 ∈ dom 𝑆)
26 funfvima 7266 . . . . 5 ((Fun 𝑆 ∧ 𝑎 ∈ dom 𝑆) → (𝑎 ∈ (𝐴‘𝑎) → (𝑆‘𝑎) ∈ (𝑆 “ (𝐴‘𝑎))))
274, 25, 26syl2anc 596 . . . 4 ((𝜑 ∧ 𝑎 ∈ 𝑇) → (𝑎 ∈ (𝐴‘𝑎) → (𝑆‘𝑎) ∈ (𝑆 “ (𝐴‘𝑎))))
2822, 27mpd 16 . . 3 ((𝜑 ∧ 𝑎 ∈ 𝑇) → (𝑆‘𝑎) ∈ (𝑆 “ (𝐴‘𝑎)))
2928snssd 4748 . 2 ((𝜑 ∧ 𝑎 ∈ 𝑇) → {(𝑆‘𝑎)} ⊆ (𝑆 “ (𝐴‘𝑎)))
3017, 29eqssd 3929 1 ((𝜑 ∧ 𝑎 ∈ 𝑇) → (𝑆 “ (𝐴‘𝑎)) = {(𝑆‘𝑎)})
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1572   ∈ wcel 2150  ∀wral 3083  {crab 3415  Vcvv 3453   ∩ cin 4091  𝒫 cpw 4559  {csn 4587   ↦ cmpt 5191  dom cdm 5657   ↾ cres 5659   “ cima 5660  Fun wfun 6559  ⟶wf 6561  ‘cfv 6565  (class class class)co 7450   ↑m cmap 8884  Fincfn 9010
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1830  ax-4 1844  ax-5 1947  ax-6 2004  ax-7 2045  ax-8 2152  ax-9 2160  ax-10 2183  ax-11 2200  ax-12 2219  ax-ext 2738  ax-sep 5254  ax-nul 5265  ax-pr 5397
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1106  df-tru 1575  df-fal 1585  df-ex 1815  df-nf 1819  df-sb 2104  df-mo 2570  df-eu 2600  df-clab 2745  df-cleq 2758  df-clel 2842  df-nfc 2916  df-ne 2963  df-ral 3084  df-rex 3094  df-rab 3416  df-v 3455  df-sbc 3742  df-csb 3851  df-ss 3900  df-dif 4049  df-in 4093  df-un 4153  df-nul 4281  df-if 4485  df-sn 4588  df-pr 4590  df-op 4840  df-uni 4872  df-br 5108  df-opab 5173  df-mpt 5192  df-id 5552  df-xp 5663  df-rel 5664  df-cnv 5665  df-co 5666  df-dm 5667  df-rn 5668  df-res 5669  df-ima 5670  df-iota 6519  df-fun 6567  df-fn 6568  df-f 6569  df-fv 6573  df-ov 7453
This theorem is used by:  tmachlem-agreefin  48291
  Copyright terms: Public domain W3C validator