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

Theorem fin23lem17 9763
Description: Lemma for fin23 9814. By ? Fin3DS ? , 𝑈 achieves its minimum (𝑋 in the synopsis above, but we will not be assigning a symbol here). TODO: Fix comment; math symbol Fin3DS does not exist. (Contributed by Stefan O'Rear, 4-Nov-2014.) (Revised by Mario Carneiro, 17-May-2015.)
Hypotheses
Ref Expression
fin23lem.a 𝑈 = seqω((𝑖 ∈ ω, 𝑢 ∈ V ↦ if(((𝑡𝑖) ∩ 𝑢) = ∅, 𝑢, ((𝑡𝑖) ∩ 𝑢))), ran 𝑡)
fin23lem17.f 𝐹 = {𝑔 ∣ ∀𝑎 ∈ (𝒫 𝑔m ω)(∀𝑥 ∈ ω (𝑎‘suc 𝑥) ⊆ (𝑎𝑥) → ran 𝑎 ∈ ran 𝑎)}
Assertion
Ref Expression
fin23lem17 (( ran 𝑡𝐹𝑡:ω–1-1𝑉) → ran 𝑈 ∈ ran 𝑈)
Distinct variable groups:   𝑔,𝑖,𝑡,𝑢,𝑥,𝑎   𝐹,𝑎,𝑡   𝑉,𝑎   𝑥,𝑎   𝑈,𝑎,𝑖,𝑢   𝑔,𝑎
Allowed substitution hints:   𝑈(𝑥,𝑡,𝑔)   𝐹(𝑥,𝑢,𝑔,𝑖)   𝑉(𝑥,𝑢,𝑡,𝑔,𝑖)

Proof of Theorem fin23lem17
Dummy variables 𝑐 𝑏 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 fin23lem.a . . . 4 𝑈 = seqω((𝑖 ∈ ω, 𝑢 ∈ V ↦ if(((𝑡𝑖) ∩ 𝑢) = ∅, 𝑢, ((𝑡𝑖) ∩ 𝑢))), ran 𝑡)
21fin23lem13 9757 . . 3 (𝑐 ∈ ω → (𝑈‘suc 𝑐) ⊆ (𝑈𝑐))
32rgen 3151 . 2 𝑐 ∈ ω (𝑈‘suc 𝑐) ⊆ (𝑈𝑐)
4 fveq1 6672 . . . . . 6 (𝑏 = 𝑈 → (𝑏‘suc 𝑐) = (𝑈‘suc 𝑐))
5 fveq1 6672 . . . . . 6 (𝑏 = 𝑈 → (𝑏𝑐) = (𝑈𝑐))
64, 5sseq12d 4003 . . . . 5 (𝑏 = 𝑈 → ((𝑏‘suc 𝑐) ⊆ (𝑏𝑐) ↔ (𝑈‘suc 𝑐) ⊆ (𝑈𝑐)))
76ralbidv 3200 . . . 4 (𝑏 = 𝑈 → (∀𝑐 ∈ ω (𝑏‘suc 𝑐) ⊆ (𝑏𝑐) ↔ ∀𝑐 ∈ ω (𝑈‘suc 𝑐) ⊆ (𝑈𝑐)))
8 rneq 5809 . . . . . 6 (𝑏 = 𝑈 → ran 𝑏 = ran 𝑈)
98inteqd 4884 . . . . 5 (𝑏 = 𝑈 ran 𝑏 = ran 𝑈)
109, 8eleq12d 2910 . . . 4 (𝑏 = 𝑈 → ( ran 𝑏 ∈ ran 𝑏 ran 𝑈 ∈ ran 𝑈))
117, 10imbi12d 347 . . 3 (𝑏 = 𝑈 → ((∀𝑐 ∈ ω (𝑏‘suc 𝑐) ⊆ (𝑏𝑐) → ran 𝑏 ∈ ran 𝑏) ↔ (∀𝑐 ∈ ω (𝑈‘suc 𝑐) ⊆ (𝑈𝑐) → ran 𝑈 ∈ ran 𝑈)))
12 fin23lem17.f . . . . . 6 𝐹 = {𝑔 ∣ ∀𝑎 ∈ (𝒫 𝑔m ω)(∀𝑥 ∈ ω (𝑎‘suc 𝑥) ⊆ (𝑎𝑥) → ran 𝑎 ∈ ran 𝑎)}
1312isfin3ds 9754 . . . . 5 ( ran 𝑡𝐹 → ( ran 𝑡𝐹 ↔ ∀𝑏 ∈ (𝒫 ran 𝑡m ω)(∀𝑐 ∈ ω (𝑏‘suc 𝑐) ⊆ (𝑏𝑐) → ran 𝑏 ∈ ran 𝑏)))
1413ibi 269 . . . 4 ( ran 𝑡𝐹 → ∀𝑏 ∈ (𝒫 ran 𝑡m ω)(∀𝑐 ∈ ω (𝑏‘suc 𝑐) ⊆ (𝑏𝑐) → ran 𝑏 ∈ ran 𝑏))
1514adantr 483 . . 3 (( ran 𝑡𝐹𝑡:ω–1-1𝑉) → ∀𝑏 ∈ (𝒫 ran 𝑡m ω)(∀𝑐 ∈ ω (𝑏‘suc 𝑐) ⊆ (𝑏𝑐) → ran 𝑏 ∈ ran 𝑏))
161fnseqom 8094 . . . . . 6 𝑈 Fn ω
17 dffn3 6528 . . . . . 6 (𝑈 Fn ω ↔ 𝑈:ω⟶ran 𝑈)
1816, 17mpbi 232 . . . . 5 𝑈:ω⟶ran 𝑈
19 pwuni 4878 . . . . . 6 ran 𝑈 ⊆ 𝒫 ran 𝑈
201fin23lem16 9760 . . . . . . 7 ran 𝑈 = ran 𝑡
2120pweqi 4560 . . . . . 6 𝒫 ran 𝑈 = 𝒫 ran 𝑡
2219, 21sseqtri 4006 . . . . 5 ran 𝑈 ⊆ 𝒫 ran 𝑡
23 fss 6530 . . . . 5 ((𝑈:ω⟶ran 𝑈 ∧ ran 𝑈 ⊆ 𝒫 ran 𝑡) → 𝑈:ω⟶𝒫 ran 𝑡)
2418, 22, 23mp2an 690 . . . 4 𝑈:ω⟶𝒫 ran 𝑡
25 vex 3500 . . . . . . . 8 𝑡 ∈ V
2625rnex 7620 . . . . . . 7 ran 𝑡 ∈ V
2726uniex 7470 . . . . . 6 ran 𝑡 ∈ V
2827pwex 5284 . . . . 5 𝒫 ran 𝑡 ∈ V
29 f1f 6578 . . . . . . 7 (𝑡:ω–1-1𝑉𝑡:ω⟶𝑉)
30 dmfex 7644 . . . . . . 7 ((𝑡 ∈ V ∧ 𝑡:ω⟶𝑉) → ω ∈ V)
3125, 29, 30sylancr 589 . . . . . 6 (𝑡:ω–1-1𝑉 → ω ∈ V)
3231adantl 484 . . . . 5 (( ran 𝑡𝐹𝑡:ω–1-1𝑉) → ω ∈ V)
33 elmapg 8422 . . . . 5 ((𝒫 ran 𝑡 ∈ V ∧ ω ∈ V) → (𝑈 ∈ (𝒫 ran 𝑡m ω) ↔ 𝑈:ω⟶𝒫 ran 𝑡))
3428, 32, 33sylancr 589 . . . 4 (( ran 𝑡𝐹𝑡:ω–1-1𝑉) → (𝑈 ∈ (𝒫 ran 𝑡m ω) ↔ 𝑈:ω⟶𝒫 ran 𝑡))
3524, 34mpbiri 260 . . 3 (( ran 𝑡𝐹𝑡:ω–1-1𝑉) → 𝑈 ∈ (𝒫 ran 𝑡m ω))
3611, 15, 35rspcdva 3628 . 2 (( ran 𝑡𝐹𝑡:ω–1-1𝑉) → (∀𝑐 ∈ ω (𝑈‘suc 𝑐) ⊆ (𝑈𝑐) → ran 𝑈 ∈ ran 𝑈))
373, 36mpi 20 1 (( ran 𝑡𝐹𝑡:ω–1-1𝑉) → ran 𝑈 ∈ ran 𝑈)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 208  wa 398   = wceq 1536  wcel 2113  {cab 2802  wral 3141  Vcvv 3497  cin 3938  wss 3939  c0 4294  ifcif 4470  𝒫 cpw 4542   cuni 4841   cint 4879  ran crn 5559  suc csuc 6196   Fn wfn 6353  wf 6354  1-1wf1 6355  cfv 6358  (class class class)co 7159  cmpo 7161  ωcom 7583  seqωcseqom 8086  m cmap 8409
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1969  ax-7 2014  ax-8 2115  ax-9 2123  ax-10 2144  ax-11 2160  ax-12 2176  ax-ext 2796  ax-sep 5206  ax-nul 5213  ax-pow 5269  ax-pr 5333  ax-un 7464
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3or 1084  df-3an 1085  df-tru 1539  df-ex 1780  df-nf 1784  df-sb 2069  df-mo 2621  df-eu 2653  df-clab 2803  df-cleq 2817  df-clel 2896  df-nfc 2966  df-ne 3020  df-ral 3146  df-rex 3147  df-reu 3148  df-rab 3150  df-v 3499  df-sbc 3776  df-csb 3887  df-dif 3942  df-un 3944  df-in 3946  df-ss 3955  df-pss 3957  df-nul 4295  df-if 4471  df-pw 4544  df-sn 4571  df-pr 4573  df-tp 4575  df-op 4577  df-uni 4842  df-int 4880  df-iun 4924  df-br 5070  df-opab 5132  df-mpt 5150  df-tr 5176  df-id 5463  df-eprel 5468  df-po 5477  df-so 5478  df-fr 5517  df-we 5519  df-xp 5564  df-rel 5565  df-cnv 5566  df-co 5567  df-dm 5568  df-rn 5569  df-res 5570  df-ima 5571  df-pred 6151  df-ord 6197  df-on 6198  df-lim 6199  df-suc 6200  df-iota 6317  df-fun 6360  df-fn 6361  df-f 6362  df-f1 6363  df-fo 6364  df-f1o 6365  df-fv 6366  df-ov 7162  df-oprab 7163  df-mpo 7164  df-om 7584  df-2nd 7693  df-wrecs 7950  df-recs 8011  df-rdg 8049  df-seqom 8087  df-map 8411
This theorem is referenced by:  fin23lem21  9764
  Copyright terms: Public domain W3C validator