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

Theorem isf33lem 10288
Description: Lemma for isfin3-3 10290. (Contributed by Stefan O'Rear, 17-May-2015.)
Assertion
Ref Expression
isf33lem FinIII = {𝑔 ∣ ∀𝑎 ∈ (𝒫 𝑔m ω)(∀𝑥 ∈ ω (𝑎‘suc 𝑥) ⊆ (𝑎𝑥) → ran 𝑎 ∈ ran 𝑎)}
Distinct variable group:   𝑔,𝑎,𝑥

Proof of Theorem isf33lem
Dummy variables 𝑏 𝑓 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 isfin32i 10287 . . . 4 (𝑓 ∈ FinIII → ¬ ω ≼* 𝑓)
2 fveq1 6841 . . . . . . . . . . 11 (𝑎 = 𝑏 → (𝑎‘suc 𝑥) = (𝑏‘suc 𝑥))
3 fveq1 6841 . . . . . . . . . . 11 (𝑎 = 𝑏 → (𝑎𝑥) = (𝑏𝑥))
42, 3sseq12d 3969 . . . . . . . . . 10 (𝑎 = 𝑏 → ((𝑎‘suc 𝑥) ⊆ (𝑎𝑥) ↔ (𝑏‘suc 𝑥) ⊆ (𝑏𝑥)))
54ralbidv 3161 . . . . . . . . 9 (𝑎 = 𝑏 → (∀𝑥 ∈ ω (𝑎‘suc 𝑥) ⊆ (𝑎𝑥) ↔ ∀𝑥 ∈ ω (𝑏‘suc 𝑥) ⊆ (𝑏𝑥)))
6 rneq 5893 . . . . . . . . . . 11 (𝑎 = 𝑏 → ran 𝑎 = ran 𝑏)
76inteqd 4909 . . . . . . . . . 10 (𝑎 = 𝑏 ran 𝑎 = ran 𝑏)
87, 6eleq12d 2831 . . . . . . . . 9 (𝑎 = 𝑏 → ( ran 𝑎 ∈ ran 𝑎 ran 𝑏 ∈ ran 𝑏))
95, 8imbi12d 344 . . . . . . . 8 (𝑎 = 𝑏 → ((∀𝑥 ∈ ω (𝑎‘suc 𝑥) ⊆ (𝑎𝑥) → ran 𝑎 ∈ ran 𝑎) ↔ (∀𝑥 ∈ ω (𝑏‘suc 𝑥) ⊆ (𝑏𝑥) → ran 𝑏 ∈ ran 𝑏)))
109cbvralvw 3216 . . . . . . 7 (∀𝑎 ∈ (𝒫 𝑔m ω)(∀𝑥 ∈ ω (𝑎‘suc 𝑥) ⊆ (𝑎𝑥) → ran 𝑎 ∈ ran 𝑎) ↔ ∀𝑏 ∈ (𝒫 𝑔m ω)(∀𝑥 ∈ ω (𝑏‘suc 𝑥) ⊆ (𝑏𝑥) → ran 𝑏 ∈ ran 𝑏))
11 pweq 4570 . . . . . . . . 9 (𝑔 = 𝑦 → 𝒫 𝑔 = 𝒫 𝑦)
1211oveq1d 7383 . . . . . . . 8 (𝑔 = 𝑦 → (𝒫 𝑔m ω) = (𝒫 𝑦m ω))
1312raleqdv 3298 . . . . . . 7 (𝑔 = 𝑦 → (∀𝑏 ∈ (𝒫 𝑔m ω)(∀𝑥 ∈ ω (𝑏‘suc 𝑥) ⊆ (𝑏𝑥) → ran 𝑏 ∈ ran 𝑏) ↔ ∀𝑏 ∈ (𝒫 𝑦m ω)(∀𝑥 ∈ ω (𝑏‘suc 𝑥) ⊆ (𝑏𝑥) → ran 𝑏 ∈ ran 𝑏)))
1410, 13bitrid 283 . . . . . 6 (𝑔 = 𝑦 → (∀𝑎 ∈ (𝒫 𝑔m ω)(∀𝑥 ∈ ω (𝑎‘suc 𝑥) ⊆ (𝑎𝑥) → ran 𝑎 ∈ ran 𝑎) ↔ ∀𝑏 ∈ (𝒫 𝑦m ω)(∀𝑥 ∈ ω (𝑏‘suc 𝑥) ⊆ (𝑏𝑥) → ran 𝑏 ∈ ran 𝑏)))
1514cbvabv 2807 . . . . 5 {𝑔 ∣ ∀𝑎 ∈ (𝒫 𝑔m ω)(∀𝑥 ∈ ω (𝑎‘suc 𝑥) ⊆ (𝑎𝑥) → ran 𝑎 ∈ ran 𝑎)} = {𝑦 ∣ ∀𝑏 ∈ (𝒫 𝑦m ω)(∀𝑥 ∈ ω (𝑏‘suc 𝑥) ⊆ (𝑏𝑥) → ran 𝑏 ∈ ran 𝑏)}
1615isf32lem12 10286 . . . 4 (𝑓 ∈ FinIII → (¬ ω ≼* 𝑓𝑓 ∈ {𝑔 ∣ ∀𝑎 ∈ (𝒫 𝑔m ω)(∀𝑥 ∈ ω (𝑎‘suc 𝑥) ⊆ (𝑎𝑥) → ran 𝑎 ∈ ran 𝑎)}))
171, 16mpd 15 . . 3 (𝑓 ∈ FinIII𝑓 ∈ {𝑔 ∣ ∀𝑎 ∈ (𝒫 𝑔m ω)(∀𝑥 ∈ ω (𝑎‘suc 𝑥) ⊆ (𝑎𝑥) → ran 𝑎 ∈ ran 𝑎)})
1810abbii 2804 . . . 4 {𝑔 ∣ ∀𝑎 ∈ (𝒫 𝑔m ω)(∀𝑥 ∈ ω (𝑎‘suc 𝑥) ⊆ (𝑎𝑥) → ran 𝑎 ∈ ran 𝑎)} = {𝑔 ∣ ∀𝑏 ∈ (𝒫 𝑔m ω)(∀𝑥 ∈ ω (𝑏‘suc 𝑥) ⊆ (𝑏𝑥) → ran 𝑏 ∈ ran 𝑏)}
1918fin23lem41 10274 . . 3 (𝑓 ∈ {𝑔 ∣ ∀𝑎 ∈ (𝒫 𝑔m ω)(∀𝑥 ∈ ω (𝑎‘suc 𝑥) ⊆ (𝑎𝑥) → ran 𝑎 ∈ ran 𝑎)} → 𝑓 ∈ FinIII)
2017, 19impbii 209 . 2 (𝑓 ∈ FinIII𝑓 ∈ {𝑔 ∣ ∀𝑎 ∈ (𝒫 𝑔m ω)(∀𝑥 ∈ ω (𝑎‘suc 𝑥) ⊆ (𝑎𝑥) → ran 𝑎 ∈ ran 𝑎)})
2120eqriv 2734 1 FinIII = {𝑔 ∣ ∀𝑎 ∈ (𝒫 𝑔m ω)(∀𝑥 ∈ ω (𝑎‘suc 𝑥) ⊆ (𝑎𝑥) → ran 𝑎 ∈ ran 𝑎)}
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4   = wceq 1542  wcel 2114  {cab 2715  wral 3052  wss 3903  𝒫 cpw 4556   cint 4904   class class class wbr 5100  ran crn 5633  suc csuc 6327  cfv 6500  (class class class)co 7368  ωcom 7818  m cmap 8775  * cwdom 9481  FinIIIcfin3 10203
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 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-rep 5226  ax-sep 5243  ax-nul 5253  ax-pow 5312  ax-pr 5379  ax-un 7690
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3or 1088  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-ral 3053  df-rex 3063  df-rmo 3352  df-reu 3353  df-rab 3402  df-v 3444  df-sbc 3743  df-csb 3852  df-dif 3906  df-un 3908  df-in 3910  df-ss 3920  df-pss 3923  df-nul 4288  df-if 4482  df-pw 4558  df-sn 4583  df-pr 4585  df-op 4589  df-uni 4866  df-int 4905  df-iun 4950  df-br 5101  df-opab 5163  df-mpt 5182  df-tr 5208  df-id 5527  df-eprel 5532  df-po 5540  df-so 5541  df-fr 5585  df-se 5586  df-we 5587  df-xp 5638  df-rel 5639  df-cnv 5640  df-co 5641  df-dm 5642  df-rn 5643  df-res 5644  df-ima 5645  df-pred 6267  df-ord 6328  df-on 6329  df-lim 6330  df-suc 6331  df-iota 6456  df-fun 6502  df-fn 6503  df-f 6504  df-f1 6505  df-fo 6506  df-f1o 6507  df-fv 6508  df-isom 6509  df-riota 7325  df-ov 7371  df-oprab 7372  df-mpo 7373  df-om 7819  df-1st 7943  df-2nd 7944  df-frecs 8233  df-wrecs 8264  df-recs 8313  df-rdg 8351  df-seqom 8389  df-1o 8407  df-er 8645  df-map 8777  df-en 8896  df-dom 8897  df-sdom 8898  df-fin 8899  df-wdom 9482  df-card 9863  df-fin4 10209  df-fin3 10210
This theorem is referenced by:  isfin3-2  10289  isfin3-3  10290  fin23  10311
  Copyright terms: Public domain W3C validator