Theorem tmachlem-exagreecover 48159

Description: Particular properties of the finite cover of agreesets. (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-exagreecover	⊢ (𝜑 → ∃𝑎(𝑎 ⊆ ran 𝐴 ∧ 𝑎 ∈ Fin ∧ 𝑇 = ∪ 𝑎))

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

Proof of Theorem tmachlem-exagreecover

Dummy variable 𝑖 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		tmach.finalph	. . . 4 ⊢ (𝜑 → 𝑈 ∈ Fin)
2		tmach.exindex	. . . 4 ⊢ (𝜑 → 𝐼 ∈ V)
3		tmach.tapelist	. . . 4 ⊢ (𝜑 → 𝑇 = (𝑈 ↑m 𝐼))
4		tmach.scanmap	. . . 4 ⊢ (𝜑 → 𝑆:𝑇⟶(𝒫 𝐼 ∩ Fin))
5		tmach.agreemap	. . . 4 ⊢ (𝜑 → 𝐴 = (𝑧 ∈ 𝑇 ↦ {𝑦 ∈ 𝑇 ∣ (𝑦 ↾ (𝑆‘𝑧)) = (𝑧 ↾ (𝑆‘𝑧))}))
6		tmach.agreement	. . . 4 ⊢ (𝜑 → ∀𝑧 ∈ 𝑇 ∀𝑦 ∈ (𝐴‘𝑧)(𝑆‘𝑦) = (𝑆‘𝑧))
7	1, 2, 3, 4, 5, 6	tmachlem-extpcover 48158	. . 3 ⊢ (𝜑 → ∃𝑎 ∈ (𝒫 ran 𝐴 ∩ Fin)∪ (∏t‘(𝑖 ∈ 𝐼 ↦ 𝒫 𝑈)) = ∪ 𝑎)
8		df-rex 3091	. . 3 ⊢ (∃𝑎 ∈ (𝒫 ran 𝐴 ∩ Fin)∪ (∏t‘(𝑖 ∈ 𝐼 ↦ 𝒫 𝑈)) = ∪ 𝑎 ↔ ∃𝑎(𝑎 ∈ (𝒫 ran 𝐴 ∩ Fin) ∧ ∪ (∏t‘(𝑖 ∈ 𝐼 ↦ 𝒫 𝑈)) = ∪ 𝑎))
9	7, 8	sylib 221	. 2 ⊢ (𝜑 → ∃𝑎(𝑎 ∈ (𝒫 ran 𝐴 ∩ Fin) ∧ ∪ (∏t‘(𝑖 ∈ 𝐼 ↦ 𝒫 𝑈)) = ∪ 𝑎))
10		simprl 783	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑎 ∈ (𝒫 ran 𝐴 ∩ Fin) ∧ ∪ (∏t‘(𝑖 ∈ 𝐼 ↦ 𝒫 𝑈)) = ∪ 𝑎)) → 𝑎 ∈ (𝒫 ran 𝐴 ∩ Fin))
11	10	elin1d 4104	. . . . . 6 ⊢ ((𝜑 ∧ (𝑎 ∈ (𝒫 ran 𝐴 ∩ Fin) ∧ ∪ (∏t‘(𝑖 ∈ 𝐼 ↦ 𝒫 𝑈)) = ∪ 𝑎)) → 𝑎 ∈ 𝒫 ran 𝐴)
12	11	elpwid 4569	. . . . 5 ⊢ ((𝜑 ∧ (𝑎 ∈ (𝒫 ran 𝐴 ∩ Fin) ∧ ∪ (∏t‘(𝑖 ∈ 𝐼 ↦ 𝒫 𝑈)) = ∪ 𝑎)) → 𝑎 ⊆ ran 𝐴)
13	10	elin2d 4105	. . . . 5 ⊢ ((𝜑 ∧ (𝑎 ∈ (𝒫 ran 𝐴 ∩ Fin) ∧ ∪ (∏t‘(𝑖 ∈ 𝐼 ↦ 𝒫 𝑈)) = ∪ 𝑎)) → 𝑎 ∈ Fin)
14	1, 2, 3, 4, 5, 6	tmachlem-tpbase 48152	. . . . . . 7 ⊢ (𝜑 → ∪ (∏t‘(𝑖 ∈ 𝐼 ↦ 𝒫 𝑈)) = 𝑇)
15	14	adantr 486	. . . . . 6 ⊢ ((𝜑 ∧ (𝑎 ∈ (𝒫 ran 𝐴 ∩ Fin) ∧ ∪ (∏t‘(𝑖 ∈ 𝐼 ↦ 𝒫 𝑈)) = ∪ 𝑎)) → ∪ (∏t‘(𝑖 ∈ 𝐼 ↦ 𝒫 𝑈)) = 𝑇)
16		simprr 785	. . . . . 6 ⊢ ((𝜑 ∧ (𝑎 ∈ (𝒫 ran 𝐴 ∩ Fin) ∧ ∪ (∏t‘(𝑖 ∈ 𝐼 ↦ 𝒫 𝑈)) = ∪ 𝑎)) → ∪ (∏t‘(𝑖 ∈ 𝐼 ↦ 𝒫 𝑈)) = ∪ 𝑎)
17	15, 16	eqtr3d 2800	. . . . 5 ⊢ ((𝜑 ∧ (𝑎 ∈ (𝒫 ran 𝐴 ∩ Fin) ∧ ∪ (∏t‘(𝑖 ∈ 𝐼 ↦ 𝒫 𝑈)) = ∪ 𝑎)) → 𝑇 = ∪ 𝑎)
18	12, 13, 17	3jca 1146	. . . 4 ⊢ ((𝜑 ∧ (𝑎 ∈ (𝒫 ran 𝐴 ∩ Fin) ∧ ∪ (∏t‘(𝑖 ∈ 𝐼 ↦ 𝒫 𝑈)) = ∪ 𝑎)) → (𝑎 ⊆ ran 𝐴 ∧ 𝑎 ∈ Fin ∧ 𝑇 = ∪ 𝑎))
19	18	ex 418	. . 3 ⊢ (𝜑 → ((𝑎 ∈ (𝒫 ran 𝐴 ∩ Fin) ∧ ∪ (∏t‘(𝑖 ∈ 𝐼 ↦ 𝒫 𝑈)) = ∪ 𝑎) → (𝑎 ⊆ ran 𝐴 ∧ 𝑎 ∈ Fin ∧ 𝑇 = ∪ 𝑎)))
20	19	eximdv 1952	. 2 ⊢ (𝜑 → (∃𝑎(𝑎 ∈ (𝒫 ran 𝐴 ∩ Fin) ∧ ∪ (∏t‘(𝑖 ∈ 𝐼 ↦ 𝒫 𝑈)) = ∪ 𝑎) → ∃𝑎(𝑎 ⊆ ran 𝐴 ∧ 𝑎 ∈ Fin ∧ 𝑇 = ∪ 𝑎)))
21	9, 20	mpd 16	1 ⊢ (𝜑 → ∃𝑎(𝑎 ⊆ ran 𝐴 ∧ 𝑎 ∈ Fin ∧ 𝑇 = ∪ 𝑎))

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∧ w3a 1103   = wceq 1570  ∃wex 1812   ∈ wcel 2147  ∀wral 3080  ∃wrex 3090  {crab 3416  Vcvv 3454   ⊆ wss 3900   ∩ cin 4092  𝒫 cpw 4560  ∪ cuni 4870   ↦ cmpt 5189  ran crn 5656   ↾ cres 5657  ⟶wf 6551  ‘cfv 6555  (class class class)co 7440   ↑_m cmap 8872  Fincfn 8998  ∏_tcpt 17635

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  ax-ac2 10565

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-nel 3066  df-ral 3081  df-rex 3091  df-rmo 3369  df-reu 3370  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-int 4911  df-iun 4956  df-iin 4957  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-se 5609  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-pred 6319  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-isom 6564  df-riota 7397  df-ov 7443  df-oprab 7444  df-mpo 7445  df-rpss 7760  df-om 7899  df-1st 8022  df-2nd 8023  df-frecs 8324  df-wrecs 8355  df-recs 8404  df-rdg 8443  df-1o 8501  df-2o 8502  df-oadd 8505  df-omul 8506  df-er 8742  df-map 8874  df-ixp 8951  df-en 8999  df-dom 9000  df-fin 9002  df-fi 9427  df-wdom 9583  df-dju 10006  df-card 10044  df-acn 10047  df-ac 10219  df-topgen 17640  df-pt 17641  df-fbas 21702  df-fg 21703  df-top 23239  df-topon 23256  df-bases 23291  df-cld 23364  df-ntr 23365  df-cls 23366  df-nei 23443  df-cmp 23732  df-fil 24192  df-ufil 24247  df-ufl 24248  df-flim 24285  df-fcls 24287

This theorem is used by:  tmachlem-franscan  48162