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

Theorem fin23lem17 10455
Description: Lemma for fin23 10506. 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 10449 . . 3 (𝑐 ∈ ω → (𝑈‘suc 𝑐) ⊆ (𝑈‘𝑐))
32rgen 3082 . 2 ∀𝑐 ∈ ω (𝑈‘suc 𝑐) ⊆ (𝑈‘𝑐)
4 fveq1 6915 . . . . . 6 (𝑏 = 𝑈 → (𝑏‘suc 𝑐) = (𝑈‘suc 𝑐))
5 fveq1 6915 . . . . . 6 (𝑏 = 𝑈 → (𝑏‘𝑐) = (𝑈‘𝑐))
64, 5sseq12d 3946 . . . . 5 (𝑏 = 𝑈 → ((𝑏‘suc 𝑐) ⊆ (𝑏‘𝑐) ↔ (𝑈‘suc 𝑐) ⊆ (𝑈‘𝑐)))
76ralbidv 3189 . . . 4 (𝑏 = 𝑈 → (∀𝑐 ∈ ω (𝑏‘suc 𝑐) ⊆ (𝑏‘𝑐) ↔ ∀𝑐 ∈ ω (𝑈‘suc 𝑐) ⊆ (𝑈‘𝑐)))
8 rneq 5930 . . . . . 6 (𝑏 = 𝑈 → ran 𝑏 = ran 𝑈)
98inteqd 4917 . . . . 5 (𝑏 = 𝑈 → ∩ ran 𝑏 = ∩ ran 𝑈)
109, 8eleq12d 2858 . . . 4 (𝑏 = 𝑈 → (∩ ran 𝑏 ∈ ran 𝑏 ↔ ∩ ran 𝑈 ∈ ran 𝑈))
117, 10imbi12d 347 . . 3 (𝑏 = 𝑈 → ((∀𝑐 ∈ ω (𝑏‘suc 𝑐) ⊆ (𝑏‘𝑐) → ∩ ran 𝑏 ∈ ran 𝑏) ↔ (∀𝑐 ∈ ω (𝑈‘suc 𝑐) ⊆ (𝑈‘𝑐) → ∩ ran 𝑈 ∈ ran 𝑈)))
12 fin23lem17.f . . . . . 6 𝐹 = {𝑔 ∣ ∀𝑎 ∈ (𝒫 𝑔 ↑m ω)(∀𝑥 ∈ ω (𝑎‘suc 𝑥) ⊆ (𝑎‘𝑥) → ∩ ran 𝑎 ∈ ran 𝑎)}
1312isfin3ds 10446 . . . . 5 (∪ ran 𝑡 ∈ 𝐹 → (∪ ran 𝑡 ∈ 𝐹 ↔ ∀𝑏 ∈ (𝒫 ∪ ran 𝑡 ↑m ω)(∀𝑐 ∈ ω (𝑏‘suc 𝑐) ⊆ (𝑏‘𝑐) → ∩ ran 𝑏 ∈ ran 𝑏)))
1413ibi 270 . . . 4 (∪ ran 𝑡 ∈ 𝐹 → ∀𝑏 ∈ (𝒫 ∪ ran 𝑡 ↑m ω)(∀𝑐 ∈ ω (𝑏‘suc 𝑐) ⊆ (𝑏‘𝑐) → ∩ ran 𝑏 ∈ ran 𝑏))
1514adantr 486 . . 3 ((∪ ran 𝑡 ∈ 𝐹 ∧ 𝑡:ω⟶1-1𝑉) → ∀𝑏 ∈ (𝒫 ∪ ran 𝑡 ↑m ω)(∀𝑐 ∈ ω (𝑏‘suc 𝑐) ⊆ (𝑏‘𝑐) → ∩ ran 𝑏 ∈ ran 𝑏))
161fnseqom 8503 . . . . . 6 𝑈 Fn ω
17 dffn3 6752 . . . . . 6 (𝑈 Fn ω ↔ 𝑈:ω⟶ran 𝑈)
1816, 17mpbi 233 . . . . 5 𝑈:ω⟶ran 𝑈
19 pwuni 4911 . . . . . 6 ran 𝑈 ⊆ 𝒫 ∪ ran 𝑈
201fin23lem16 10452 . . . . . . 7 ∪ ran 𝑈 = ∪ ran 𝑡
2120pweqi 4576 . . . . . 6 𝒫 ∪ ran 𝑈 = 𝒫 ∪ ran 𝑡
2219, 21sseqtri 3961 . . . . 5 ran 𝑈 ⊆ 𝒫 ∪ ran 𝑡
23 fss 6756 . . . . 5 ((𝑈:ω⟶ran 𝑈 ∧ ran 𝑈 ⊆ 𝒫 ∪ ran 𝑡) → 𝑈:ω⟶𝒫 ∪ ran 𝑡)
2418, 22, 23mp2an 705 . . . 4 𝑈:ω⟶𝒫 ∪ ran 𝑡
25 vex 3458 . . . . . . . 8 𝑡 ∈ V
2625rnex 7956 . . . . . . 7 ran 𝑡 ∈ V
2726uniex 7790 . . . . . 6 ∪ ran 𝑡 ∈ V
2827pwex 5349 . . . . 5 𝒫 ∪ ran 𝑡 ∈ V
29 f1f 6808 . . . . . . 7 (𝑡:ω⟶1-1𝑉 → 𝑡:ω⟶𝑉)
30 dmfex 7951 . . . . . . 7 ((𝑡 ∈ V ∧ 𝑡:ω⟶𝑉) → ω ∈ V)
3125, 29, 30sylancr 599 . . . . . 6 (𝑡:ω⟶1-1𝑉 → ω ∈ V)
3231adantl 487 . . . . 5 ((∪ ran 𝑡 ∈ 𝐹 ∧ 𝑡:ω⟶1-1𝑉) → ω ∈ V)
33 elmapg 8897 . . . . 5 ((𝒫 ∪ ran 𝑡 ∈ V ∧ ω ∈ V) → (𝑈 ∈ (𝒫 ∪ ran 𝑡 ↑m ω) ↔ 𝑈:ω⟶𝒫 ∪ ran 𝑡))
3428, 32, 33sylancr 599 . . . 4 ((∪ ran 𝑡 ∈ 𝐹 ∧ 𝑡:ω⟶1-1𝑉) → (𝑈 ∈ (𝒫 ∪ ran 𝑡 ↑m ω) ↔ 𝑈:ω⟶𝒫 ∪ ran 𝑡))
3524, 34mpbiri 261 . . 3 ((∪ ran 𝑡 ∈ 𝐹 ∧ 𝑡:ω⟶1-1𝑉) → 𝑈 ∈ (𝒫 ∪ ran 𝑡 ↑m ω))
3611, 15, 35rspcdva 3581 . 2 ((∪ ran 𝑡 ∈ 𝐹 ∧ 𝑡:ω⟶1-1𝑉) → (∀𝑐 ∈ ω (𝑈‘suc 𝑐) ⊆ (𝑈‘𝑐) → ∩ ran 𝑈 ∈ ran 𝑈))
373, 36mpi 21 1 ((∪ ran 𝑡 ∈ 𝐹 ∧ 𝑡:ω⟶1-1𝑉) → ∩ ran 𝑈 ∈ ran 𝑈)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2147  {cab 2741  ∀wral 3080  Vcvv 3454   ⊆ wss 3900   ∩ cin 4092  ∅c0 4281  ifcif 4485  𝒫 cpw 4560  ∪ cuni 4872  ∩ cint 4912  ran crn 5659  suc csuc 6390   Fn wfn 6561  ⟶wf 6562  ⟶1-1wf1 6563  ‘cfv 6566  (class class class)co 7451   ∈ cmpo 7453  ωcom 7911  seqωcseqom 8495   ↑m cmap 8885
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-sep 5255  ax-nul 5266  ax-pow 5334  ax-pr 5398  ax-un 7783
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-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 4841  df-uni 4873  df-int 4913  df-iun 4958  df-br 5109  df-opab 5174  df-mpt 5193  df-tr 5219  df-id 5553  df-eprel 5558  df-po 5566  df-so 5567  df-fr 5611  df-we 5613  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-res 5670  df-ima 5671  df-pred 6330  df-ord 6391  df-on 6392  df-lim 6393  df-suc 6394  df-iota 6520  df-fun 6568  df-fn 6569  df-f 6570  df-f1 6571  df-fo 6572  df-f1o 6573  df-fv 6574  df-ov 7454  df-oprab 7455  df-mpo 7456  df-om 7912  df-2nd 8036  df-frecs 8337  df-wrecs 8368  df-recs 8417  df-rdg 8456  df-seqom 8496  df-map 8887
This theorem is used by:  fin23lem21  10456
  Copyright terms: Public domain W3C validator