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

Theorem tmachlem-agreeself 48279
Description: Any tape belongs to its own agreement set. (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-agreeself ((𝜑 ∧ 𝑎 ∈ 𝑇) → 𝑎 ∈ (𝐴‘𝑎))
Distinct variable groups:   𝑈,𝑎,𝑦,𝑧   𝐼,𝑎,𝑦,𝑧   𝜑,𝑎,𝑦,𝑧   𝑆,𝑎,𝑦,𝑧   𝐴,𝑎,𝑦,𝑧   𝑇,𝑎,𝑦,𝑧

Proof of Theorem tmachlem-agreeself
StepHypRef Expression
1 reseq1 5979 . . . 4 (𝑦 = 𝑎 → (𝑦 ↾ (𝑆‘𝑎)) = (𝑎 ↾ (𝑆‘𝑎)))
2 tbtru 1580 . . . 4 ((𝑦 ↾ (𝑆‘𝑎)) = (𝑎 ↾ (𝑆‘𝑎)) ↔ ((𝑦 ↾ (𝑆‘𝑎)) = (𝑎 ↾ (𝑆‘𝑎)) ↔ ⊤))
31, 2sylib 221 . . 3 (𝑦 = 𝑎 → ((𝑦 ↾ (𝑆‘𝑎)) = (𝑎 ↾ (𝑆‘𝑎)) ↔ ⊤))
4 simpr 490 . . 3 ((𝜑 ∧ 𝑎 ∈ 𝑇) → 𝑎 ∈ 𝑇)
5 trud 1582 . . 3 ((𝜑 ∧ 𝑎 ∈ 𝑇) → ⊤)
63, 4, 5elrabd 3649 . 2 ((𝜑 ∧ 𝑎 ∈ 𝑇) → 𝑎 ∈ {𝑦 ∈ 𝑇 ∣ (𝑦 ↾ (𝑆‘𝑎)) = (𝑎 ↾ (𝑆‘𝑎))})
7 fveq2 6915 . . . . . 6 (𝑧 = 𝑎 → (𝑆‘𝑧) = (𝑆‘𝑎))
87reseq2d 5985 . . . . 5 (𝑧 = 𝑎 → (𝑦 ↾ (𝑆‘𝑧)) = (𝑦 ↾ (𝑆‘𝑎)))
9 id 23 . . . . . 6 (𝑧 = 𝑎 → 𝑧 = 𝑎)
109, 7reseq12d 5986 . . . . 5 (𝑧 = 𝑎 → (𝑧 ↾ (𝑆‘𝑧)) = (𝑎 ↾ (𝑆‘𝑎)))
118, 10eqeq12d 2782 . . . 4 (𝑧 = 𝑎 → ((𝑦 ↾ (𝑆‘𝑧)) = (𝑧 ↾ (𝑆‘𝑧)) ↔ (𝑦 ↾ (𝑆‘𝑎)) = (𝑎 ↾ (𝑆‘𝑎))))
1211rabbidv 3422 . . 3 (𝑧 = 𝑎 → {𝑦 ∈ 𝑇 ∣ (𝑦 ↾ (𝑆‘𝑧)) = (𝑧 ↾ (𝑆‘𝑧))} = {𝑦 ∈ 𝑇 ∣ (𝑦 ↾ (𝑆‘𝑎)) = (𝑎 ↾ (𝑆‘𝑎))})
13 tmach.agreemap . . . 4 (𝜑 → 𝐴 = (𝑧 ∈ 𝑇 ↦ {𝑦 ∈ 𝑇 ∣ (𝑦 ↾ (𝑆‘𝑧)) = (𝑧 ↾ (𝑆‘𝑧))}))
1413adantr 486 . . 3 ((𝜑 ∧ 𝑎 ∈ 𝑇) → 𝐴 = (𝑧 ∈ 𝑇 ↦ {𝑦 ∈ 𝑇 ∣ (𝑦 ↾ (𝑆‘𝑧)) = (𝑧 ↾ (𝑆‘𝑧))}))
15 tmach.finalph . . . . . 6 (𝜑 → 𝑈 ∈ Fin)
16 tmach.exindex . . . . . 6 (𝜑 → 𝐼 ∈ V)
17 tmach.tapelist . . . . . 6 (𝜑 → 𝑇 = (𝑈 ↑m 𝐼))
18 tmach.scanmap . . . . . 6 (𝜑 → 𝑆:𝑇⟶(𝒫 𝐼 ∩ Fin))
19 tmach.agreement . . . . . 6 (𝜑 → ∀𝑧 ∈ 𝑇 ∀𝑦 ∈ (𝐴‘𝑧)(𝑆‘𝑦) = (𝑆‘𝑧))
2015, 16, 17, 18, 13, 19tmachlem-extapes 48277 . . . . 5 (𝜑 → 𝑇 ∈ V)
21 ssrab2 4007 . . . . . 6 {𝑦 ∈ 𝑇 ∣ (𝑦 ↾ (𝑆‘𝑎)) = (𝑎 ↾ (𝑆‘𝑎))} ⊆ 𝑇
2221a1i 11 . . . . 5 (𝜑 → {𝑦 ∈ 𝑇 ∣ (𝑦 ↾ (𝑆‘𝑎)) = (𝑎 ↾ (𝑆‘𝑎))} ⊆ 𝑇)
2320, 22ssexd 5292 . . . 4 (𝜑 → {𝑦 ∈ 𝑇 ∣ (𝑦 ↾ (𝑆‘𝑎)) = (𝑎 ↾ (𝑆‘𝑎))} ∈ V)
2423adantr 486 . . 3 ((𝜑 ∧ 𝑎 ∈ 𝑇) → {𝑦 ∈ 𝑇 ∣ (𝑦 ↾ (𝑆‘𝑎)) = (𝑎 ↾ (𝑆‘𝑎))} ∈ V)
2512, 14, 4, 24fvmptd4 7048 . 2 ((𝜑 ∧ 𝑎 ∈ 𝑇) → (𝐴‘𝑎) = {𝑦 ∈ 𝑇 ∣ (𝑦 ↾ (𝑆‘𝑎)) = (𝑎 ↾ (𝑆‘𝑎))})
266, 25eleqtrrd 2870 1 ((𝜑 ∧ 𝑎 ∈ 𝑇) → 𝑎 ∈ (𝐴‘𝑎))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1572  ⊤wtru 1573   ∈ wcel 2150  ∀wral 3083  {crab 3415  Vcvv 3453   ⊆ wss 3899   ∩ cin 4091  𝒫 cpw 4559   ↦ cmpt 5191   ↾ cres 5659  ⟶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-res 5669  df-iota 6519  df-fun 6567  df-fv 6573  df-ov 7453
This theorem is used by:  tmachlem-exlargecover  48287  tmachlem-agreesn  48290
  Copyright terms: Public domain W3C validator