Theorem fin23lem29 10263

Description: Lemma for fin23 10311. The residual is built from the same elements as the previous sequence. (Contributed by Stefan O'Rear, 2-Nov-2014.)

Hypotheses

Ref	Expression
fin23lem.a	⊢ 𝑈 = seqω((𝑖 ∈ ω, 𝑢 ∈ V ↦ if(((𝑡‘𝑖) ∩ 𝑢) = ∅, 𝑢, ((𝑡‘𝑖) ∩ 𝑢))), ∪ ran 𝑡)
fin23lem17.f	⊢ 𝐹 = {𝑔 ∣ ∀𝑎 ∈ (𝒫 𝑔 ↑m ω)(∀𝑥 ∈ ω (𝑎‘suc 𝑥) ⊆ (𝑎‘𝑥) → ∩ ran 𝑎 ∈ ran 𝑎)}
fin23lem.b	⊢ 𝑃 = {𝑣 ∈ ω ∣ ∩ ran 𝑈 ⊆ (𝑡‘𝑣)}
fin23lem.c	⊢ 𝑄 = (𝑤 ∈ ω ↦ (℩𝑥 ∈ 𝑃 (𝑥 ∩ 𝑃) ≈ 𝑤))
fin23lem.d	⊢ 𝑅 = (𝑤 ∈ ω ↦ (℩𝑥 ∈ (ω ∖ 𝑃)(𝑥 ∩ (ω ∖ 𝑃)) ≈ 𝑤))
fin23lem.e	⊢ 𝑍 = if(𝑃 ∈ Fin, (𝑡 ∘ 𝑅), ((𝑧 ∈ 𝑃 ↦ ((𝑡‘𝑧) ∖ ∩ ran 𝑈)) ∘ 𝑄))

Assertion

Ref	Expression
fin23lem29	⊢ ∪ ran 𝑍 ⊆ ∪ ran 𝑡

Distinct variable groups:   𝑔,𝑖,𝑡,𝑢,𝑣,𝑥,𝑧,𝑎   𝐹,𝑎,𝑡   𝑤,𝑎,𝑥,𝑧,𝑃   𝑣,𝑎,𝑅,𝑖,𝑢   𝑈,𝑎,𝑖,𝑢,𝑣,𝑧   𝑍,𝑎   𝑔,𝑎

Allowed substitution hints:   𝑃(𝑣,𝑢,𝑡,𝑔,𝑖)   𝑄(𝑥,𝑧,𝑤,𝑣,𝑢,𝑡,𝑔,𝑖,𝑎)   𝑅(𝑥,𝑧,𝑤,𝑡,𝑔)   𝑈(𝑥,𝑤,𝑡,𝑔)   𝐹(𝑥,𝑧,𝑤,𝑣,𝑢,𝑔,𝑖)   𝑍(𝑥,𝑧,𝑤,𝑣,𝑢,𝑡,𝑔,𝑖)

Proof of Theorem fin23lem29

Step	Hyp	Ref	Expression
1		fin23lem.e	. 2 ⊢ 𝑍 = if(𝑃 ∈ Fin, (𝑡 ∘ 𝑅), ((𝑧 ∈ 𝑃 ↦ ((𝑡‘𝑧) ∖ ∩ ran 𝑈)) ∘ 𝑄))
2		eqif 4523	. . 3 ⊢ (𝑍 = if(𝑃 ∈ Fin, (𝑡 ∘ 𝑅), ((𝑧 ∈ 𝑃 ↦ ((𝑡‘𝑧) ∖ ∩ ran 𝑈)) ∘ 𝑄)) ↔ ((𝑃 ∈ Fin ∧ 𝑍 = (𝑡 ∘ 𝑅)) ∨ (¬ 𝑃 ∈ Fin ∧ 𝑍 = ((𝑧 ∈ 𝑃 ↦ ((𝑡‘𝑧) ∖ ∩ ran 𝑈)) ∘ 𝑄))))
3	2	biimpi 216	. 2 ⊢ (𝑍 = if(𝑃 ∈ Fin, (𝑡 ∘ 𝑅), ((𝑧 ∈ 𝑃 ↦ ((𝑡‘𝑧) ∖ ∩ ran 𝑈)) ∘ 𝑄)) → ((𝑃 ∈ Fin ∧ 𝑍 = (𝑡 ∘ 𝑅)) ∨ (¬ 𝑃 ∈ Fin ∧ 𝑍 = ((𝑧 ∈ 𝑃 ↦ ((𝑡‘𝑧) ∖ ∩ ran 𝑈)) ∘ 𝑄))))
4		rneq 5893	. . . . . 6 ⊢ (𝑍 = (𝑡 ∘ 𝑅) → ran 𝑍 = ran (𝑡 ∘ 𝑅))
5	4	unieqd 4878	. . . . 5 ⊢ (𝑍 = (𝑡 ∘ 𝑅) → ∪ ran 𝑍 = ∪ ran (𝑡 ∘ 𝑅))
6		rncoss 5934	. . . . . 6 ⊢ ran (𝑡 ∘ 𝑅) ⊆ ran 𝑡
7	6	unissi 4874	. . . . 5 ⊢ ∪ ran (𝑡 ∘ 𝑅) ⊆ ∪ ran 𝑡
8	5, 7	eqsstrdi 3980	. . . 4 ⊢ (𝑍 = (𝑡 ∘ 𝑅) → ∪ ran 𝑍 ⊆ ∪ ran 𝑡)
9	8	adantl 481	. . 3 ⊢ ((𝑃 ∈ Fin ∧ 𝑍 = (𝑡 ∘ 𝑅)) → ∪ ran 𝑍 ⊆ ∪ ran 𝑡)
10		rneq 5893	. . . . . 6 ⊢ (𝑍 = ((𝑧 ∈ 𝑃 ↦ ((𝑡‘𝑧) ∖ ∩ ran 𝑈)) ∘ 𝑄) → ran 𝑍 = ran ((𝑧 ∈ 𝑃 ↦ ((𝑡‘𝑧) ∖ ∩ ran 𝑈)) ∘ 𝑄))
11	10	unieqd 4878	. . . . 5 ⊢ (𝑍 = ((𝑧 ∈ 𝑃 ↦ ((𝑡‘𝑧) ∖ ∩ ran 𝑈)) ∘ 𝑄) → ∪ ran 𝑍 = ∪ ran ((𝑧 ∈ 𝑃 ↦ ((𝑡‘𝑧) ∖ ∩ ran 𝑈)) ∘ 𝑄))
12		rncoss 5934	. . . . . . 7 ⊢ ran ((𝑧 ∈ 𝑃 ↦ ((𝑡‘𝑧) ∖ ∩ ran 𝑈)) ∘ 𝑄) ⊆ ran (𝑧 ∈ 𝑃 ↦ ((𝑡‘𝑧) ∖ ∩ ran 𝑈))
13	12	unissi 4874	. . . . . 6 ⊢ ∪ ran ((𝑧 ∈ 𝑃 ↦ ((𝑡‘𝑧) ∖ ∩ ran 𝑈)) ∘ 𝑄) ⊆ ∪ ran (𝑧 ∈ 𝑃 ↦ ((𝑡‘𝑧) ∖ ∩ ran 𝑈))
14		unissb 4898	. . . . . . 7 ⊢ (∪ ran (𝑧 ∈ 𝑃 ↦ ((𝑡‘𝑧) ∖ ∩ ran 𝑈)) ⊆ ∪ ran 𝑡 ↔ ∀𝑎 ∈ ran (𝑧 ∈ 𝑃 ↦ ((𝑡‘𝑧) ∖ ∩ ran 𝑈))𝑎 ⊆ ∪ ran 𝑡)
15		abid 2719	. . . . . . . . 9 ⊢ (𝑎 ∈ {𝑎 ∣ ∃𝑧 ∈ 𝑃 𝑎 = ((𝑡‘𝑧) ∖ ∩ ran 𝑈)} ↔ ∃𝑧 ∈ 𝑃 𝑎 = ((𝑡‘𝑧) ∖ ∩ ran 𝑈))
16		fvssunirn 6873	. . . . . . . . . . . . 13 ⊢ (𝑡‘𝑧) ⊆ ∪ ran 𝑡
17	16	a1i 11	. . . . . . . . . . . 12 ⊢ (𝑧 ∈ 𝑃 → (𝑡‘𝑧) ⊆ ∪ ran 𝑡)
18	17	ssdifssd 4101	. . . . . . . . . . 11 ⊢ (𝑧 ∈ 𝑃 → ((𝑡‘𝑧) ∖ ∩ ran 𝑈) ⊆ ∪ ran 𝑡)
19		sseq1 3961	. . . . . . . . . . 11 ⊢ (𝑎 = ((𝑡‘𝑧) ∖ ∩ ran 𝑈) → (𝑎 ⊆ ∪ ran 𝑡 ↔ ((𝑡‘𝑧) ∖ ∩ ran 𝑈) ⊆ ∪ ran 𝑡))
20	18, 19	syl5ibrcom 247	. . . . . . . . . 10 ⊢ (𝑧 ∈ 𝑃 → (𝑎 = ((𝑡‘𝑧) ∖ ∩ ran 𝑈) → 𝑎 ⊆ ∪ ran 𝑡))
21	20	rexlimiv 3132	. . . . . . . . 9 ⊢ (∃𝑧 ∈ 𝑃 𝑎 = ((𝑡‘𝑧) ∖ ∩ ran 𝑈) → 𝑎 ⊆ ∪ ran 𝑡)
22	15, 21	sylbi 217	. . . . . . . 8 ⊢ (𝑎 ∈ {𝑎 ∣ ∃𝑧 ∈ 𝑃 𝑎 = ((𝑡‘𝑧) ∖ ∩ ran 𝑈)} → 𝑎 ⊆ ∪ ran 𝑡)
23		eqid 2737	. . . . . . . . 9 ⊢ (𝑧 ∈ 𝑃 ↦ ((𝑡‘𝑧) ∖ ∩ ran 𝑈)) = (𝑧 ∈ 𝑃 ↦ ((𝑡‘𝑧) ∖ ∩ ran 𝑈))
24	23	rnmpt 5914	. . . . . . . 8 ⊢ ran (𝑧 ∈ 𝑃 ↦ ((𝑡‘𝑧) ∖ ∩ ran 𝑈)) = {𝑎 ∣ ∃𝑧 ∈ 𝑃 𝑎 = ((𝑡‘𝑧) ∖ ∩ ran 𝑈)}
25	22, 24	eleq2s 2855	. . . . . . 7 ⊢ (𝑎 ∈ ran (𝑧 ∈ 𝑃 ↦ ((𝑡‘𝑧) ∖ ∩ ran 𝑈)) → 𝑎 ⊆ ∪ ran 𝑡)
26	14, 25	mprgbir 3059	. . . . . 6 ⊢ ∪ ran (𝑧 ∈ 𝑃 ↦ ((𝑡‘𝑧) ∖ ∩ ran 𝑈)) ⊆ ∪ ran 𝑡
27	13, 26	sstri 3945	. . . . 5 ⊢ ∪ ran ((𝑧 ∈ 𝑃 ↦ ((𝑡‘𝑧) ∖ ∩ ran 𝑈)) ∘ 𝑄) ⊆ ∪ ran 𝑡
28	11, 27	eqsstrdi 3980	. . . 4 ⊢ (𝑍 = ((𝑧 ∈ 𝑃 ↦ ((𝑡‘𝑧) ∖ ∩ ran 𝑈)) ∘ 𝑄) → ∪ ran 𝑍 ⊆ ∪ ran 𝑡)
29	28	adantl 481	. . 3 ⊢ ((¬ 𝑃 ∈ Fin ∧ 𝑍 = ((𝑧 ∈ 𝑃 ↦ ((𝑡‘𝑧) ∖ ∩ ran 𝑈)) ∘ 𝑄)) → ∪ ran 𝑍 ⊆ ∪ ran 𝑡)
30	9, 29	jaoi 858	. 2 ⊢ (((𝑃 ∈ Fin ∧ 𝑍 = (𝑡 ∘ 𝑅)) ∨ (¬ 𝑃 ∈ Fin ∧ 𝑍 = ((𝑧 ∈ 𝑃 ↦ ((𝑡‘𝑧) ∖ ∩ ran 𝑈)) ∘ 𝑄))) → ∪ ran 𝑍 ⊆ ∪ ran 𝑡)
31	1, 3, 30	mp2b 10	1 ⊢ ∪ ran 𝑍 ⊆ ∪ ran 𝑡

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 395   ∨ wo 848   = wceq 1542   ∈ wcel 2114  {cab 2715  ∀wral 3052  ∃wrex 3062  {crab 3401  Vcvv 3442   ∖ cdif 3900   ∩ cin 3902   ⊆ wss 3903  ∅c0 4287  ifcif 4481  𝒫 cpw 4556  ∪ cuni 4865  ∩ cint 4904   class class class wbr 5100   ↦ cmpt 5181  ran crn 5633   ∘ ccom 5636  suc csuc 6327  ‘cfv 6500  ℩crio 7324  (class class class)co 7368   ∈ cmpo 7370  ωcom 7818  seq_ωcseqom 8388   ↑_m cmap 8775   ≈ cen 8892  Fincfn 8895

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-sep 5243  ax-nul 5253  ax-pr 5379

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-ral 3053  df-rex 3063  df-rab 3402  df-v 3444  df-dif 3906  df-un 3908  df-in 3910  df-ss 3920  df-nul 4288  df-if 4482  df-sn 4583  df-pr 4585  df-op 4589  df-uni 4866  df-br 5101  df-opab 5163  df-mpt 5182  df-cnv 5640  df-co 5641  df-dm 5642  df-rn 5643  df-iota 6456  df-fv 6508

This theorem is referenced by:  fin23lem31  10265