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

Theorem fin23lem17 9550
Description: Lemma for fin23 9601. 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 𝐹 = {𝑔 ∣ ∀𝑎 ∈ (𝒫 𝑔𝑚 ω)(∀𝑥 ∈ ω (𝑎‘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 9544 . . 3 (𝑐 ∈ ω → (𝑈‘suc 𝑐) ⊆ (𝑈𝑐))
32rgen 3092 . 2 𝑐 ∈ ω (𝑈‘suc 𝑐) ⊆ (𝑈𝑐)
4 fveq1 6492 . . . . . 6 (𝑏 = 𝑈 → (𝑏‘suc 𝑐) = (𝑈‘suc 𝑐))
5 fveq1 6492 . . . . . 6 (𝑏 = 𝑈 → (𝑏𝑐) = (𝑈𝑐))
64, 5sseq12d 3886 . . . . 5 (𝑏 = 𝑈 → ((𝑏‘suc 𝑐) ⊆ (𝑏𝑐) ↔ (𝑈‘suc 𝑐) ⊆ (𝑈𝑐)))
76ralbidv 3141 . . . 4 (𝑏 = 𝑈 → (∀𝑐 ∈ ω (𝑏‘suc 𝑐) ⊆ (𝑏𝑐) ↔ ∀𝑐 ∈ ω (𝑈‘suc 𝑐) ⊆ (𝑈𝑐)))
8 rneq 5642 . . . . . 6 (𝑏 = 𝑈 → ran 𝑏 = ran 𝑈)
98inteqd 4748 . . . . 5 (𝑏 = 𝑈 ran 𝑏 = ran 𝑈)
109, 8eleq12d 2854 . . . 4 (𝑏 = 𝑈 → ( ran 𝑏 ∈ ran 𝑏 ran 𝑈 ∈ ran 𝑈))
117, 10imbi12d 337 . . 3 (𝑏 = 𝑈 → ((∀𝑐 ∈ ω (𝑏‘suc 𝑐) ⊆ (𝑏𝑐) → ran 𝑏 ∈ ran 𝑏) ↔ (∀𝑐 ∈ ω (𝑈‘suc 𝑐) ⊆ (𝑈𝑐) → ran 𝑈 ∈ ran 𝑈)))
12 fin23lem17.f . . . . . 6 𝐹 = {𝑔 ∣ ∀𝑎 ∈ (𝒫 𝑔𝑚 ω)(∀𝑥 ∈ ω (𝑎‘suc 𝑥) ⊆ (𝑎𝑥) → ran 𝑎 ∈ ran 𝑎)}
1312isfin3ds 9541 . . . . 5 ( ran 𝑡𝐹 → ( ran 𝑡𝐹 ↔ ∀𝑏 ∈ (𝒫 ran 𝑡𝑚 ω)(∀𝑐 ∈ ω (𝑏‘suc 𝑐) ⊆ (𝑏𝑐) → ran 𝑏 ∈ ran 𝑏)))
1413ibi 259 . . . 4 ( ran 𝑡𝐹 → ∀𝑏 ∈ (𝒫 ran 𝑡𝑚 ω)(∀𝑐 ∈ ω (𝑏‘suc 𝑐) ⊆ (𝑏𝑐) → ran 𝑏 ∈ ran 𝑏))
1514adantr 473 . . 3 (( ran 𝑡𝐹𝑡:ω–1-1𝑉) → ∀𝑏 ∈ (𝒫 ran 𝑡𝑚 ω)(∀𝑐 ∈ ω (𝑏‘suc 𝑐) ⊆ (𝑏𝑐) → ran 𝑏 ∈ ran 𝑏))
161fnseqom 7887 . . . . . 6 𝑈 Fn ω
17 dffn3 6349 . . . . . 6 (𝑈 Fn ω ↔ 𝑈:ω⟶ran 𝑈)
1816, 17mpbi 222 . . . . 5 𝑈:ω⟶ran 𝑈
19 pwuni 4742 . . . . . 6 ran 𝑈 ⊆ 𝒫 ran 𝑈
201fin23lem16 9547 . . . . . . 7 ran 𝑈 = ran 𝑡
2120pweqi 4420 . . . . . 6 𝒫 ran 𝑈 = 𝒫 ran 𝑡
2219, 21sseqtri 3889 . . . . 5 ran 𝑈 ⊆ 𝒫 ran 𝑡
23 fss 6351 . . . . 5 ((𝑈:ω⟶ran 𝑈 ∧ ran 𝑈 ⊆ 𝒫 ran 𝑡) → 𝑈:ω⟶𝒫 ran 𝑡)
2418, 22, 23mp2an 679 . . . 4 𝑈:ω⟶𝒫 ran 𝑡
25 vex 3412 . . . . . . . 8 𝑡 ∈ V
2625rnex 7426 . . . . . . 7 ran 𝑡 ∈ V
2726uniex 7277 . . . . . 6 ran 𝑡 ∈ V
2827pwex 5128 . . . . 5 𝒫 ran 𝑡 ∈ V
29 f1f 6398 . . . . . . 7 (𝑡:ω–1-1𝑉𝑡:ω⟶𝑉)
30 dmfex 7450 . . . . . . 7 ((𝑡 ∈ V ∧ 𝑡:ω⟶𝑉) → ω ∈ V)
3125, 29, 30sylancr 578 . . . . . 6 (𝑡:ω–1-1𝑉 → ω ∈ V)
3231adantl 474 . . . . 5 (( ran 𝑡𝐹𝑡:ω–1-1𝑉) → ω ∈ V)
33 elmapg 8211 . . . . 5 ((𝒫 ran 𝑡 ∈ V ∧ ω ∈ V) → (𝑈 ∈ (𝒫 ran 𝑡𝑚 ω) ↔ 𝑈:ω⟶𝒫 ran 𝑡))
3428, 32, 33sylancr 578 . . . 4 (( ran 𝑡𝐹𝑡:ω–1-1𝑉) → (𝑈 ∈ (𝒫 ran 𝑡𝑚 ω) ↔ 𝑈:ω⟶𝒫 ran 𝑡))
3524, 34mpbiri 250 . . 3 (( ran 𝑡𝐹𝑡:ω–1-1𝑉) → 𝑈 ∈ (𝒫 ran 𝑡𝑚 ω))
3611, 15, 35rspcdva 3535 . 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 198  wa 387   = wceq 1507  wcel 2048  {cab 2753  wral 3082  Vcvv 3409  cin 3824  wss 3825  c0 4173  ifcif 4344  𝒫 cpw 4416   cuni 4706   cint 4743  ran crn 5401  suc csuc 6025   Fn wfn 6177  wf 6178  1-1wf1 6179  cfv 6182  (class class class)co 6970  cmpo 6972  ωcom 7390  seq𝜔cseqom 7879  𝑚 cmap 8198
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1758  ax-4 1772  ax-5 1869  ax-6 1928  ax-7 1964  ax-8 2050  ax-9 2057  ax-10 2077  ax-11 2091  ax-12 2104  ax-13 2299  ax-ext 2745  ax-sep 5054  ax-nul 5061  ax-pow 5113  ax-pr 5180  ax-un 7273
This theorem depends on definitions:  df-bi 199  df-an 388  df-or 834  df-3or 1069  df-3an 1070  df-tru 1510  df-ex 1743  df-nf 1747  df-sb 2014  df-mo 2544  df-eu 2580  df-clab 2754  df-cleq 2765  df-clel 2840  df-nfc 2912  df-ne 2962  df-ral 3087  df-rex 3088  df-reu 3089  df-rab 3091  df-v 3411  df-sbc 3678  df-csb 3783  df-dif 3828  df-un 3830  df-in 3832  df-ss 3839  df-pss 3841  df-nul 4174  df-if 4345  df-pw 4418  df-sn 4436  df-pr 4438  df-tp 4440  df-op 4442  df-uni 4707  df-int 4744  df-iun 4788  df-br 4924  df-opab 4986  df-mpt 5003  df-tr 5025  df-id 5305  df-eprel 5310  df-po 5319  df-so 5320  df-fr 5359  df-we 5361  df-xp 5406  df-rel 5407  df-cnv 5408  df-co 5409  df-dm 5410  df-rn 5411  df-res 5412  df-ima 5413  df-pred 5980  df-ord 6026  df-on 6027  df-lim 6028  df-suc 6029  df-iota 6146  df-fun 6184  df-fn 6185  df-f 6186  df-f1 6187  df-fo 6188  df-f1o 6189  df-fv 6190  df-ov 6973  df-oprab 6974  df-mpo 6975  df-om 7391  df-2nd 7495  df-wrecs 7743  df-recs 7805  df-rdg 7843  df-seqom 7880  df-map 8200
This theorem is referenced by:  fin23lem21  9551
  Copyright terms: Public domain W3C validator