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

Theorem fin23lem33 10447
Description: Lemma for fin23 10491. Discharge hypotheses. (Contributed by Stefan O'Rear, 2-Nov-2014.)
Hypothesis
Ref Expression
fin23lem33.f 𝐹 = {𝑔 ∣ ∀𝑎 ∈ (𝒫 𝑔 ↑m ω)(∀𝑥 ∈ ω (𝑎‘suc 𝑥) ⊆ (𝑎‘𝑥) → ∩ ran 𝑎 ∈ ran 𝑎)}
Assertion
Ref Expression
fin23lem33 (𝐺 ∈ 𝐹 → ∃𝑓∀𝑏((𝑏:ω⟶1-1V ∧ ∪ ran 𝑏 ⊆ 𝐺) → ((𝑓‘𝑏):ω⟶1-1V ∧ ∪ ran (𝑓‘𝑏) ⊊ ∪ ran 𝑏)))
Distinct variable groups:   𝑎,𝑏,𝑓,𝑔,𝑥,𝐺   𝐹,𝑎
Allowed substitution hints:   𝐹(𝑥, 𝑓, 𝑔, 𝑏)

Proof of Theorem fin23lem33
Dummy variables 𝑐 𝑑 𝑒 𝑖 𝑗 𝑘 𝑙 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 fveq2 6905 . . . . . . 7 (𝑗 = 𝑐 → (𝑒‘𝑗) = (𝑒‘𝑐))
21ineq1d 4119 . . . . . 6 (𝑗 = 𝑐 → ((𝑒‘𝑗) ∩ 𝑘) = ((𝑒‘𝑐) ∩ 𝑘))
32eqeq1d 2765 . . . . 5 (𝑗 = 𝑐 → (((𝑒‘𝑗) ∩ 𝑘) = ∅ ↔ ((𝑒‘𝑐) ∩ 𝑘) = ∅))
43, 2ifbieq2d 4512 . . . 4 (𝑗 = 𝑐 → if(((𝑒‘𝑗) ∩ 𝑘) = ∅, 𝑘, ((𝑒‘𝑗) ∩ 𝑘)) = if(((𝑒‘𝑐) ∩ 𝑘) = ∅, 𝑘, ((𝑒‘𝑐) ∩ 𝑘)))
5 ineq2 4114 . . . . . 6 (𝑘 = 𝑑 → ((𝑒‘𝑐) ∩ 𝑘) = ((𝑒‘𝑐) ∩ 𝑑))
65eqeq1d 2765 . . . . 5 (𝑘 = 𝑑 → (((𝑒‘𝑐) ∩ 𝑘) = ∅ ↔ ((𝑒‘𝑐) ∩ 𝑑) = ∅))
7 id 23 . . . . 5 (𝑘 = 𝑑 → 𝑘 = 𝑑)
86, 7, 5ifbieq12d 4514 . . . 4 (𝑘 = 𝑑 → if(((𝑒‘𝑐) ∩ 𝑘) = ∅, 𝑘, ((𝑒‘𝑐) ∩ 𝑘)) = if(((𝑒‘𝑐) ∩ 𝑑) = ∅, 𝑑, ((𝑒‘𝑐) ∩ 𝑑)))
94, 8cbvmpov 7535 . . 3 (𝑗 ∈ ω, 𝑘 ∈ V ↦ if(((𝑒‘𝑗) ∩ 𝑘) = ∅, 𝑘, ((𝑒‘𝑗) ∩ 𝑘))) = (𝑐 ∈ ω, 𝑑 ∈ V ↦ if(((𝑒‘𝑐) ∩ 𝑑) = ∅, 𝑑, ((𝑒‘𝑐) ∩ 𝑑)))
10 eqid 2763 . . 3 ∪ ran 𝑒 = ∪ ran 𝑒
11 seqomeq12 8489 . . 3 (((𝑗 ∈ ω, 𝑘 ∈ V ↦ if(((𝑒‘𝑗) ∩ 𝑘) = ∅, 𝑘, ((𝑒‘𝑗) ∩ 𝑘))) = (𝑐 ∈ ω, 𝑑 ∈ V ↦ if(((𝑒‘𝑐) ∩ 𝑑) = ∅, 𝑑, ((𝑒‘𝑐) ∩ 𝑑))) ∧ ∪ ran 𝑒 = ∪ ran 𝑒) → seqω((𝑗 ∈ ω, 𝑘 ∈ V ↦ if(((𝑒‘𝑗) ∩ 𝑘) = ∅, 𝑘, ((𝑒‘𝑗) ∩ 𝑘))), ∪ ran 𝑒) = seqω((𝑐 ∈ ω, 𝑑 ∈ V ↦ if(((𝑒‘𝑐) ∩ 𝑑) = ∅, 𝑑, ((𝑒‘𝑐) ∩ 𝑑))), ∪ ran 𝑒))
129, 10, 11mp2an 705 . 2 seqω((𝑗 ∈ ω, 𝑘 ∈ V ↦ if(((𝑒‘𝑗) ∩ 𝑘) = ∅, 𝑘, ((𝑒‘𝑗) ∩ 𝑘))), ∪ ran 𝑒) = seqω((𝑐 ∈ ω, 𝑑 ∈ V ↦ if(((𝑒‘𝑐) ∩ 𝑑) = ∅, 𝑑, ((𝑒‘𝑐) ∩ 𝑑))), ∪ ran 𝑒)
13 fin23lem33.f . 2 𝐹 = {𝑔 ∣ ∀𝑎 ∈ (𝒫 𝑔 ↑m ω)(∀𝑥 ∈ ω (𝑎‘suc 𝑥) ⊆ (𝑎‘𝑥) → ∩ ran 𝑎 ∈ ran 𝑎)}
14 fveq2 6905 . . . 4 (𝑙 = 𝑦 → (𝑒‘𝑙) = (𝑒‘𝑦))
1514sseq2d 3945 . . 3 (𝑙 = 𝑦 → (∩ ran seqω((𝑗 ∈ ω, 𝑘 ∈ V ↦ if(((𝑒‘𝑗) ∩ 𝑘) = ∅, 𝑘, ((𝑒‘𝑗) ∩ 𝑘))), ∪ ran 𝑒) ⊆ (𝑒‘𝑙) ↔ ∩ ran seqω((𝑗 ∈ ω, 𝑘 ∈ V ↦ if(((𝑒‘𝑗) ∩ 𝑘) = ∅, 𝑘, ((𝑒‘𝑗) ∩ 𝑘))), ∪ ran 𝑒) ⊆ (𝑒‘𝑦)))
1615cbvrabv 3426 . 2 {𝑙 ∈ ω ∣ ∩ ran seqω((𝑗 ∈ ω, 𝑘 ∈ V ↦ if(((𝑒‘𝑗) ∩ 𝑘) = ∅, 𝑘, ((𝑒‘𝑗) ∩ 𝑘))), ∪ ran 𝑒) ⊆ (𝑒‘𝑙)} = {𝑦 ∈ ω ∣ ∩ ran seqω((𝑗 ∈ ω, 𝑘 ∈ V ↦ if(((𝑒‘𝑗) ∩ 𝑘) = ∅, 𝑘, ((𝑒‘𝑗) ∩ 𝑘))), ∪ ran 𝑒) ⊆ (𝑒‘𝑦)}
17 eqid 2763 . 2 (𝑔 ∈ ω ↦ (℩𝑥 ∈ {𝑙 ∈ ω ∣ ∩ ran seqω((𝑗 ∈ ω, 𝑘 ∈ V ↦ if(((𝑒‘𝑗) ∩ 𝑘) = ∅, 𝑘, ((𝑒‘𝑗) ∩ 𝑘))), ∪ ran 𝑒) ⊆ (𝑒‘𝑙)} (𝑥 ∩ {𝑙 ∈ ω ∣ ∩ ran seqω((𝑗 ∈ ω, 𝑘 ∈ V ↦ if(((𝑒‘𝑗) ∩ 𝑘) = ∅, 𝑘, ((𝑒‘𝑗) ∩ 𝑘))), ∪ ran 𝑒) ⊆ (𝑒‘𝑙)}) ≈ 𝑔)) = (𝑔 ∈ ω ↦ (℩𝑥 ∈ {𝑙 ∈ ω ∣ ∩ ran seqω((𝑗 ∈ ω, 𝑘 ∈ V ↦ if(((𝑒‘𝑗) ∩ 𝑘) = ∅, 𝑘, ((𝑒‘𝑗) ∩ 𝑘))), ∪ ran 𝑒) ⊆ (𝑒‘𝑙)} (𝑥 ∩ {𝑙 ∈ ω ∣ ∩ ran seqω((𝑗 ∈ ω, 𝑘 ∈ V ↦ if(((𝑒‘𝑗) ∩ 𝑘) = ∅, 𝑘, ((𝑒‘𝑗) ∩ 𝑘))), ∪ ran 𝑒) ⊆ (𝑒‘𝑙)}) ≈ 𝑔))
18 eqid 2763 . 2 (𝑔 ∈ ω ↦ (℩𝑥 ∈ (ω ∖ {𝑙 ∈ ω ∣ ∩ ran seqω((𝑗 ∈ ω, 𝑘 ∈ V ↦ if(((𝑒‘𝑗) ∩ 𝑘) = ∅, 𝑘, ((𝑒‘𝑗) ∩ 𝑘))), ∪ ran 𝑒) ⊆ (𝑒‘𝑙)})(𝑥 ∩ (ω ∖ {𝑙 ∈ ω ∣ ∩ ran seqω((𝑗 ∈ ω, 𝑘 ∈ V ↦ if(((𝑒‘𝑗) ∩ 𝑘) = ∅, 𝑘, ((𝑒‘𝑗) ∩ 𝑘))), ∪ ran 𝑒) ⊆ (𝑒‘𝑙)})) ≈ 𝑔)) = (𝑔 ∈ ω ↦ (℩𝑥 ∈ (ω ∖ {𝑙 ∈ ω ∣ ∩ ran seqω((𝑗 ∈ ω, 𝑘 ∈ V ↦ if(((𝑒‘𝑗) ∩ 𝑘) = ∅, 𝑘, ((𝑒‘𝑗) ∩ 𝑘))), ∪ ran 𝑒) ⊆ (𝑒‘𝑙)})(𝑥 ∩ (ω ∖ {𝑙 ∈ ω ∣ ∩ ran seqω((𝑗 ∈ ω, 𝑘 ∈ V ↦ if(((𝑒‘𝑗) ∩ 𝑘) = ∅, 𝑘, ((𝑒‘𝑗) ∩ 𝑘))), ∪ ran 𝑒) ⊆ (𝑒‘𝑙)})) ≈ 𝑔))
19 eqid 2763 . 2 if({𝑙 ∈ ω ∣ ∩ ran seqω((𝑗 ∈ ω, 𝑘 ∈ V ↦ if(((𝑒‘𝑗) ∩ 𝑘) = ∅, 𝑘, ((𝑒‘𝑗) ∩ 𝑘))), ∪ ran 𝑒) ⊆ (𝑒‘𝑙)} ∈ Fin, (𝑒 ∘ (𝑔 ∈ ω ↦ (℩𝑥 ∈ (ω ∖ {𝑙 ∈ ω ∣ ∩ ran seqω((𝑗 ∈ ω, 𝑘 ∈ V ↦ if(((𝑒‘𝑗) ∩ 𝑘) = ∅, 𝑘, ((𝑒‘𝑗) ∩ 𝑘))), ∪ ran 𝑒) ⊆ (𝑒‘𝑙)})(𝑥 ∩ (ω ∖ {𝑙 ∈ ω ∣ ∩ ran seqω((𝑗 ∈ ω, 𝑘 ∈ V ↦ if(((𝑒‘𝑗) ∩ 𝑘) = ∅, 𝑘, ((𝑒‘𝑗) ∩ 𝑘))), ∪ ran 𝑒) ⊆ (𝑒‘𝑙)})) ≈ 𝑔))), ((𝑖 ∈ {𝑙 ∈ ω ∣ ∩ ran seqω((𝑗 ∈ ω, 𝑘 ∈ V ↦ if(((𝑒‘𝑗) ∩ 𝑘) = ∅, 𝑘, ((𝑒‘𝑗) ∩ 𝑘))), ∪ ran 𝑒) ⊆ (𝑒‘𝑙)} ↦ ((𝑒‘𝑖) ∖ ∩ ran seqω((𝑗 ∈ ω, 𝑘 ∈ V ↦ if(((𝑒‘𝑗) ∩ 𝑘) = ∅, 𝑘, ((𝑒‘𝑗) ∩ 𝑘))), ∪ ran 𝑒))) ∘ (𝑔 ∈ ω ↦ (℩𝑥 ∈ {𝑙 ∈ ω ∣ ∩ ran seqω((𝑗 ∈ ω, 𝑘 ∈ V ↦ if(((𝑒‘𝑗) ∩ 𝑘) = ∅, 𝑘, ((𝑒‘𝑗) ∩ 𝑘))), ∪ ran 𝑒) ⊆ (𝑒‘𝑙)} (𝑥 ∩ {𝑙 ∈ ω ∣ ∩ ran seqω((𝑗 ∈ ω, 𝑘 ∈ V ↦ if(((𝑒‘𝑗) ∩ 𝑘) = ∅, 𝑘, ((𝑒‘𝑗) ∩ 𝑘))), ∪ ran 𝑒) ⊆ (𝑒‘𝑙)}) ≈ 𝑔)))) = if({𝑙 ∈ ω ∣ ∩ ran seqω((𝑗 ∈ ω, 𝑘 ∈ V ↦ if(((𝑒‘𝑗) ∩ 𝑘) = ∅, 𝑘, ((𝑒‘𝑗) ∩ 𝑘))), ∪ ran 𝑒) ⊆ (𝑒‘𝑙)} ∈ Fin, (𝑒 ∘ (𝑔 ∈ ω ↦ (℩𝑥 ∈ (ω ∖ {𝑙 ∈ ω ∣ ∩ ran seqω((𝑗 ∈ ω, 𝑘 ∈ V ↦ if(((𝑒‘𝑗) ∩ 𝑘) = ∅, 𝑘, ((𝑒‘𝑗) ∩ 𝑘))), ∪ ran 𝑒) ⊆ (𝑒‘𝑙)})(𝑥 ∩ (ω ∖ {𝑙 ∈ ω ∣ ∩ ran seqω((𝑗 ∈ ω, 𝑘 ∈ V ↦ if(((𝑒‘𝑗) ∩ 𝑘) = ∅, 𝑘, ((𝑒‘𝑗) ∩ 𝑘))), ∪ ran 𝑒) ⊆ (𝑒‘𝑙)})) ≈ 𝑔))), ((𝑖 ∈ {𝑙 ∈ ω ∣ ∩ ran seqω((𝑗 ∈ ω, 𝑘 ∈ V ↦ if(((𝑒‘𝑗) ∩ 𝑘) = ∅, 𝑘, ((𝑒‘𝑗) ∩ 𝑘))), ∪ ran 𝑒) ⊆ (𝑒‘𝑙)} ↦ ((𝑒‘𝑖) ∖ ∩ ran seqω((𝑗 ∈ ω, 𝑘 ∈ V ↦ if(((𝑒‘𝑗) ∩ 𝑘) = ∅, 𝑘, ((𝑒‘𝑗) ∩ 𝑘))), ∪ ran 𝑒))) ∘ (𝑔 ∈ ω ↦ (℩𝑥 ∈ {𝑙 ∈ ω ∣ ∩ ran seqω((𝑗 ∈ ω, 𝑘 ∈ V ↦ if(((𝑒‘𝑗) ∩ 𝑘) = ∅, 𝑘, ((𝑒‘𝑗) ∩ 𝑘))), ∪ ran 𝑒) ⊆ (𝑒‘𝑙)} (𝑥 ∩ {𝑙 ∈ ω ∣ ∩ ran seqω((𝑗 ∈ ω, 𝑘 ∈ V ↦ if(((𝑒‘𝑗) ∩ 𝑘) = ∅, 𝑘, ((𝑒‘𝑗) ∩ 𝑘))), ∪ ran 𝑒) ⊆ (𝑒‘𝑙)}) ≈ 𝑔))))
2012, 13, 16, 17, 18, 19fin23lem32 10446 1 (𝐺 ∈ 𝐹 → ∃𝑓∀𝑏((𝑏:ω⟶1-1V ∧ ∪ ran 𝑏 ⊆ 𝐺) → ((𝑓‘𝑏):ω⟶1-1V ∧ ∪ ran (𝑓‘𝑏) ⊊ ∪ ran 𝑏)))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401  ∀wal 1568   = wceq 1570  ∃wex 1812   ∈ wcel 2147  {cab 2741  ∀wral 3080  {crab 3416  Vcvv 3454   ⊆ wss 3900   ⊊ wpss 4016   ∖ cdif 4048   ∩ cin 4092  ∅c0 4281  ifcif 4485  𝒫 cpw 4560  ∪ cuni 4870  ∩ cint 4910   class class class wbr 5106   ↦ cmpt 5189  ran crn 5656   ∘ ccom 5659  suc csuc 6379  ⟶1-1wf1 6552  ‘cfv 6555  ℩crio 7396  (class class class)co 7440   ∈ cmpo 7442  ωcom 7898  seqωcseqom 8482   ↑m cmap 8872   ≈ cen 8995  Fincfn 8998
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
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-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-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-om 7899  df-1st 8022  df-2nd 8023  df-frecs 8324  df-wrecs 8355  df-recs 8404  df-rdg 8443  df-seqom 8483  df-1o 8501  df-er 8742  df-map 8874  df-en 8999  df-dom 9000  df-sdom 9001  df-fin 9002  df-card 10044
This theorem is used by:  fin23lem41  10454
  Copyright terms: Public domain W3C validator