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

Theorem fin23lem33 9756
 Description: Lemma for fin23 9800. Discharge hypotheses. (Contributed by Stefan O'Rear, 2-Nov-2014.)
Hypothesis
Ref Expression
fin23lem33.f 𝐹 = {𝑔 ∣ ∀𝑎 ∈ (𝒫 𝑔m ω)(∀𝑥 ∈ ω (𝑎‘suc 𝑥) ⊆ (𝑎𝑥) → ran 𝑎 ∈ ran 𝑎)}
Assertion
Ref Expression
fin23lem33 (𝐺𝐹 → ∃𝑓𝑏((𝑏:ω–1-1→V ∧ ran 𝑏𝐺) → ((𝑓𝑏):ω–1-1→V ∧ 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 6645 . . . . . . 7 (𝑗 = 𝑐 → (𝑒𝑗) = (𝑒𝑐))
21ineq1d 4138 . . . . . 6 (𝑗 = 𝑐 → ((𝑒𝑗) ∩ 𝑘) = ((𝑒𝑐) ∩ 𝑘))
32eqeq1d 2800 . . . . 5 (𝑗 = 𝑐 → (((𝑒𝑗) ∩ 𝑘) = ∅ ↔ ((𝑒𝑐) ∩ 𝑘) = ∅))
43, 2ifbieq2d 4450 . . . 4 (𝑗 = 𝑐 → if(((𝑒𝑗) ∩ 𝑘) = ∅, 𝑘, ((𝑒𝑗) ∩ 𝑘)) = if(((𝑒𝑐) ∩ 𝑘) = ∅, 𝑘, ((𝑒𝑐) ∩ 𝑘)))
5 ineq2 4133 . . . . . 6 (𝑘 = 𝑑 → ((𝑒𝑐) ∩ 𝑘) = ((𝑒𝑐) ∩ 𝑑))
65eqeq1d 2800 . . . . 5 (𝑘 = 𝑑 → (((𝑒𝑐) ∩ 𝑘) = ∅ ↔ ((𝑒𝑐) ∩ 𝑑) = ∅))
7 id 22 . . . . 5 (𝑘 = 𝑑𝑘 = 𝑑)
86, 7, 5ifbieq12d 4452 . . . 4 (𝑘 = 𝑑 → if(((𝑒𝑐) ∩ 𝑘) = ∅, 𝑘, ((𝑒𝑐) ∩ 𝑘)) = if(((𝑒𝑐) ∩ 𝑑) = ∅, 𝑑, ((𝑒𝑐) ∩ 𝑑)))
94, 8cbvmpov 7228 . . 3 (𝑗 ∈ ω, 𝑘 ∈ V ↦ if(((𝑒𝑗) ∩ 𝑘) = ∅, 𝑘, ((𝑒𝑗) ∩ 𝑘))) = (𝑐 ∈ ω, 𝑑 ∈ V ↦ if(((𝑒𝑐) ∩ 𝑑) = ∅, 𝑑, ((𝑒𝑐) ∩ 𝑑)))
10 eqid 2798 . . 3 ran 𝑒 = ran 𝑒
11 seqomeq12 8073 . . 3 (((𝑗 ∈ ω, 𝑘 ∈ V ↦ if(((𝑒𝑗) ∩ 𝑘) = ∅, 𝑘, ((𝑒𝑗) ∩ 𝑘))) = (𝑐 ∈ ω, 𝑑 ∈ V ↦ if(((𝑒𝑐) ∩ 𝑑) = ∅, 𝑑, ((𝑒𝑐) ∩ 𝑑))) ∧ ran 𝑒 = ran 𝑒) → seqω((𝑗 ∈ ω, 𝑘 ∈ V ↦ if(((𝑒𝑗) ∩ 𝑘) = ∅, 𝑘, ((𝑒𝑗) ∩ 𝑘))), ran 𝑒) = seqω((𝑐 ∈ ω, 𝑑 ∈ V ↦ if(((𝑒𝑐) ∩ 𝑑) = ∅, 𝑑, ((𝑒𝑐) ∩ 𝑑))), ran 𝑒))
129, 10, 11mp2an 691 . 2 seqω((𝑗 ∈ ω, 𝑘 ∈ V ↦ if(((𝑒𝑗) ∩ 𝑘) = ∅, 𝑘, ((𝑒𝑗) ∩ 𝑘))), ran 𝑒) = seqω((𝑐 ∈ ω, 𝑑 ∈ V ↦ if(((𝑒𝑐) ∩ 𝑑) = ∅, 𝑑, ((𝑒𝑐) ∩ 𝑑))), ran 𝑒)
13 fin23lem33.f . 2 𝐹 = {𝑔 ∣ ∀𝑎 ∈ (𝒫 𝑔m ω)(∀𝑥 ∈ ω (𝑎‘suc 𝑥) ⊆ (𝑎𝑥) → ran 𝑎 ∈ ran 𝑎)}
14 fveq2 6645 . . . 4 (𝑙 = 𝑦 → (𝑒𝑙) = (𝑒𝑦))
1514sseq2d 3947 . . 3 (𝑙 = 𝑦 → ( ran seqω((𝑗 ∈ ω, 𝑘 ∈ V ↦ if(((𝑒𝑗) ∩ 𝑘) = ∅, 𝑘, ((𝑒𝑗) ∩ 𝑘))), ran 𝑒) ⊆ (𝑒𝑙) ↔ ran seqω((𝑗 ∈ ω, 𝑘 ∈ V ↦ if(((𝑒𝑗) ∩ 𝑘) = ∅, 𝑘, ((𝑒𝑗) ∩ 𝑘))), ran 𝑒) ⊆ (𝑒𝑦)))
1615cbvrabv 3439 . 2 {𝑙 ∈ ω ∣ ran seqω((𝑗 ∈ ω, 𝑘 ∈ V ↦ if(((𝑒𝑗) ∩ 𝑘) = ∅, 𝑘, ((𝑒𝑗) ∩ 𝑘))), ran 𝑒) ⊆ (𝑒𝑙)} = {𝑦 ∈ ω ∣ ran seqω((𝑗 ∈ ω, 𝑘 ∈ V ↦ if(((𝑒𝑗) ∩ 𝑘) = ∅, 𝑘, ((𝑒𝑗) ∩ 𝑘))), ran 𝑒) ⊆ (𝑒𝑦)}
17 eqid 2798 . 2 (𝑔 ∈ ω ↦ (𝑥 ∈ {𝑙 ∈ ω ∣ ran seqω((𝑗 ∈ ω, 𝑘 ∈ V ↦ if(((𝑒𝑗) ∩ 𝑘) = ∅, 𝑘, ((𝑒𝑗) ∩ 𝑘))), ran 𝑒) ⊆ (𝑒𝑙)} (𝑥 ∩ {𝑙 ∈ ω ∣ ran seqω((𝑗 ∈ ω, 𝑘 ∈ V ↦ if(((𝑒𝑗) ∩ 𝑘) = ∅, 𝑘, ((𝑒𝑗) ∩ 𝑘))), ran 𝑒) ⊆ (𝑒𝑙)}) ≈ 𝑔)) = (𝑔 ∈ ω ↦ (𝑥 ∈ {𝑙 ∈ ω ∣ ran seqω((𝑗 ∈ ω, 𝑘 ∈ V ↦ if(((𝑒𝑗) ∩ 𝑘) = ∅, 𝑘, ((𝑒𝑗) ∩ 𝑘))), ran 𝑒) ⊆ (𝑒𝑙)} (𝑥 ∩ {𝑙 ∈ ω ∣ ran seqω((𝑗 ∈ ω, 𝑘 ∈ V ↦ if(((𝑒𝑗) ∩ 𝑘) = ∅, 𝑘, ((𝑒𝑗) ∩ 𝑘))), ran 𝑒) ⊆ (𝑒𝑙)}) ≈ 𝑔))
18 eqid 2798 . 2 (𝑔 ∈ ω ↦ (𝑥 ∈ (ω ∖ {𝑙 ∈ ω ∣ ran seqω((𝑗 ∈ ω, 𝑘 ∈ V ↦ if(((𝑒𝑗) ∩ 𝑘) = ∅, 𝑘, ((𝑒𝑗) ∩ 𝑘))), ran 𝑒) ⊆ (𝑒𝑙)})(𝑥 ∩ (ω ∖ {𝑙 ∈ ω ∣ ran seqω((𝑗 ∈ ω, 𝑘 ∈ V ↦ if(((𝑒𝑗) ∩ 𝑘) = ∅, 𝑘, ((𝑒𝑗) ∩ 𝑘))), ran 𝑒) ⊆ (𝑒𝑙)})) ≈ 𝑔)) = (𝑔 ∈ ω ↦ (𝑥 ∈ (ω ∖ {𝑙 ∈ ω ∣ ran seqω((𝑗 ∈ ω, 𝑘 ∈ V ↦ if(((𝑒𝑗) ∩ 𝑘) = ∅, 𝑘, ((𝑒𝑗) ∩ 𝑘))), ran 𝑒) ⊆ (𝑒𝑙)})(𝑥 ∩ (ω ∖ {𝑙 ∈ ω ∣ ran seqω((𝑗 ∈ ω, 𝑘 ∈ V ↦ if(((𝑒𝑗) ∩ 𝑘) = ∅, 𝑘, ((𝑒𝑗) ∩ 𝑘))), ran 𝑒) ⊆ (𝑒𝑙)})) ≈ 𝑔))
19 eqid 2798 . 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 9755 1 (𝐺𝐹 → ∃𝑓𝑏((𝑏:ω–1-1→V ∧ ran 𝑏𝐺) → ((𝑓𝑏):ω–1-1→V ∧ ran (𝑓𝑏) ⊊ ran 𝑏)))
 Colors of variables: wff setvar class Syntax hints:   → wi 4   ∧ wa 399  ∀wal 1536   = wceq 1538  ∃wex 1781   ∈ wcel 2111  {cab 2776  ∀wral 3106  {crab 3110  Vcvv 3441   ∖ cdif 3878   ∩ cin 3880   ⊆ wss 3881   ⊊ wpss 3882  ∅c0 4243  ifcif 4425  𝒫 cpw 4497  ∪ cuni 4800  ∩ cint 4838   class class class wbr 5030   ↦ cmpt 5110  ran crn 5520   ∘ ccom 5523  suc csuc 6161  –1-1→wf1 6321  ‘cfv 6324  ℩crio 7092  (class class class)co 7135   ∈ cmpo 7137  ωcom 7560  seqωcseqom 8066   ↑m cmap 8389   ≈ cen 8489  Fincfn 8492 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 1911  ax-6 1970  ax-7 2015  ax-8 2113  ax-9 2121  ax-10 2142  ax-11 2158  ax-12 2175  ax-ext 2770  ax-rep 5154  ax-sep 5167  ax-nul 5174  ax-pow 5231  ax-pr 5295  ax-un 7441 This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-3or 1085  df-3an 1086  df-tru 1541  df-ex 1782  df-nf 1786  df-sb 2070  df-mo 2598  df-eu 2629  df-clab 2777  df-cleq 2791  df-clel 2870  df-nfc 2938  df-ne 2988  df-ral 3111  df-rex 3112  df-reu 3113  df-rmo 3114  df-rab 3115  df-v 3443  df-sbc 3721  df-csb 3829  df-dif 3884  df-un 3886  df-in 3888  df-ss 3898  df-pss 3900  df-nul 4244  df-if 4426  df-pw 4499  df-sn 4526  df-pr 4528  df-tp 4530  df-op 4532  df-uni 4801  df-int 4839  df-iun 4883  df-br 5031  df-opab 5093  df-mpt 5111  df-tr 5137  df-id 5425  df-eprel 5430  df-po 5438  df-so 5439  df-fr 5478  df-se 5479  df-we 5480  df-xp 5525  df-rel 5526  df-cnv 5527  df-co 5528  df-dm 5529  df-rn 5530  df-res 5531  df-ima 5532  df-pred 6116  df-ord 6162  df-on 6163  df-lim 6164  df-suc 6165  df-iota 6283  df-fun 6326  df-fn 6327  df-f 6328  df-f1 6329  df-fo 6330  df-f1o 6331  df-fv 6332  df-isom 6333  df-riota 7093  df-ov 7138  df-oprab 7139  df-mpo 7140  df-om 7561  df-1st 7671  df-2nd 7672  df-wrecs 7930  df-recs 7991  df-rdg 8029  df-seqom 8067  df-1o 8085  df-oadd 8089  df-er 8272  df-map 8391  df-en 8493  df-dom 8494  df-sdom 8495  df-fin 8496  df-card 9352 This theorem is referenced by:  fin23lem41  9763
 Copyright terms: Public domain W3C validator