| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > uzrdglem | Structured version Visualization version GIF version | ||
| Description: A helper lemma for the value of a recursive definition generator on upper integers. (Contributed by Mario Carneiro, 26-Jun-2013.) (Revised by Mario Carneiro, 18-Nov-2014.) |
| Ref | Expression |
|---|---|
| om2uz.1 | ⊢ 𝐶 ∈ ℤ |
| om2uz.2 | ⊢ 𝐺 = (rec((𝑥 ∈ V ↦ (𝑥 + 1)), 𝐶) ↾ ω) |
| uzrdg.1 | ⊢ 𝐴 ∈ V |
| uzrdg.2 | ⊢ 𝑅 = (rec((𝑥 ∈ V, 𝑦 ∈ V ↦ 〈(𝑥 + 1), (𝑥𝐹𝑦)〉), 〈𝐶, 𝐴〉) ↾ ω) |
| Ref | Expression |
|---|---|
| uzrdglem | ⊢ (𝐵 ∈ (ℤ≥‘𝐶) → 〈𝐵, (2nd ‘(𝑅‘(◡𝐺‘𝐵)))〉 ∈ ran 𝑅) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | om2uz.1 | . . . . . 6 ⊢ 𝐶 ∈ ℤ | |
| 2 | om2uz.2 | . . . . . 6 ⊢ 𝐺 = (rec((𝑥 ∈ V ↦ (𝑥 + 1)), 𝐶) ↾ ω) | |
| 3 | 1, 2 | om2uzf1oi 14135 | . . . . 5 ⊢ 𝐺:ω⟶1-1onto(ℤ≥‘𝐶) |
| 4 | f1ocnvdm 7323 | . . . . 5 ⊢ ((𝐺:ω⟶1-1onto(ℤ≥‘𝐶) ∧ 𝐵 ∈ (ℤ≥‘𝐶)) → (◡𝐺‘𝐵) ∈ ω) | |
| 5 | 3, 4 | mpan 703 | . . . 4 ⊢ (𝐵 ∈ (ℤ≥‘𝐶) → (◡𝐺‘𝐵) ∈ ω) |
| 6 | uzrdg.1 | . . . . 5 ⊢ 𝐴 ∈ V | |
| 7 | uzrdg.2 | . . . . 5 ⊢ 𝑅 = (rec((𝑥 ∈ V, 𝑦 ∈ V ↦ 〈(𝑥 + 1), (𝑥𝐹𝑦)〉), 〈𝐶, 𝐴〉) ↾ ω) | |
| 8 | 1, 2, 6, 7 | om2uzrdg 14138 | . . . 4 ⊢ ((◡𝐺‘𝐵) ∈ ω → (𝑅‘(◡𝐺‘𝐵)) = 〈(𝐺‘(◡𝐺‘𝐵)), (2nd ‘(𝑅‘(◡𝐺‘𝐵)))〉) |
| 9 | 5, 8 | syl 18 | . . 3 ⊢ (𝐵 ∈ (ℤ≥‘𝐶) → (𝑅‘(◡𝐺‘𝐵)) = 〈(𝐺‘(◡𝐺‘𝐵)), (2nd ‘(𝑅‘(◡𝐺‘𝐵)))〉) |
| 10 | f1ocnvfv2 7315 | . . . . 5 ⊢ ((𝐺:ω⟶1-1onto(ℤ≥‘𝐶) ∧ 𝐵 ∈ (ℤ≥‘𝐶)) → (𝐺‘(◡𝐺‘𝐵)) = 𝐵) | |
| 11 | 3, 10 | mpan 703 | . . . 4 ⊢ (𝐵 ∈ (ℤ≥‘𝐶) → (𝐺‘(◡𝐺‘𝐵)) = 𝐵) |
| 12 | 11 | opeq1d 4850 | . . 3 ⊢ (𝐵 ∈ (ℤ≥‘𝐶) → 〈(𝐺‘(◡𝐺‘𝐵)), (2nd ‘(𝑅‘(◡𝐺‘𝐵)))〉 = 〈𝐵, (2nd ‘(𝑅‘(◡𝐺‘𝐵)))〉) |
| 13 | 9, 12 | eqtrd 2801 | . 2 ⊢ (𝐵 ∈ (ℤ≥‘𝐶) → (𝑅‘(◡𝐺‘𝐵)) = 〈𝐵, (2nd ‘(𝑅‘(◡𝐺‘𝐵)))〉) |
| 14 | frfnom 8480 | . . . 4 ⊢ (rec((𝑥 ∈ V, 𝑦 ∈ V ↦ 〈(𝑥 + 1), (𝑥𝐹𝑦)〉), 〈𝐶, 𝐴〉) ↾ ω) Fn ω | |
| 15 | 7 | fneq1i 6665 | . . . 4 ⊢ (𝑅 Fn ω ↔ (rec((𝑥 ∈ V, 𝑦 ∈ V ↦ 〈(𝑥 + 1), (𝑥𝐹𝑦)〉), 〈𝐶, 𝐴〉) ↾ ω) Fn ω) |
| 16 | 14, 15 | mpbir 234 | . . 3 ⊢ 𝑅 Fn ω |
| 17 | fnfvelrn 7111 | . . 3 ⊢ ((𝑅 Fn ω ∧ (◡𝐺‘𝐵) ∈ ω) → (𝑅‘(◡𝐺‘𝐵)) ∈ ran 𝑅) | |
| 18 | 16, 5, 17 | sylancr 599 | . 2 ⊢ (𝐵 ∈ (ℤ≥‘𝐶) → (𝑅‘(◡𝐺‘𝐵)) ∈ ran 𝑅) |
| 19 | 13, 18 | eqeltrrd 2868 | 1 ⊢ (𝐵 ∈ (ℤ≥‘𝐶) → 〈𝐵, (2nd ‘(𝑅‘(◡𝐺‘𝐵)))〉 ∈ ran 𝑅) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 = wceq 1572 ∈ wcel 2150 Vcvv 3453 〈cop 4839 ↦ cmpt 5191 ◡ccnv 5656 ran crn 5658 ↾ cres 5659 Fn wfn 6560 ⟶1-1ontowf1o 6564 ‘cfv 6565 (class class class)co 7450 ∈ cmpo 7452 ωcom 7910 2nd c2nd 8033 reccrdg 8454 1c1 11239 + caddc 11241 ℤcz 12732 ℤ≥cuz 13004 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1830 ax-4 1844 ax-5 1947 ax-6 2004 ax-7 2045 ax-8 2152 ax-9 2160 ax-10 2183 ax-11 2200 ax-12 2219 ax-ext 2738 ax-sep 5254 ax-nul 5265 ax-pow 5333 ax-pr 5397 ax-un 7782 ax-cnex 11294 ax-resscn 11295 ax-1cn 11296 ax-icn 11297 ax-addcl 11298 ax-addrcl 11299 ax-mulcl 11300 ax-mulrcl 11301 ax-mulcom 11302 ax-addass 11303 ax-mulass 11304 ax-distr 11305 ax-i2m1 11306 ax-1ne0 11307 ax-1rid 11308 ax-rnegex 11309 ax-rrecex 11310 ax-cnre 11311 ax-pre-lttri 11312 ax-pre-lttrn 11313 ax-pre-ltadd 11314 ax-pre-mulgt0 11315 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1105 df-3an 1106 df-tru 1575 df-fal 1585 df-ex 1815 df-nf 1819 df-sb 2104 df-mo 2570 df-eu 2600 df-clab 2745 df-cleq 2758 df-clel 2842 df-nfc 2916 df-ne 2963 df-nel 3069 df-ral 3084 df-rex 3094 df-reu 3369 df-rab 3416 df-v 3455 df-sbc 3742 df-csb 3851 df-ss 3900 df-pss 4016 df-dif 4049 df-in 4093 df-un 4153 df-nul 4281 df-if 4485 df-pw 4561 df-sn 4588 df-pr 4590 df-op 4840 df-uni 4872 df-iun 4957 df-br 5108 df-opab 5173 df-mpt 5192 df-tr 5218 df-id 5552 df-eprel 5557 df-po 5565 df-so 5566 df-fr 5610 df-we 5612 df-xp 5663 df-rel 5664 df-cnv 5665 df-co 5666 df-dm 5667 df-rn 5668 df-res 5669 df-ima 5670 df-pred 6329 df-ord 6390 df-on 6391 df-lim 6392 df-suc 6393 df-iota 6519 df-fun 6567 df-fn 6568 df-f 6569 df-f1 6570 df-fo 6571 df-f1o 6572 df-fv 6573 df-riota 7407 df-ov 7453 df-oprab 7454 df-mpo 7455 df-om 7911 df-2nd 8035 df-frecs 8336 df-wrecs 8367 df-recs 8416 df-rdg 8455 df-er 8754 df-en 9011 df-dom 9012 df-sdom 9013 df-pnf 11383 df-mnf 11384 df-xr 11385 df-ltxr 11386 df-le 11387 df-sub 11581 df-neg 11582 df-nn 12375 df-n0 12646 df-z 12733 df-uz 13005 |
| This theorem is used by: uzrdgfni 14140 uzrdgsuci 14142 |
| Copyright terms: Public domain | W3C validator |