MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  fin23lem29 Structured version   Visualization version   GIF version

Theorem fin23lem29 10028
Description: Lemma for fin23 10076. 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
StepHypRef Expression
1 fin23lem.e . 2 𝑍 = if(𝑃 ∈ Fin, (𝑡𝑅), ((𝑧𝑃 ↦ ((𝑡𝑧) ∖ ran 𝑈)) ∘ 𝑄))
2 eqif 4497 . . 3 (𝑍 = if(𝑃 ∈ Fin, (𝑡𝑅), ((𝑧𝑃 ↦ ((𝑡𝑧) ∖ ran 𝑈)) ∘ 𝑄)) ↔ ((𝑃 ∈ Fin ∧ 𝑍 = (𝑡𝑅)) ∨ (¬ 𝑃 ∈ Fin ∧ 𝑍 = ((𝑧𝑃 ↦ ((𝑡𝑧) ∖ ran 𝑈)) ∘ 𝑄))))
32biimpi 215 . 2 (𝑍 = if(𝑃 ∈ Fin, (𝑡𝑅), ((𝑧𝑃 ↦ ((𝑡𝑧) ∖ ran 𝑈)) ∘ 𝑄)) → ((𝑃 ∈ Fin ∧ 𝑍 = (𝑡𝑅)) ∨ (¬ 𝑃 ∈ Fin ∧ 𝑍 = ((𝑧𝑃 ↦ ((𝑡𝑧) ∖ ran 𝑈)) ∘ 𝑄))))
4 rneq 5834 . . . . . 6 (𝑍 = (𝑡𝑅) → ran 𝑍 = ran (𝑡𝑅))
54unieqd 4850 . . . . 5 (𝑍 = (𝑡𝑅) → ran 𝑍 = ran (𝑡𝑅))
6 rncoss 5870 . . . . . 6 ran (𝑡𝑅) ⊆ ran 𝑡
76unissi 4845 . . . . 5 ran (𝑡𝑅) ⊆ ran 𝑡
85, 7eqsstrdi 3971 . . . 4 (𝑍 = (𝑡𝑅) → ran 𝑍 ran 𝑡)
98adantl 481 . . 3 ((𝑃 ∈ Fin ∧ 𝑍 = (𝑡𝑅)) → ran 𝑍 ran 𝑡)
10 rneq 5834 . . . . . 6 (𝑍 = ((𝑧𝑃 ↦ ((𝑡𝑧) ∖ ran 𝑈)) ∘ 𝑄) → ran 𝑍 = ran ((𝑧𝑃 ↦ ((𝑡𝑧) ∖ ran 𝑈)) ∘ 𝑄))
1110unieqd 4850 . . . . 5 (𝑍 = ((𝑧𝑃 ↦ ((𝑡𝑧) ∖ ran 𝑈)) ∘ 𝑄) → ran 𝑍 = ran ((𝑧𝑃 ↦ ((𝑡𝑧) ∖ ran 𝑈)) ∘ 𝑄))
12 rncoss 5870 . . . . . . 7 ran ((𝑧𝑃 ↦ ((𝑡𝑧) ∖ ran 𝑈)) ∘ 𝑄) ⊆ ran (𝑧𝑃 ↦ ((𝑡𝑧) ∖ ran 𝑈))
1312unissi 4845 . . . . . 6 ran ((𝑧𝑃 ↦ ((𝑡𝑧) ∖ ran 𝑈)) ∘ 𝑄) ⊆ ran (𝑧𝑃 ↦ ((𝑡𝑧) ∖ ran 𝑈))
14 unissb 4870 . . . . . . 7 ( ran (𝑧𝑃 ↦ ((𝑡𝑧) ∖ ran 𝑈)) ⊆ ran 𝑡 ↔ ∀𝑎 ∈ ran (𝑧𝑃 ↦ ((𝑡𝑧) ∖ ran 𝑈))𝑎 ran 𝑡)
15 abid 2719 . . . . . . . . 9 (𝑎 ∈ {𝑎 ∣ ∃𝑧𝑃 𝑎 = ((𝑡𝑧) ∖ ran 𝑈)} ↔ ∃𝑧𝑃 𝑎 = ((𝑡𝑧) ∖ ran 𝑈))
16 fvssunirn 6785 . . . . . . . . . . . . 13 (𝑡𝑧) ⊆ ran 𝑡
1716a1i 11 . . . . . . . . . . . 12 (𝑧𝑃 → (𝑡𝑧) ⊆ ran 𝑡)
1817ssdifssd 4073 . . . . . . . . . . 11 (𝑧𝑃 → ((𝑡𝑧) ∖ ran 𝑈) ⊆ ran 𝑡)
19 sseq1 3942 . . . . . . . . . . 11 (𝑎 = ((𝑡𝑧) ∖ ran 𝑈) → (𝑎 ran 𝑡 ↔ ((𝑡𝑧) ∖ ran 𝑈) ⊆ ran 𝑡))
2018, 19syl5ibrcom 246 . . . . . . . . . 10 (𝑧𝑃 → (𝑎 = ((𝑡𝑧) ∖ ran 𝑈) → 𝑎 ran 𝑡))
2120rexlimiv 3208 . . . . . . . . 9 (∃𝑧𝑃 𝑎 = ((𝑡𝑧) ∖ ran 𝑈) → 𝑎 ran 𝑡)
2215, 21sylbi 216 . . . . . . . 8 (𝑎 ∈ {𝑎 ∣ ∃𝑧𝑃 𝑎 = ((𝑡𝑧) ∖ ran 𝑈)} → 𝑎 ran 𝑡)
23 eqid 2738 . . . . . . . . 9 (𝑧𝑃 ↦ ((𝑡𝑧) ∖ ran 𝑈)) = (𝑧𝑃 ↦ ((𝑡𝑧) ∖ ran 𝑈))
2423rnmpt 5853 . . . . . . . 8 ran (𝑧𝑃 ↦ ((𝑡𝑧) ∖ ran 𝑈)) = {𝑎 ∣ ∃𝑧𝑃 𝑎 = ((𝑡𝑧) ∖ ran 𝑈)}
2522, 24eleq2s 2857 . . . . . . 7 (𝑎 ∈ ran (𝑧𝑃 ↦ ((𝑡𝑧) ∖ ran 𝑈)) → 𝑎 ran 𝑡)
2614, 25mprgbir 3078 . . . . . 6 ran (𝑧𝑃 ↦ ((𝑡𝑧) ∖ ran 𝑈)) ⊆ ran 𝑡
2713, 26sstri 3926 . . . . 5 ran ((𝑧𝑃 ↦ ((𝑡𝑧) ∖ ran 𝑈)) ∘ 𝑄) ⊆ ran 𝑡
2811, 27eqsstrdi 3971 . . . 4 (𝑍 = ((𝑧𝑃 ↦ ((𝑡𝑧) ∖ ran 𝑈)) ∘ 𝑄) → ran 𝑍 ran 𝑡)
2928adantl 481 . . 3 ((¬ 𝑃 ∈ Fin ∧ 𝑍 = ((𝑧𝑃 ↦ ((𝑡𝑧) ∖ ran 𝑈)) ∘ 𝑄)) → ran 𝑍 ran 𝑡)
309, 29jaoi 853 . 2 (((𝑃 ∈ Fin ∧ 𝑍 = (𝑡𝑅)) ∨ (¬ 𝑃 ∈ Fin ∧ 𝑍 = ((𝑧𝑃 ↦ ((𝑡𝑧) ∖ ran 𝑈)) ∘ 𝑄))) → ran 𝑍 ran 𝑡)
311, 3, 30mp2b 10 1 ran 𝑍 ran 𝑡
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wa 395  wo 843   = wceq 1539  wcel 2108  {cab 2715  wral 3063  wrex 3064  {crab 3067  Vcvv 3422  cdif 3880  cin 3882  wss 3883  c0 4253  ifcif 4456  𝒫 cpw 4530   cuni 4836   cint 4876   class class class wbr 5070  cmpt 5153  ran crn 5581  ccom 5584  suc csuc 6253  cfv 6418  crio 7211  (class class class)co 7255  cmpo 7257  ωcom 7687  seqωcseqom 8248  m cmap 8573  cen 8688  Fincfn 8691
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1799  ax-4 1813  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2110  ax-9 2118  ax-10 2139  ax-11 2156  ax-12 2173  ax-ext 2709  ax-sep 5218  ax-nul 5225  ax-pr 5347
This theorem depends on definitions:  df-bi 206  df-an 396  df-or 844  df-3an 1087  df-tru 1542  df-fal 1552  df-ex 1784  df-nf 1788  df-sb 2069  df-mo 2540  df-eu 2569  df-clab 2716  df-cleq 2730  df-clel 2817  df-nfc 2888  df-ne 2943  df-ral 3068  df-rex 3069  df-rab 3072  df-v 3424  df-dif 3886  df-un 3888  df-in 3890  df-ss 3900  df-nul 4254  df-if 4457  df-sn 4559  df-pr 4561  df-op 4565  df-uni 4837  df-br 5071  df-opab 5133  df-mpt 5154  df-cnv 5588  df-co 5589  df-dm 5590  df-rn 5591  df-iota 6376  df-fv 6426
This theorem is referenced by:  fin23lem31  10030
  Copyright terms: Public domain W3C validator