| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > om2uzf1oi | Structured version Visualization version GIF version | ||
| Description: 𝐺 (see om2uz0i 14130) is a one-to-one onto mapping. (Contributed by NM, 3-Oct-2004.) (Revised by Mario Carneiro, 13-Sep-2013.) |
| Ref | Expression |
|---|---|
| om2uz.1 | ⊢ 𝐶 ∈ ℤ |
| om2uz.2 | ⊢ 𝐺 = (rec((𝑥 ∈ V ↦ (𝑥 + 1)), 𝐶) ↾ ω) |
| Ref | Expression |
|---|---|
| om2uzf1oi | ⊢ 𝐺:ω⟶1-1onto(ℤ≥‘𝐶) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | frfnom 8481 | . . . . 5 ⊢ (rec((𝑥 ∈ V ↦ (𝑥 + 1)), 𝐶) ↾ ω) Fn ω | |
| 2 | om2uz.2 | . . . . . 6 ⊢ 𝐺 = (rec((𝑥 ∈ V ↦ (𝑥 + 1)), 𝐶) ↾ ω) | |
| 3 | 2 | fneq1i 6666 | . . . . 5 ⊢ (𝐺 Fn ω ↔ (rec((𝑥 ∈ V ↦ (𝑥 + 1)), 𝐶) ↾ ω) Fn ω) |
| 4 | 1, 3 | mpbir 234 | . . . 4 ⊢ 𝐺 Fn ω |
| 5 | om2uz.1 | . . . . . 6 ⊢ 𝐶 ∈ ℤ | |
| 6 | 5, 2 | om2uzrani 14135 | . . . . 5 ⊢ ran 𝐺 = (ℤ≥‘𝐶) |
| 7 | 6 | eqimssi 3973 | . . . 4 ⊢ ran 𝐺 ⊆ (ℤ≥‘𝐶) |
| 8 | df-f 6570 | . . . 4 ⊢ (𝐺:ω⟶(ℤ≥‘𝐶) ↔ (𝐺 Fn ω ∧ ran 𝐺 ⊆ (ℤ≥‘𝐶))) | |
| 9 | 4, 7, 8 | mpbir2an 724 | . . 3 ⊢ 𝐺:ω⟶(ℤ≥‘𝐶) |
| 10 | 5, 2 | om2uzuzi 14132 | . . . . . . . . 9 ⊢ (𝑦 ∈ ω → (𝐺‘𝑦) ∈ (ℤ≥‘𝐶)) |
| 11 | eluzelz 13015 | . . . . . . . . 9 ⊢ ((𝐺‘𝑦) ∈ (ℤ≥‘𝐶) → (𝐺‘𝑦) ∈ ℤ) | |
| 12 | 10, 11 | syl 18 | . . . . . . . 8 ⊢ (𝑦 ∈ ω → (𝐺‘𝑦) ∈ ℤ) |
| 13 | 12 | zred 12843 | . . . . . . 7 ⊢ (𝑦 ∈ ω → (𝐺‘𝑦) ∈ ℝ) |
| 14 | 5, 2 | om2uzuzi 14132 | . . . . . . . . 9 ⊢ (𝑧 ∈ ω → (𝐺‘𝑧) ∈ (ℤ≥‘𝐶)) |
| 15 | eluzelz 13015 | . . . . . . . . 9 ⊢ ((𝐺‘𝑧) ∈ (ℤ≥‘𝐶) → (𝐺‘𝑧) ∈ ℤ) | |
| 16 | 14, 15 | syl 18 | . . . . . . . 8 ⊢ (𝑧 ∈ ω → (𝐺‘𝑧) ∈ ℤ) |
| 17 | 16 | zred 12843 | . . . . . . 7 ⊢ (𝑧 ∈ ω → (𝐺‘𝑧) ∈ ℝ) |
| 18 | lttri3 11432 | . . . . . . 7 ⊢ (((𝐺‘𝑦) ∈ ℝ ∧ (𝐺‘𝑧) ∈ ℝ) → ((𝐺‘𝑦) = (𝐺‘𝑧) ↔ (¬ (𝐺‘𝑦) < (𝐺‘𝑧) ∧ ¬ (𝐺‘𝑧) < (𝐺‘𝑦)))) | |
| 19 | 13, 17, 18 | syl2an 608 | . . . . . 6 ⊢ ((𝑦 ∈ ω ∧ 𝑧 ∈ ω) → ((𝐺‘𝑦) = (𝐺‘𝑧) ↔ (¬ (𝐺‘𝑦) < (𝐺‘𝑧) ∧ ¬ (𝐺‘𝑧) < (𝐺‘𝑦)))) |
| 20 | ioran 999 | . . . . . 6 ⊢ (¬ ((𝐺‘𝑦) < (𝐺‘𝑧) ∨ (𝐺‘𝑧) < (𝐺‘𝑦)) ↔ (¬ (𝐺‘𝑦) < (𝐺‘𝑧) ∧ ¬ (𝐺‘𝑧) < (𝐺‘𝑦))) | |
| 21 | 19, 20 | bitr4di 292 | . . . . 5 ⊢ ((𝑦 ∈ ω ∧ 𝑧 ∈ ω) → ((𝐺‘𝑦) = (𝐺‘𝑧) ↔ ¬ ((𝐺‘𝑦) < (𝐺‘𝑧) ∨ (𝐺‘𝑧) < (𝐺‘𝑦)))) |
| 22 | nnord 7919 | . . . . . . . . 9 ⊢ (𝑦 ∈ ω → Ord 𝑦) | |
| 23 | nnord 7919 | . . . . . . . . 9 ⊢ (𝑧 ∈ ω → Ord 𝑧) | |
| 24 | ordtri3 6425 | . . . . . . . . 9 ⊢ ((Ord 𝑦 ∧ Ord 𝑧) → (𝑦 = 𝑧 ↔ ¬ (𝑦 ∈ 𝑧 ∨ 𝑧 ∈ 𝑦))) | |
| 25 | 22, 23, 24 | syl2an 608 | . . . . . . . 8 ⊢ ((𝑦 ∈ ω ∧ 𝑧 ∈ ω) → (𝑦 = 𝑧 ↔ ¬ (𝑦 ∈ 𝑧 ∨ 𝑧 ∈ 𝑦))) |
| 26 | 25 | con2bid 357 | . . . . . . 7 ⊢ ((𝑦 ∈ ω ∧ 𝑧 ∈ ω) → ((𝑦 ∈ 𝑧 ∨ 𝑧 ∈ 𝑦) ↔ ¬ 𝑦 = 𝑧)) |
| 27 | 5, 2 | om2uzlti 14133 | . . . . . . . 8 ⊢ ((𝑦 ∈ ω ∧ 𝑧 ∈ ω) → (𝑦 ∈ 𝑧 → (𝐺‘𝑦) < (𝐺‘𝑧))) |
| 28 | 5, 2 | om2uzlti 14133 | . . . . . . . . 9 ⊢ ((𝑧 ∈ ω ∧ 𝑦 ∈ ω) → (𝑧 ∈ 𝑦 → (𝐺‘𝑧) < (𝐺‘𝑦))) |
| 29 | 28 | ancoms 464 | . . . . . . . 8 ⊢ ((𝑦 ∈ ω ∧ 𝑧 ∈ ω) → (𝑧 ∈ 𝑦 → (𝐺‘𝑧) < (𝐺‘𝑦))) |
| 30 | 27, 29 | orim12d 979 | . . . . . . 7 ⊢ ((𝑦 ∈ ω ∧ 𝑧 ∈ ω) → ((𝑦 ∈ 𝑧 ∨ 𝑧 ∈ 𝑦) → ((𝐺‘𝑦) < (𝐺‘𝑧) ∨ (𝐺‘𝑧) < (𝐺‘𝑦)))) |
| 31 | 26, 30 | sylbird 263 | . . . . . 6 ⊢ ((𝑦 ∈ ω ∧ 𝑧 ∈ ω) → (¬ 𝑦 = 𝑧 → ((𝐺‘𝑦) < (𝐺‘𝑧) ∨ (𝐺‘𝑧) < (𝐺‘𝑦)))) |
| 32 | 31 | con1d 146 | . . . . 5 ⊢ ((𝑦 ∈ ω ∧ 𝑧 ∈ ω) → (¬ ((𝐺‘𝑦) < (𝐺‘𝑧) ∨ (𝐺‘𝑧) < (𝐺‘𝑦)) → 𝑦 = 𝑧)) |
| 33 | 21, 32 | sylbid 243 | . . . 4 ⊢ ((𝑦 ∈ ω ∧ 𝑧 ∈ ω) → ((𝐺‘𝑦) = (𝐺‘𝑧) → 𝑦 = 𝑧)) |
| 34 | 33 | rgen2 3206 | . . 3 ⊢ ∀𝑦 ∈ ω ∀𝑧 ∈ ω ((𝐺‘𝑦) = (𝐺‘𝑧) → 𝑦 = 𝑧) |
| 35 | dff13 7289 | . . 3 ⊢ (𝐺:ω⟶1-1(ℤ≥‘𝐶) ↔ (𝐺:ω⟶(ℤ≥‘𝐶) ∧ ∀𝑦 ∈ ω ∀𝑧 ∈ ω ((𝐺‘𝑦) = (𝐺‘𝑧) → 𝑦 = 𝑧))) | |
| 36 | 9, 34, 35 | mpbir2an 724 | . 2 ⊢ 𝐺:ω⟶1-1(ℤ≥‘𝐶) |
| 37 | dff1o5 6864 | . 2 ⊢ (𝐺:ω⟶1-1onto(ℤ≥‘𝐶) ↔ (𝐺:ω⟶1-1(ℤ≥‘𝐶) ∧ ran 𝐺 = (ℤ≥‘𝐶))) | |
| 38 | 36, 6, 37 | mpbir2an 724 | 1 ⊢ 𝐺:ω⟶1-1onto(ℤ≥‘𝐶) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 → wi 4 ↔ wb 209 ∧ wa 401 ∨ wo 861 = wceq 1570 ∈ wcel 2147 ∀wral 3080 Vcvv 3454 ⊆ wss 3900 class class class wbr 5108 ↦ cmpt 5192 ran crn 5659 ↾ cres 5660 Ord word 6387 Fn wfn 6561 ⟶wf 6562 ⟶1-1wf1 6563 ⟶1-1ontowf1o 6565 ‘cfv 6566 (class class class)co 7451 ωcom 7911 reccrdg 8455 ℝcr 11238 1c1 11240 + caddc 11242 < clt 11382 ℤcz 12733 ℤ≥cuz 13005 |
| 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 ax-cnex 11295 ax-resscn 11296 ax-1cn 11297 ax-icn 11298 ax-addcl 11299 ax-addrcl 11300 ax-mulcl 11301 ax-mulrcl 11302 ax-mulcom 11303 ax-addass 11304 ax-mulass 11305 ax-distr 11306 ax-i2m1 11307 ax-1ne0 11308 ax-1rid 11309 ax-rnegex 11310 ax-rrecex 11311 ax-cnre 11312 ax-pre-lttri 11313 ax-pre-lttrn 11314 ax-pre-ltadd 11315 ax-pre-mulgt0 11316 |
| 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-nel 3066 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-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-riota 7408 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-er 8755 df-en 9012 df-dom 9013 df-sdom 9014 df-pnf 11384 df-mnf 11385 df-xr 11386 df-ltxr 11387 df-le 11388 df-sub 11582 df-neg 11583 df-nn 12376 df-n0 12647 df-z 12734 df-uz 13006 |
| This theorem is used by: om2uzisoi 14137 uzrdglem 14140 uzrdgfni 14141 uzrdgsuci 14143 uzenom 14147 fzennn 14151 cardfz 14153 hashgf1o 14154 axdc4uzlem 14166 unbenlem 17130 omexcn 43967 |
| Copyright terms: Public domain | W3C validator |