Theorem tmachlem-uassst 47836

Description: Union of all agreement sets only includes tapes. (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-uassst	⊢ (𝜑 → ∪ ran 𝐴 ⊆ 𝑇)

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

Proof of Theorem tmachlem-uassst

Step	Hyp	Ref	Expression
1		tmach.agreemap	. . . . 5 ⊢ (𝜑 → 𝐴 = (𝑧 ∈ 𝑇 ↦ {𝑦 ∈ 𝑇 ∣ (𝑦 ↾ (𝑆‘𝑧)) = (𝑧 ↾ (𝑆‘𝑧))}))
2	1	rneqd 5924	. . . 4 ⊢ (𝜑 → ran 𝐴 = ran (𝑧 ∈ 𝑇 ↦ {𝑦 ∈ 𝑇 ∣ (𝑦 ↾ (𝑆‘𝑧)) = (𝑧 ↾ (𝑆‘𝑧))}))
3	2	unieqd 4880	. . 3 ⊢ (𝜑 → ∪ ran 𝐴 = ∪ ran (𝑧 ∈ 𝑇 ↦ {𝑦 ∈ 𝑇 ∣ (𝑦 ↾ (𝑆‘𝑧)) = (𝑧 ↾ (𝑆‘𝑧))}))
4		tmach.finalph	. . . . . . . 8 ⊢ (𝜑 → 𝑈 ∈ Fin)
5		tmach.exindex	. . . . . . . 8 ⊢ (𝜑 → 𝐼 ∈ V)
6		tmach.tapelist	. . . . . . . 8 ⊢ (𝜑 → 𝑇 = (𝑈 ↑m 𝐼))
7		tmach.scanmap	. . . . . . . 8 ⊢ (𝜑 → 𝑆:𝑇⟶(𝒫 𝐼 ∩ Fin))
8		tmach.agreement	. . . . . . . 8 ⊢ (𝜑 → ∀𝑧 ∈ 𝑇 ∀𝑦 ∈ (𝐴‘𝑧)(𝑆‘𝑦) = (𝑆‘𝑧))
9	4, 5, 6, 7, 1, 8	tmachlem-extapes 47827	. . . . . . 7 ⊢ (𝜑 → 𝑇 ∈ V)
10	9	adantr 486	. . . . . 6 ⊢ ((𝜑 ∧ 𝑧 ∈ 𝑇) → 𝑇 ∈ V)
11		ssrab2 4028	. . . . . . 7 ⊢ {𝑦 ∈ 𝑇 ∣ (𝑦 ↾ (𝑆‘𝑧)) = (𝑧 ↾ (𝑆‘𝑧))} ⊆ 𝑇
12	11	a1i 11	. . . . . 6 ⊢ ((𝜑 ∧ 𝑧 ∈ 𝑇) → {𝑦 ∈ 𝑇 ∣ (𝑦 ↾ (𝑆‘𝑧)) = (𝑧 ↾ (𝑆‘𝑧))} ⊆ 𝑇)
13	10, 12	ssexd 5289	. . . . 5 ⊢ ((𝜑 ∧ 𝑧 ∈ 𝑇) → {𝑦 ∈ 𝑇 ∣ (𝑦 ↾ (𝑆‘𝑧)) = (𝑧 ↾ (𝑆‘𝑧))} ∈ V)
14	13	ralrimiva 3154	. . . 4 ⊢ (𝜑 → ∀𝑧 ∈ 𝑇 {𝑦 ∈ 𝑇 ∣ (𝑦 ↾ (𝑆‘𝑧)) = (𝑧 ↾ (𝑆‘𝑧))} ∈ V)
15		dfiun3g 5954	. . . 4 ⊢ (∀𝑧 ∈ 𝑇 {𝑦 ∈ 𝑇 ∣ (𝑦 ↾ (𝑆‘𝑧)) = (𝑧 ↾ (𝑆‘𝑧))} ∈ V → ∪ 𝑧 ∈ 𝑇 {𝑦 ∈ 𝑇 ∣ (𝑦 ↾ (𝑆‘𝑧)) = (𝑧 ↾ (𝑆‘𝑧))} = ∪ ran (𝑧 ∈ 𝑇 ↦ {𝑦 ∈ 𝑇 ∣ (𝑦 ↾ (𝑆‘𝑧)) = (𝑧 ↾ (𝑆‘𝑧))}))
16	14, 15	syl 18	. . 3 ⊢ (𝜑 → ∪ 𝑧 ∈ 𝑇 {𝑦 ∈ 𝑇 ∣ (𝑦 ↾ (𝑆‘𝑧)) = (𝑧 ↾ (𝑆‘𝑧))} = ∪ ran (𝑧 ∈ 𝑇 ↦ {𝑦 ∈ 𝑇 ∣ (𝑦 ↾ (𝑆‘𝑧)) = (𝑧 ↾ (𝑆‘𝑧))}))
17	3, 16	eqtr4d 2798	. 2 ⊢ (𝜑 → ∪ ran 𝐴 = ∪ 𝑧 ∈ 𝑇 {𝑦 ∈ 𝑇 ∣ (𝑦 ↾ (𝑆‘𝑧)) = (𝑧 ↾ (𝑆‘𝑧))})
18	12	iunssd 5009	. 2 ⊢ (𝜑 → ∪ 𝑧 ∈ 𝑇 {𝑦 ∈ 𝑇 ∣ (𝑦 ↾ (𝑆‘𝑧)) = (𝑧 ↾ (𝑆‘𝑧))} ⊆ 𝑇)
19	17, 18	eqsstrd 3965	1 ⊢ (𝜑 → ∪ ran 𝐴 ⊆ 𝑇)

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2145  ∀wral 3076  {crab 3412  Vcvv 3450   ∩ cin 3898   ⊆ wss 3899  𝒫 cpw 4557  ∪ cuni 4867  ∪ ciun 4951   ↦ cmpt 5186  ran crn 5656   ↾ cres 5657  ⟶wf 6531  ‘cfv 6535  (class class class)co 7416   ↑_m cmap 8833  Fincfn 8959

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 2213  ax-ext 2732  ax-sep 5251  ax-nul 5263  ax-pr 5398

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 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-cnv 5663  df-dm 5665  df-rn 5666  df-iota 6491  df-fv 6543  df-ov 7419

This theorem is used by:  tmachlem-exlargecover  47837