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

Theorem fin23lem33 10423
Description: Lemma for fin23 10467. 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 6885 . . . . . . 7 (𝑗 = 𝑐 → (𝑒‘𝑗) = (𝑒‘𝑐))
21ineq1d 4116 . . . . . 6 (𝑗 = 𝑐 → ((𝑒‘𝑗) ∩ 𝑘) = ((𝑒‘𝑐) ∩ 𝑘))
32eqeq1d 2762 . . . . 5 (𝑗 = 𝑐 → (((𝑒‘𝑗) ∩ 𝑘) = ∅ ↔ ((𝑒‘𝑐) ∩ 𝑘) = ∅))
43, 2ifbieq2d 4508 . . . 4 (𝑗 = 𝑐 → if(((𝑒‘𝑗) ∩ 𝑘) = ∅, 𝑘, ((𝑒‘𝑗) ∩ 𝑘)) = if(((𝑒‘𝑐) ∩ 𝑘) = ∅, 𝑘, ((𝑒‘𝑐) ∩ 𝑘)))
5 ineq2 4111 . . . . . 6 (𝑘 = 𝑑 → ((𝑒‘𝑐) ∩ 𝑘) = ((𝑒‘𝑐) ∩ 𝑑))
65eqeq1d 2762 . . . . 5 (𝑘 = 𝑑 → (((𝑒‘𝑐) ∩ 𝑘) = ∅ ↔ ((𝑒‘𝑐) ∩ 𝑑) = ∅))
7 id 23 . . . . 5 (𝑘 = 𝑑 → 𝑘 = 𝑑)
86, 7, 5ifbieq12d 4510 . . . 4 (𝑘 = 𝑑 → if(((𝑒‘𝑐) ∩ 𝑘) = ∅, 𝑘, ((𝑒‘𝑐) ∩ 𝑘)) = if(((𝑒‘𝑐) ∩ 𝑑) = ∅, 𝑑, ((𝑒‘𝑐) ∩ 𝑑)))
94, 8cbvmpov 7515 . . 3 (𝑗 ∈ ω, 𝑘 ∈ V ↦ if(((𝑒‘𝑗) ∩ 𝑘) = ∅, 𝑘, ((𝑒‘𝑗) ∩ 𝑘))) = (𝑐 ∈ ω, 𝑑 ∈ V ↦ if(((𝑒‘𝑐) ∩ 𝑑) = ∅, 𝑑, ((𝑒‘𝑐) ∩ 𝑑)))
10 eqid 2760 . . 3 ∪ ran 𝑒 = ∪ ran 𝑒
11 seqomeq12 8464 . . 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 6885 . . . 4 (𝑙 = 𝑦 → (𝑒‘𝑙) = (𝑒‘𝑦))
1514sseq2d 3940 . . 3 (𝑙 = 𝑦 → (∩ ran seqω((𝑗 ∈ ω, 𝑘 ∈ V ↦ if(((𝑒‘𝑗) ∩ 𝑘) = ∅, 𝑘, ((𝑒‘𝑗) ∩ 𝑘))), ∪ ran 𝑒) ⊆ (𝑒‘𝑙) ↔ ∩ ran seqω((𝑗 ∈ ω, 𝑘 ∈ V ↦ if(((𝑒‘𝑗) ∩ 𝑘) = ∅, 𝑘, ((𝑒‘𝑗) ∩ 𝑘))), ∪ ran 𝑒) ⊆ (𝑒‘𝑦)))
1615cbvrabv 3422 . 2 {𝑙 ∈ ω ∣ ∩ ran seqω((𝑗 ∈ ω, 𝑘 ∈ V ↦ if(((𝑒‘𝑗) ∩ 𝑘) = ∅, 𝑘, ((𝑒‘𝑗) ∩ 𝑘))), ∪ ran 𝑒) ⊆ (𝑒‘𝑙)} = {𝑦 ∈ ω ∣ ∩ ran seqω((𝑗 ∈ ω, 𝑘 ∈ V ↦ if(((𝑒‘𝑗) ∩ 𝑘) = ∅, 𝑘, ((𝑒‘𝑗) ∩ 𝑘))), ∪ ran 𝑒) ⊆ (𝑒‘𝑦)}
17 eqid 2760 . 2 (𝑔 ∈ ω ↦ (℩𝑥 ∈ {𝑙 ∈ ω ∣ ∩ ran seqω((𝑗 ∈ ω, 𝑘 ∈ V ↦ if(((𝑒‘𝑗) ∩ 𝑘) = ∅, 𝑘, ((𝑒‘𝑗) ∩ 𝑘))), ∪ ran 𝑒) ⊆ (𝑒‘𝑙)} (𝑥 ∩ {𝑙 ∈ ω ∣ ∩ ran seqω((𝑗 ∈ ω, 𝑘 ∈ V ↦ if(((𝑒‘𝑗) ∩ 𝑘) = ∅, 𝑘, ((𝑒‘𝑗) ∩ 𝑘))), ∪ ran 𝑒) ⊆ (𝑒‘𝑙)}) ≈ 𝑔)) = (𝑔 ∈ ω ↦ (℩𝑥 ∈ {𝑙 ∈ ω ∣ ∩ ran seqω((𝑗 ∈ ω, 𝑘 ∈ V ↦ if(((𝑒‘𝑗) ∩ 𝑘) = ∅, 𝑘, ((𝑒‘𝑗) ∩ 𝑘))), ∪ ran 𝑒) ⊆ (𝑒‘𝑙)} (𝑥 ∩ {𝑙 ∈ ω ∣ ∩ ran seqω((𝑗 ∈ ω, 𝑘 ∈ V ↦ if(((𝑒‘𝑗) ∩ 𝑘) = ∅, 𝑘, ((𝑒‘𝑗) ∩ 𝑘))), ∪ ran 𝑒) ⊆ (𝑒‘𝑙)}) ≈ 𝑔))
18 eqid 2760 . 2 (𝑔 ∈ ω ↦ (℩𝑥 ∈ (ω ∖ {𝑙 ∈ ω ∣ ∩ ran seqω((𝑗 ∈ ω, 𝑘 ∈ V ↦ if(((𝑒‘𝑗) ∩ 𝑘) = ∅, 𝑘, ((𝑒‘𝑗) ∩ 𝑘))), ∪ ran 𝑒) ⊆ (𝑒‘𝑙)})(𝑥 ∩ (ω ∖ {𝑙 ∈ ω ∣ ∩ ran seqω((𝑗 ∈ ω, 𝑘 ∈ V ↦ if(((𝑒‘𝑗) ∩ 𝑘) = ∅, 𝑘, ((𝑒‘𝑗) ∩ 𝑘))), ∪ ran 𝑒) ⊆ (𝑒‘𝑙)})) ≈ 𝑔)) = (𝑔 ∈ ω ↦ (℩𝑥 ∈ (ω ∖ {𝑙 ∈ ω ∣ ∩ ran seqω((𝑗 ∈ ω, 𝑘 ∈ V ↦ if(((𝑒‘𝑗) ∩ 𝑘) = ∅, 𝑘, ((𝑒‘𝑗) ∩ 𝑘))), ∪ ran 𝑒) ⊆ (𝑒‘𝑙)})(𝑥 ∩ (ω ∖ {𝑙 ∈ ω ∣ ∩ ran seqω((𝑗 ∈ ω, 𝑘 ∈ V ↦ if(((𝑒‘𝑗) ∩ 𝑘) = ∅, 𝑘, ((𝑒‘𝑗) ∩ 𝑘))), ∪ ran 𝑒) ⊆ (𝑒‘𝑙)})) ≈ 𝑔))
19 eqid 2760 . 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 10422 1 (𝐺 ∈ 𝐹 → ∃𝑓∀𝑏((𝑏:ω–1-1→V ∧ ∪ ran 𝑏 ⊆ 𝐺) → ((𝑓‘𝑏):ω–1-1→V ∧ ∪ ran (𝑓‘𝑏) ⊊ ∪ ran 𝑏)))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401  ∀wal 1567   = wceq 1569  ∃wex 1811   ∈ wcel 2144  {cab 2738  ∀wral 3076  {crab 3412  Vcvv 3450   ⊆ wss 3895   ⊊ wpss 4013   ∖ cdif 4045   ∩ cin 4089  ∅c0 4278  ifcif 4481  𝒫 cpw 4556  ∪ cuni 4866  ∩ cint 4906   class class class wbr 5102   ↦ cmpt 5185  ran crn 5651   ∘ ccom 5654  suc csuc 6364  –1-1→wf1 6535  ‘cfv 6538  ℩crio 7376  (class class class)co 7420   ∈ cmpo 7422  ωcom 7877  seqωcseqom 8457   ↑m cmap 8847   ≈ cen 8970  Fincfn 8973
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-rep 5231  ax-sep 5248  ax-nul 5259  ax-pow 5326  ax-pr 5390  ax-un 7751
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-rmo 3365  df-reu 3366  df-rab 3413  df-v 3452  df-sbc 3739  df-csb 3847  df-ss 3896  df-pss 4014  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-pw 4558  df-sn 4584  df-pr 4586  df-op 4590  df-uni 4867  df-int 4907  df-iun 4952  df-br 5103  df-opab 5167  df-mpt 5186  df-tr 5212  df-id 5545  df-eprel 5550  df-po 5558  df-so 5559  df-fr 5603  df-se 5604  df-we 5605  df-xp 5656  df-rel 5657  df-cnv 5658  df-co 5659  df-dm 5660  df-rn 5661  df-res 5662  df-ima 5663  df-pred 6304  df-ord 6365  df-on 6366  df-lim 6367  df-suc 6368  df-iota 6494  df-fun 6540  df-fn 6541  df-f 6542  df-f1 6543  df-fo 6544  df-f1o 6545  df-fv 6546  df-isom 6547  df-riota 7377  df-ov 7423  df-oprab 7424  df-mpo 7425  df-om 7878  df-1st 8001  df-2nd 8002  df-frecs 8299  df-wrecs 8330  df-recs 8379  df-rdg 8418  df-seqom 8458  df-1o 8476  df-er 8717  df-map 8849  df-en 8974  df-dom 8975  df-sdom 8976  df-fin 8977  df-card 10020
This theorem is used by:  fin23lem41  10430
  Copyright terms: Public domain W3C validator