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

Theorem unblem4 9190
Description: Lemma for unbnn 9191. 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 7809 . . . 4 ω ⊆ On
2 sstr 3939 . . . 4 ((𝐴 ⊆ ω ∧ ω ⊆ On) → 𝐴 ⊆ On)
31, 2mpan2 691 . . 3 (𝐴 ⊆ ω → 𝐴 ⊆ On)
43adantr 480 . 2 ((𝐴 ⊆ ω ∧ ∀𝑤 ∈ ω ∃𝑣𝐴 𝑤𝑣) → 𝐴 ⊆ On)
5 frfnom 8363 . . . 4 (rec((𝑥 ∈ V ↦ (𝐴 ∖ suc 𝑥)), 𝐴) ↾ ω) Fn ω
6 unblem.2 . . . . 5 𝐹 = (rec((𝑥 ∈ V ↦ (𝐴 ∖ suc 𝑥)), 𝐴) ↾ ω)
76fneq1i 6586 . . . 4 (𝐹 Fn ω ↔ (rec((𝑥 ∈ V ↦ (𝐴 ∖ suc 𝑥)), 𝐴) ↾ ω) Fn ω)
85, 7mpbir 231 . . 3 𝐹 Fn ω
96unblem2 9188 . . . 4 ((𝐴 ⊆ ω ∧ ∀𝑤 ∈ ω ∃𝑣𝐴 𝑤𝑣) → (𝑧 ∈ ω → (𝐹𝑧) ∈ 𝐴))
109ralrimiv 3124 . . 3 ((𝐴 ⊆ ω ∧ ∀𝑤 ∈ ω ∃𝑣𝐴 𝑤𝑣) → ∀𝑧 ∈ ω (𝐹𝑧) ∈ 𝐴)
11 ffnfv 7061 . . . 4 (𝐹:ω⟶𝐴 ↔ (𝐹 Fn ω ∧ ∀𝑧 ∈ ω (𝐹𝑧) ∈ 𝐴))
1211biimpri 228 . . 3 ((𝐹 Fn ω ∧ ∀𝑧 ∈ ω (𝐹𝑧) ∈ 𝐴) → 𝐹:ω⟶𝐴)
138, 10, 12sylancr 587 . 2 ((𝐴 ⊆ ω ∧ ∀𝑤 ∈ ω ∃𝑣𝐴 𝑤𝑣) → 𝐹:ω⟶𝐴)
146unblem3 9189 . . 3 ((𝐴 ⊆ ω ∧ ∀𝑤 ∈ ω ∃𝑣𝐴 𝑤𝑣) → (𝑧 ∈ ω → (𝐹𝑧) ∈ (𝐹‘suc 𝑧)))
1514ralrimiv 3124 . 2 ((𝐴 ⊆ ω ∧ ∀𝑤 ∈ ω ∃𝑣𝐴 𝑤𝑣) → ∀𝑧 ∈ ω (𝐹𝑧) ∈ (𝐹‘suc 𝑧))
16 omsmo 8582 . 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 1541  wcel 2113  wral 3048  wrex 3057  Vcvv 3437  cdif 3895  wss 3898   cint 4899  cmpt 5176  cres 5623  Oncon0 6314  suc csuc 6316   Fn wfn 6484  wf 6485  1-1wf1 6486  cfv 6489  ωcom 7805  reccrdg 8337
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-10 2146  ax-11 2162  ax-12 2182  ax-ext 2705  ax-sep 5238  ax-nul 5248  ax-pr 5374  ax-un 7677
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-mo 2537  df-eu 2566  df-clab 2712  df-cleq 2725  df-clel 2808  df-nfc 2882  df-ne 2930  df-ral 3049  df-rex 3058  df-reu 3348  df-rab 3397  df-v 3439  df-sbc 3738  df-csb 3847  df-dif 3901  df-un 3903  df-in 3905  df-ss 3915  df-pss 3918  df-nul 4283  df-if 4477  df-pw 4553  df-sn 4578  df-pr 4580  df-op 4584  df-uni 4861  df-int 4900  df-iun 4945  df-br 5096  df-opab 5158  df-mpt 5177  df-tr 5203  df-id 5516  df-eprel 5521  df-po 5529  df-so 5530  df-fr 5574  df-we 5576  df-xp 5627  df-rel 5628  df-cnv 5629  df-co 5630  df-dm 5631  df-rn 5632  df-res 5633  df-ima 5634  df-pred 6256  df-ord 6317  df-on 6318  df-lim 6319  df-suc 6320  df-iota 6445  df-fun 6491  df-fn 6492  df-f 6493  df-f1 6494  df-fo 6495  df-f1o 6496  df-fv 6497  df-ov 7358  df-om 7806  df-2nd 7931  df-frecs 8220  df-wrecs 8251  df-recs 8300  df-rdg 8338
This theorem is referenced by:  unbnn  9191
  Copyright terms: Public domain W3C validator