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

Theorem unblem4 9303
Description: Lemma for unbnn 9304. The function 𝐹 maps the set of natural numbers one-to-one to the set of unbounded natural numbers 𝐴. (Contributed by NM, 3-Dec-2003.)
Hypothesis
Ref Expression
unblem.2 𝐹 = (rec((𝑥 ∈ V ↦ (𝐴 ∖ suc 𝑥)), 𝐴) ↾ ω)
Assertion
Ref Expression
unblem4 ((𝐴 ⊆ ω ∧ ∀𝑤 ∈ ω ∃𝑣𝐴 𝑤𝑣) → 𝐹:ω–1-1𝐴)
Distinct variable groups:   𝑤,𝑣,𝑥,𝐴   𝑣,𝐹,𝑤
Allowed substitution hint:   𝐹(𝑥)

Proof of Theorem unblem4
Dummy variable 𝑧 is distinct from all other variables.
StepHypRef Expression
1 omsson 7865 . . . 4 ω ⊆ On
2 sstr 3967 . . . 4 ((𝐴 ⊆ ω ∧ ω ⊆ On) → 𝐴 ⊆ On)
31, 2mpan2 691 . . 3 (𝐴 ⊆ ω → 𝐴 ⊆ On)
43adantr 480 . 2 ((𝐴 ⊆ ω ∧ ∀𝑤 ∈ ω ∃𝑣𝐴 𝑤𝑣) → 𝐴 ⊆ On)
5 frfnom 8449 . . . 4 (rec((𝑥 ∈ V ↦ (𝐴 ∖ suc 𝑥)), 𝐴) ↾ ω) Fn ω
6 unblem.2 . . . . 5 𝐹 = (rec((𝑥 ∈ V ↦ (𝐴 ∖ suc 𝑥)), 𝐴) ↾ ω)
76fneq1i 6635 . . . 4 (𝐹 Fn ω ↔ (rec((𝑥 ∈ V ↦ (𝐴 ∖ suc 𝑥)), 𝐴) ↾ ω) Fn ω)
85, 7mpbir 231 . . 3 𝐹 Fn ω
96unblem2 9301 . . . 4 ((𝐴 ⊆ ω ∧ ∀𝑤 ∈ ω ∃𝑣𝐴 𝑤𝑣) → (𝑧 ∈ ω → (𝐹𝑧) ∈ 𝐴))
109ralrimiv 3131 . . 3 ((𝐴 ⊆ ω ∧ ∀𝑤 ∈ ω ∃𝑣𝐴 𝑤𝑣) → ∀𝑧 ∈ ω (𝐹𝑧) ∈ 𝐴)
11 ffnfv 7109 . . . 4 (𝐹:ω⟶𝐴 ↔ (𝐹 Fn ω ∧ ∀𝑧 ∈ ω (𝐹𝑧) ∈ 𝐴))
1211biimpri 228 . . 3 ((𝐹 Fn ω ∧ ∀𝑧 ∈ ω (𝐹𝑧) ∈ 𝐴) → 𝐹:ω⟶𝐴)
138, 10, 12sylancr 587 . 2 ((𝐴 ⊆ ω ∧ ∀𝑤 ∈ ω ∃𝑣𝐴 𝑤𝑣) → 𝐹:ω⟶𝐴)
146unblem3 9302 . . 3 ((𝐴 ⊆ ω ∧ ∀𝑤 ∈ ω ∃𝑣𝐴 𝑤𝑣) → (𝑧 ∈ ω → (𝐹𝑧) ∈ (𝐹‘suc 𝑧)))
1514ralrimiv 3131 . 2 ((𝐴 ⊆ ω ∧ ∀𝑤 ∈ ω ∃𝑣𝐴 𝑤𝑣) → ∀𝑧 ∈ ω (𝐹𝑧) ∈ (𝐹‘suc 𝑧))
16 omsmo 8670 . 2 (((𝐴 ⊆ On ∧ 𝐹:ω⟶𝐴) ∧ ∀𝑧 ∈ ω (𝐹𝑧) ∈ (𝐹‘suc 𝑧)) → 𝐹:ω–1-1𝐴)
174, 13, 15, 16syl21anc 837 1 ((𝐴 ⊆ ω ∧ ∀𝑤 ∈ ω ∃𝑣𝐴 𝑤𝑣) → 𝐹:ω–1-1𝐴)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395   = wceq 1540  wcel 2108  wral 3051  wrex 3060  Vcvv 3459  cdif 3923  wss 3926   cint 4922  cmpt 5201  cres 5656  Oncon0 6352  suc csuc 6354   Fn wfn 6526  wf 6527  1-1wf1 6528  cfv 6531  ωcom 7861  reccrdg 8423
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 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-11 2157  ax-12 2177  ax-ext 2707  ax-sep 5266  ax-nul 5276  ax-pr 5402  ax-un 7729
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2065  df-mo 2539  df-eu 2568  df-clab 2714  df-cleq 2727  df-clel 2809  df-nfc 2885  df-ne 2933  df-ral 3052  df-rex 3061  df-reu 3360  df-rab 3416  df-v 3461  df-sbc 3766  df-csb 3875  df-dif 3929  df-un 3931  df-in 3933  df-ss 3943  df-pss 3946  df-nul 4309  df-if 4501  df-pw 4577  df-sn 4602  df-pr 4604  df-op 4608  df-uni 4884  df-int 4923  df-iun 4969  df-br 5120  df-opab 5182  df-mpt 5202  df-tr 5230  df-id 5548  df-eprel 5553  df-po 5561  df-so 5562  df-fr 5606  df-we 5608  df-xp 5660  df-rel 5661  df-cnv 5662  df-co 5663  df-dm 5664  df-rn 5665  df-res 5666  df-ima 5667  df-pred 6290  df-ord 6355  df-on 6356  df-lim 6357  df-suc 6358  df-iota 6484  df-fun 6533  df-fn 6534  df-f 6535  df-f1 6536  df-fo 6537  df-f1o 6538  df-fv 6539  df-ov 7408  df-om 7862  df-2nd 7989  df-frecs 8280  df-wrecs 8311  df-recs 8385  df-rdg 8424
This theorem is referenced by:  unbnn  9304
  Copyright terms: Public domain W3C validator