![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > om2uzf1oi | Structured version Visualization version GIF version |
Description: 𝐺 (see om2uz0i 13852) 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-1-onto→(ℤ≥‘𝐶) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | frfnom 8381 | . . . . 5 ⊢ (rec((𝑥 ∈ V ↦ (𝑥 + 1)), 𝐶) ↾ ω) Fn ω | |
2 | om2uz.2 | . . . . . 6 ⊢ 𝐺 = (rec((𝑥 ∈ V ↦ (𝑥 + 1)), 𝐶) ↾ ω) | |
3 | 2 | fneq1i 6599 | . . . . 5 ⊢ (𝐺 Fn ω ↔ (rec((𝑥 ∈ V ↦ (𝑥 + 1)), 𝐶) ↾ ω) Fn ω) |
4 | 1, 3 | mpbir 230 | . . . 4 ⊢ 𝐺 Fn ω |
5 | om2uz.1 | . . . . . 6 ⊢ 𝐶 ∈ ℤ | |
6 | 5, 2 | om2uzrani 13857 | . . . . 5 ⊢ ran 𝐺 = (ℤ≥‘𝐶) |
7 | 6 | eqimssi 4002 | . . . 4 ⊢ ran 𝐺 ⊆ (ℤ≥‘𝐶) |
8 | df-f 6500 | . . . 4 ⊢ (𝐺:ω⟶(ℤ≥‘𝐶) ↔ (𝐺 Fn ω ∧ ran 𝐺 ⊆ (ℤ≥‘𝐶))) | |
9 | 4, 7, 8 | mpbir2an 709 | . . 3 ⊢ 𝐺:ω⟶(ℤ≥‘𝐶) |
10 | 5, 2 | om2uzuzi 13854 | . . . . . . . . 9 ⊢ (𝑦 ∈ ω → (𝐺‘𝑦) ∈ (ℤ≥‘𝐶)) |
11 | eluzelz 12773 | . . . . . . . . 9 ⊢ ((𝐺‘𝑦) ∈ (ℤ≥‘𝐶) → (𝐺‘𝑦) ∈ ℤ) | |
12 | 10, 11 | syl 17 | . . . . . . . 8 ⊢ (𝑦 ∈ ω → (𝐺‘𝑦) ∈ ℤ) |
13 | 12 | zred 12607 | . . . . . . 7 ⊢ (𝑦 ∈ ω → (𝐺‘𝑦) ∈ ℝ) |
14 | 5, 2 | om2uzuzi 13854 | . . . . . . . . 9 ⊢ (𝑧 ∈ ω → (𝐺‘𝑧) ∈ (ℤ≥‘𝐶)) |
15 | eluzelz 12773 | . . . . . . . . 9 ⊢ ((𝐺‘𝑧) ∈ (ℤ≥‘𝐶) → (𝐺‘𝑧) ∈ ℤ) | |
16 | 14, 15 | syl 17 | . . . . . . . 8 ⊢ (𝑧 ∈ ω → (𝐺‘𝑧) ∈ ℤ) |
17 | 16 | zred 12607 | . . . . . . 7 ⊢ (𝑧 ∈ ω → (𝐺‘𝑧) ∈ ℝ) |
18 | lttri3 11238 | . . . . . . 7 ⊢ (((𝐺‘𝑦) ∈ ℝ ∧ (𝐺‘𝑧) ∈ ℝ) → ((𝐺‘𝑦) = (𝐺‘𝑧) ↔ (¬ (𝐺‘𝑦) < (𝐺‘𝑧) ∧ ¬ (𝐺‘𝑧) < (𝐺‘𝑦)))) | |
19 | 13, 17, 18 | syl2an 596 | . . . . . 6 ⊢ ((𝑦 ∈ ω ∧ 𝑧 ∈ ω) → ((𝐺‘𝑦) = (𝐺‘𝑧) ↔ (¬ (𝐺‘𝑦) < (𝐺‘𝑧) ∧ ¬ (𝐺‘𝑧) < (𝐺‘𝑦)))) |
20 | ioran 982 | . . . . . 6 ⊢ (¬ ((𝐺‘𝑦) < (𝐺‘𝑧) ∨ (𝐺‘𝑧) < (𝐺‘𝑦)) ↔ (¬ (𝐺‘𝑦) < (𝐺‘𝑧) ∧ ¬ (𝐺‘𝑧) < (𝐺‘𝑦))) | |
21 | 19, 20 | bitr4di 288 | . . . . 5 ⊢ ((𝑦 ∈ ω ∧ 𝑧 ∈ ω) → ((𝐺‘𝑦) = (𝐺‘𝑧) ↔ ¬ ((𝐺‘𝑦) < (𝐺‘𝑧) ∨ (𝐺‘𝑧) < (𝐺‘𝑦)))) |
22 | nnord 7810 | . . . . . . . . 9 ⊢ (𝑦 ∈ ω → Ord 𝑦) | |
23 | nnord 7810 | . . . . . . . . 9 ⊢ (𝑧 ∈ ω → Ord 𝑧) | |
24 | ordtri3 6353 | . . . . . . . . 9 ⊢ ((Ord 𝑦 ∧ Ord 𝑧) → (𝑦 = 𝑧 ↔ ¬ (𝑦 ∈ 𝑧 ∨ 𝑧 ∈ 𝑦))) | |
25 | 22, 23, 24 | syl2an 596 | . . . . . . . 8 ⊢ ((𝑦 ∈ ω ∧ 𝑧 ∈ ω) → (𝑦 = 𝑧 ↔ ¬ (𝑦 ∈ 𝑧 ∨ 𝑧 ∈ 𝑦))) |
26 | 25 | con2bid 354 | . . . . . . 7 ⊢ ((𝑦 ∈ ω ∧ 𝑧 ∈ ω) → ((𝑦 ∈ 𝑧 ∨ 𝑧 ∈ 𝑦) ↔ ¬ 𝑦 = 𝑧)) |
27 | 5, 2 | om2uzlti 13855 | . . . . . . . 8 ⊢ ((𝑦 ∈ ω ∧ 𝑧 ∈ ω) → (𝑦 ∈ 𝑧 → (𝐺‘𝑦) < (𝐺‘𝑧))) |
28 | 5, 2 | om2uzlti 13855 | . . . . . . . . 9 ⊢ ((𝑧 ∈ ω ∧ 𝑦 ∈ ω) → (𝑧 ∈ 𝑦 → (𝐺‘𝑧) < (𝐺‘𝑦))) |
29 | 28 | ancoms 459 | . . . . . . . 8 ⊢ ((𝑦 ∈ ω ∧ 𝑧 ∈ ω) → (𝑧 ∈ 𝑦 → (𝐺‘𝑧) < (𝐺‘𝑦))) |
30 | 27, 29 | orim12d 963 | . . . . . . 7 ⊢ ((𝑦 ∈ ω ∧ 𝑧 ∈ ω) → ((𝑦 ∈ 𝑧 ∨ 𝑧 ∈ 𝑦) → ((𝐺‘𝑦) < (𝐺‘𝑧) ∨ (𝐺‘𝑧) < (𝐺‘𝑦)))) |
31 | 26, 30 | sylbird 259 | . . . . . 6 ⊢ ((𝑦 ∈ ω ∧ 𝑧 ∈ ω) → (¬ 𝑦 = 𝑧 → ((𝐺‘𝑦) < (𝐺‘𝑧) ∨ (𝐺‘𝑧) < (𝐺‘𝑦)))) |
32 | 31 | con1d 145 | . . . . 5 ⊢ ((𝑦 ∈ ω ∧ 𝑧 ∈ ω) → (¬ ((𝐺‘𝑦) < (𝐺‘𝑧) ∨ (𝐺‘𝑧) < (𝐺‘𝑦)) → 𝑦 = 𝑧)) |
33 | 21, 32 | sylbid 239 | . . . 4 ⊢ ((𝑦 ∈ ω ∧ 𝑧 ∈ ω) → ((𝐺‘𝑦) = (𝐺‘𝑧) → 𝑦 = 𝑧)) |
34 | 33 | rgen2 3194 | . . 3 ⊢ ∀𝑦 ∈ ω ∀𝑧 ∈ ω ((𝐺‘𝑦) = (𝐺‘𝑧) → 𝑦 = 𝑧) |
35 | dff13 7202 | . . 3 ⊢ (𝐺:ω–1-1→(ℤ≥‘𝐶) ↔ (𝐺:ω⟶(ℤ≥‘𝐶) ∧ ∀𝑦 ∈ ω ∀𝑧 ∈ ω ((𝐺‘𝑦) = (𝐺‘𝑧) → 𝑦 = 𝑧))) | |
36 | 9, 34, 35 | mpbir2an 709 | . 2 ⊢ 𝐺:ω–1-1→(ℤ≥‘𝐶) |
37 | dff1o5 6793 | . 2 ⊢ (𝐺:ω–1-1-onto→(ℤ≥‘𝐶) ↔ (𝐺:ω–1-1→(ℤ≥‘𝐶) ∧ ran 𝐺 = (ℤ≥‘𝐶))) | |
38 | 36, 6, 37 | mpbir2an 709 | 1 ⊢ 𝐺:ω–1-1-onto→(ℤ≥‘𝐶) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ↔ wb 205 ∧ wa 396 ∨ wo 845 = wceq 1541 ∈ wcel 2106 ∀wral 3064 Vcvv 3445 ⊆ wss 3910 class class class wbr 5105 ↦ cmpt 5188 ran crn 5634 ↾ cres 5635 Ord word 6316 Fn wfn 6491 ⟶wf 6492 –1-1→wf1 6493 –1-1-onto→wf1o 6495 ‘cfv 6496 (class class class)co 7357 ωcom 7802 reccrdg 8355 ℝcr 11050 1c1 11052 + caddc 11054 < clt 11189 ℤcz 12499 ℤ≥cuz 12763 |
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 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2707 ax-sep 5256 ax-nul 5263 ax-pow 5320 ax-pr 5384 ax-un 7672 ax-cnex 11107 ax-resscn 11108 ax-1cn 11109 ax-icn 11110 ax-addcl 11111 ax-addrcl 11112 ax-mulcl 11113 ax-mulrcl 11114 ax-mulcom 11115 ax-addass 11116 ax-mulass 11117 ax-distr 11118 ax-i2m1 11119 ax-1ne0 11120 ax-1rid 11121 ax-rnegex 11122 ax-rrecex 11123 ax-cnre 11124 ax-pre-lttri 11125 ax-pre-lttrn 11126 ax-pre-ltadd 11127 ax-pre-mulgt0 11128 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 846 df-3or 1088 df-3an 1089 df-tru 1544 df-fal 1554 df-ex 1782 df-nf 1786 df-sb 2068 df-mo 2538 df-eu 2567 df-clab 2714 df-cleq 2728 df-clel 2814 df-nfc 2889 df-ne 2944 df-nel 3050 df-ral 3065 df-rex 3074 df-reu 3354 df-rab 3408 df-v 3447 df-sbc 3740 df-csb 3856 df-dif 3913 df-un 3915 df-in 3917 df-ss 3927 df-pss 3929 df-nul 4283 df-if 4487 df-pw 4562 df-sn 4587 df-pr 4589 df-op 4593 df-uni 4866 df-iun 4956 df-br 5106 df-opab 5168 df-mpt 5189 df-tr 5223 df-id 5531 df-eprel 5537 df-po 5545 df-so 5546 df-fr 5588 df-we 5590 df-xp 5639 df-rel 5640 df-cnv 5641 df-co 5642 df-dm 5643 df-rn 5644 df-res 5645 df-ima 5646 df-pred 6253 df-ord 6320 df-on 6321 df-lim 6322 df-suc 6323 df-iota 6448 df-fun 6498 df-fn 6499 df-f 6500 df-f1 6501 df-fo 6502 df-f1o 6503 df-fv 6504 df-riota 7313 df-ov 7360 df-oprab 7361 df-mpo 7362 df-om 7803 df-2nd 7922 df-frecs 8212 df-wrecs 8243 df-recs 8317 df-rdg 8356 df-er 8648 df-en 8884 df-dom 8885 df-sdom 8886 df-pnf 11191 df-mnf 11192 df-xr 11193 df-ltxr 11194 df-le 11195 df-sub 11387 df-neg 11388 df-nn 12154 df-n0 12414 df-z 12500 df-uz 12764 |
This theorem is referenced by: om2uzisoi 13859 uzrdglem 13862 uzrdgfni 13863 uzrdgsuci 13865 uzenom 13869 fzennn 13873 cardfz 13875 hashgf1o 13876 axdc4uzlem 13888 unbenlem 16780 |
Copyright terms: Public domain | W3C validator |