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

Theorem fin23lem35 10335
Description: Lemma for fin23 10377. Strict order property of 𝑌. (Contributed by Stefan O'Rear, 2-Nov-2014.)
Hypotheses
Ref Expression
fin23lem33.f 𝐹 = {𝑔 ∣ ∀𝑎 ∈ (𝒫 𝑔m ω)(∀𝑥 ∈ ω (𝑎‘suc 𝑥) ⊆ (𝑎𝑥) → ran 𝑎 ∈ ran 𝑎)}
fin23lem.f (𝜑:ω–1-1→V)
fin23lem.g (𝜑 ran 𝐺)
fin23lem.h (𝜑 → ∀𝑗((𝑗:ω–1-1→V ∧ ran 𝑗𝐺) → ((𝑖𝑗):ω–1-1→V ∧ ran (𝑖𝑗) ⊊ ran 𝑗)))
fin23lem.i 𝑌 = (rec(𝑖, ) ↾ ω)
Assertion
Ref Expression
fin23lem35 ((𝜑𝐴 ∈ ω) → ran (𝑌‘suc 𝐴) ⊊ ran (𝑌𝐴))
Distinct variable groups:   𝑔,𝑎,𝑖,𝑗,𝑥   𝐴,𝑎,𝑗   ,𝑎,𝐺,𝑔,𝑖,𝑗,𝑥   𝐹,𝑎   𝜑,𝑎,𝑗   𝑌,𝑎,𝑗
Allowed substitution hints:   𝜑(𝑥, 𝑔, , 𝑖)   𝐴(𝑥, 𝑔, , 𝑖)   𝐹(𝑥, 𝑔, , 𝑖, 𝑗)   𝑌(𝑥, 𝑔, , 𝑖)

Proof of Theorem fin23lem35
StepHypRef Expression
1 fin23lem33.f . . . . 5 𝐹 = {𝑔 ∣ ∀𝑎 ∈ (𝒫 𝑔m ω)(∀𝑥 ∈ ω (𝑎‘suc 𝑥) ⊆ (𝑎𝑥) → ran 𝑎 ∈ ran 𝑎)}
2 fin23lem.f . . . . 5 (𝜑:ω–1-1→V)
3 fin23lem.g . . . . 5 (𝜑 ran 𝐺)
4 fin23lem.h . . . . 5 (𝜑 → ∀𝑗((𝑗:ω–1-1→V ∧ ran 𝑗𝐺) → ((𝑖𝑗):ω–1-1→V ∧ ran (𝑖𝑗) ⊊ ran 𝑗)))
5 fin23lem.i . . . . 5 𝑌 = (rec(𝑖, ) ↾ ω)
61, 2, 3, 4, 5fin23lem34 10334 . . . 4 ((𝜑𝐴 ∈ ω) → ((𝑌𝐴):ω–1-1→V ∧ ran (𝑌𝐴) ⊆ 𝐺))
7 fvex 6894 . . . . . . 7 (𝑌𝐴) ∈ V
8 f1eq1 6769 . . . . . . . . 9 (𝑗 = (𝑌𝐴) → (𝑗:ω–1-1→V ↔ (𝑌𝐴):ω–1-1→V))
9 rneq 5926 . . . . . . . . . . 11 (𝑗 = (𝑌𝐴) → ran 𝑗 = ran (𝑌𝐴))
109unieqd 4885 . . . . . . . . . 10 (𝑗 = (𝑌𝐴) → ran 𝑗 = ran (𝑌𝐴))
1110sseq1d 3968 . . . . . . . . 9 (𝑗 = (𝑌𝐴) → ( ran 𝑗𝐺 ran (𝑌𝐴) ⊆ 𝐺))
128, 11anbi12d 643 . . . . . . . 8 (𝑗 = (𝑌𝐴) → ((𝑗:ω–1-1→V ∧ ran 𝑗𝐺) ↔ ((𝑌𝐴):ω–1-1→V ∧ ran (𝑌𝐴) ⊆ 𝐺)))
13 fveq2 6881 . . . . . . . . . 10 (𝑗 = (𝑌𝐴) → (𝑖𝑗) = (𝑖‘(𝑌𝐴)))
14 f1eq1 6769 . . . . . . . . . 10 ((𝑖𝑗) = (𝑖‘(𝑌𝐴)) → ((𝑖𝑗):ω–1-1→V ↔ (𝑖‘(𝑌𝐴)):ω–1-1→V))
1513, 14syl 18 . . . . . . . . 9 (𝑗 = (𝑌𝐴) → ((𝑖𝑗):ω–1-1→V ↔ (𝑖‘(𝑌𝐴)):ω–1-1→V))
1613rneqd 5928 . . . . . . . . . . 11 (𝑗 = (𝑌𝐴) → ran (𝑖𝑗) = ran (𝑖‘(𝑌𝐴)))
1716unieqd 4885 . . . . . . . . . 10 (𝑗 = (𝑌𝐴) → ran (𝑖𝑗) = ran (𝑖‘(𝑌𝐴)))
1817, 10psseq12d 4051 . . . . . . . . 9 (𝑗 = (𝑌𝐴) → ( ran (𝑖𝑗) ⊊ ran 𝑗 ran (𝑖‘(𝑌𝐴)) ⊊ ran (𝑌𝐴)))
1915, 18anbi12d 643 . . . . . . . 8 (𝑗 = (𝑌𝐴) → (((𝑖𝑗):ω–1-1→V ∧ ran (𝑖𝑗) ⊊ ran 𝑗) ↔ ((𝑖‘(𝑌𝐴)):ω–1-1→V ∧ ran (𝑖‘(𝑌𝐴)) ⊊ ran (𝑌𝐴))))
2012, 19imbi12d 347 . . . . . . 7 (𝑗 = (𝑌𝐴) → (((𝑗:ω–1-1→V ∧ ran 𝑗𝐺) → ((𝑖𝑗):ω–1-1→V ∧ ran (𝑖𝑗) ⊊ ran 𝑗)) ↔ (((𝑌𝐴):ω–1-1→V ∧ ran (𝑌𝐴) ⊆ 𝐺) → ((𝑖‘(𝑌𝐴)):ω–1-1→V ∧ ran (𝑖‘(𝑌𝐴)) ⊊ ran (𝑌𝐴)))))
217, 20spcv 3564 . . . . . 6 (∀𝑗((𝑗:ω–1-1→V ∧ ran 𝑗𝐺) → ((𝑖𝑗):ω–1-1→V ∧ ran (𝑖𝑗) ⊊ ran 𝑗)) → (((𝑌𝐴):ω–1-1→V ∧ ran (𝑌𝐴) ⊆ 𝐺) → ((𝑖‘(𝑌𝐴)):ω–1-1→V ∧ ran (𝑖‘(𝑌𝐴)) ⊊ ran (𝑌𝐴))))
224, 21syl 18 . . . . 5 (𝜑 → (((𝑌𝐴):ω–1-1→V ∧ ran (𝑌𝐴) ⊆ 𝐺) → ((𝑖‘(𝑌𝐴)):ω–1-1→V ∧ ran (𝑖‘(𝑌𝐴)) ⊊ ran (𝑌𝐴))))
2322adantr 485 . . . 4 ((𝜑𝐴 ∈ ω) → (((𝑌𝐴):ω–1-1→V ∧ ran (𝑌𝐴) ⊆ 𝐺) → ((𝑖‘(𝑌𝐴)):ω–1-1→V ∧ ran (𝑖‘(𝑌𝐴)) ⊊ ran (𝑌𝐴))))
246, 23mpd 16 . . 3 ((𝜑𝐴 ∈ ω) → ((𝑖‘(𝑌𝐴)):ω–1-1→V ∧ ran (𝑖‘(𝑌𝐴)) ⊊ ran (𝑌𝐴)))
2524simprd 500 . 2 ((𝜑𝐴 ∈ ω) → ran (𝑖‘(𝑌𝐴)) ⊊ ran (𝑌𝐴))
26 frsuc 8420 . . . . . . 7 (𝐴 ∈ ω → ((rec(𝑖, ) ↾ ω)‘suc 𝐴) = (𝑖‘((rec(𝑖, ) ↾ ω)‘𝐴)))
2726adantl 486 . . . . . 6 ((𝜑𝐴 ∈ ω) → ((rec(𝑖, ) ↾ ω)‘suc 𝐴) = (𝑖‘((rec(𝑖, ) ↾ ω)‘𝐴)))
285fveq1i 6882 . . . . . 6 (𝑌‘suc 𝐴) = ((rec(𝑖, ) ↾ ω)‘suc 𝐴)
295fveq1i 6882 . . . . . . 7 (𝑌𝐴) = ((rec(𝑖, ) ↾ ω)‘𝐴)
3029fveq2i 6884 . . . . . 6 (𝑖‘(𝑌𝐴)) = (𝑖‘((rec(𝑖, ) ↾ ω)‘𝐴))
3127, 28, 303eqtr4g 2823 . . . . 5 ((𝜑𝐴 ∈ ω) → (𝑌‘suc 𝐴) = (𝑖‘(𝑌𝐴)))
3231rneqd 5928 . . . 4 ((𝜑𝐴 ∈ ω) → ran (𝑌‘suc 𝐴) = ran (𝑖‘(𝑌𝐴)))
3332unieqd 4885 . . 3 ((𝜑𝐴 ∈ ω) → ran (𝑌‘suc 𝐴) = ran (𝑖‘(𝑌𝐴)))
3433psseq1d 4049 . 2 ((𝜑𝐴 ∈ ω) → ( ran (𝑌‘suc 𝐴) ⊊ ran (𝑌𝐴) ↔ ran (𝑖‘(𝑌𝐴)) ⊊ ran (𝑌𝐴)))
3525, 34mpbird 260 1 ((𝜑𝐴 ∈ ω) → ran (𝑌‘suc 𝐴) ⊊ ran (𝑌𝐴))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wi 4  wb 209  wa 400  wal 1568   = wceq 1570  wcel 2143  {cab 2741  wral 3079  Vcvv 3455  wss 3905  wpss 3906  𝒫 cpw 4562   cuni 4872   cint 4912  ran crn 5662  cres 5663  suc csuc 6362  1-1wf1 6533  cfv 6536  (class class class)co 7410  ωcom 7858  reccrdg 8392  m cmap 8820
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-10 2176  ax-11 2192  ax-12 2213  ax-ext 2735  ax-sep 5257  ax-nul 5269  ax-pr 5404  ax-un 7732
This proof depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1810  df-nf 1814  df-sb 2097  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2838  df-nfc 2912  df-ne 2959  df-ral 3080  df-rex 3090  df-reu 3370  df-rab 3417  df-v 3457  df-sbc 3745  df-csb 3854  df-dif 3908  df-un 3910  df-in 3912  df-ss 3922  df-pss 3925  df-nul 4287  df-if 4488  df-pw 4564  df-sn 4590  df-pr 4592  df-op 4596  df-uni 4873  df-iun 4958  df-br 5110  df-opab 5174  df-mpt 5193  df-tr 5219  df-id 5556  df-eprel 5561  df-po 5569  df-so 5570  df-fr 5614  df-we 5616  df-xp 5667  df-rel 5668  df-cnv 5669  df-co 5670  df-dm 5671  df-rn 5672  df-res 5673  df-ima 5674  df-pred 6302  df-ord 6363  df-on 6364  df-lim 6365  df-suc 6366  df-iota 6492  df-fun 6538  df-fn 6539  df-f 6540  df-f1 6541  df-fo 6542  df-f1o 6543  df-fv 6544  df-ov 7413  df-om 7859  df-2nd 7983  df-frecs 8274  df-wrecs 8305  df-recs 8354  df-rdg 8393
This theorem is used by:  fin23lem36  10336  fin23lem38  10337  fin23lem39  10338
  Copyright terms: Public domain W3C validator