![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > noseqrdglem | Structured version Visualization version GIF version |
Description: A helper lemma for the value of a recursive defintion generator on surreal sequences. (Contributed by Scott Fenton, 18-Apr-2025.) |
Ref | Expression |
---|---|
om2noseq.1 | ⊢ (𝜑 → 𝐶 ∈ No ) |
om2noseq.2 | ⊢ (𝜑 → 𝐺 = (rec((𝑥 ∈ V ↦ (𝑥 +s 1s )), 𝐶) ↾ ω)) |
om2noseq.3 | ⊢ (𝜑 → 𝑍 = (rec((𝑥 ∈ V ↦ (𝑥 +s 1s )), 𝐶) “ ω)) |
noseqrdg.1 | ⊢ (𝜑 → 𝐴 ∈ 𝑉) |
noseqrdg.2 | ⊢ (𝜑 → 𝑅 = (rec((𝑥 ∈ V, 𝑦 ∈ V ↦ 〈(𝑥 +s 1s ), (𝑥𝐹𝑦)〉), 〈𝐶, 𝐴〉) ↾ ω)) |
Ref | Expression |
---|---|
noseqrdglem | ⊢ ((𝜑 ∧ 𝐵 ∈ 𝑍) → 〈𝐵, (2nd ‘(𝑅‘(◡𝐺‘𝐵)))〉 ∈ ran 𝑅) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | om2noseq.1 | . . . . . 6 ⊢ (𝜑 → 𝐶 ∈ No ) | |
2 | om2noseq.2 | . . . . . 6 ⊢ (𝜑 → 𝐺 = (rec((𝑥 ∈ V ↦ (𝑥 +s 1s )), 𝐶) ↾ ω)) | |
3 | om2noseq.3 | . . . . . 6 ⊢ (𝜑 → 𝑍 = (rec((𝑥 ∈ V ↦ (𝑥 +s 1s )), 𝐶) “ ω)) | |
4 | 1, 2, 3 | om2noseqf1o 28271 | . . . . 5 ⊢ (𝜑 → 𝐺:ω–1-1-onto→𝑍) |
5 | f1ocnvdm 7290 | . . . . 5 ⊢ ((𝐺:ω–1-1-onto→𝑍 ∧ 𝐵 ∈ 𝑍) → (◡𝐺‘𝐵) ∈ ω) | |
6 | 4, 5 | sylan 578 | . . . 4 ⊢ ((𝜑 ∧ 𝐵 ∈ 𝑍) → (◡𝐺‘𝐵) ∈ ω) |
7 | noseqrdg.1 | . . . . 5 ⊢ (𝜑 → 𝐴 ∈ 𝑉) | |
8 | noseqrdg.2 | . . . . 5 ⊢ (𝜑 → 𝑅 = (rec((𝑥 ∈ V, 𝑦 ∈ V ↦ 〈(𝑥 +s 1s ), (𝑥𝐹𝑦)〉), 〈𝐶, 𝐴〉) ↾ ω)) | |
9 | 1, 2, 3, 7, 8 | om2noseqrdg 28274 | . . . 4 ⊢ ((𝜑 ∧ (◡𝐺‘𝐵) ∈ ω) → (𝑅‘(◡𝐺‘𝐵)) = 〈(𝐺‘(◡𝐺‘𝐵)), (2nd ‘(𝑅‘(◡𝐺‘𝐵)))〉) |
10 | 6, 9 | syldan 589 | . . 3 ⊢ ((𝜑 ∧ 𝐵 ∈ 𝑍) → (𝑅‘(◡𝐺‘𝐵)) = 〈(𝐺‘(◡𝐺‘𝐵)), (2nd ‘(𝑅‘(◡𝐺‘𝐵)))〉) |
11 | f1ocnvfv2 7282 | . . . . 5 ⊢ ((𝐺:ω–1-1-onto→𝑍 ∧ 𝐵 ∈ 𝑍) → (𝐺‘(◡𝐺‘𝐵)) = 𝐵) | |
12 | 4, 11 | sylan 578 | . . . 4 ⊢ ((𝜑 ∧ 𝐵 ∈ 𝑍) → (𝐺‘(◡𝐺‘𝐵)) = 𝐵) |
13 | 12 | opeq1d 4879 | . . 3 ⊢ ((𝜑 ∧ 𝐵 ∈ 𝑍) → 〈(𝐺‘(◡𝐺‘𝐵)), (2nd ‘(𝑅‘(◡𝐺‘𝐵)))〉 = 〈𝐵, (2nd ‘(𝑅‘(◡𝐺‘𝐵)))〉) |
14 | 10, 13 | eqtrd 2766 | . 2 ⊢ ((𝜑 ∧ 𝐵 ∈ 𝑍) → (𝑅‘(◡𝐺‘𝐵)) = 〈𝐵, (2nd ‘(𝑅‘(◡𝐺‘𝐵)))〉) |
15 | frfnom 8456 | . . . . 5 ⊢ (rec((𝑥 ∈ V, 𝑦 ∈ V ↦ 〈(𝑥 +s 1s ), (𝑥𝐹𝑦)〉), 〈𝐶, 𝐴〉) ↾ ω) Fn ω | |
16 | 8 | fneq1d 6644 | . . . . 5 ⊢ (𝜑 → (𝑅 Fn ω ↔ (rec((𝑥 ∈ V, 𝑦 ∈ V ↦ 〈(𝑥 +s 1s ), (𝑥𝐹𝑦)〉), 〈𝐶, 𝐴〉) ↾ ω) Fn ω)) |
17 | 15, 16 | mpbiri 257 | . . . 4 ⊢ (𝜑 → 𝑅 Fn ω) |
18 | 17 | adantr 479 | . . 3 ⊢ ((𝜑 ∧ 𝐵 ∈ 𝑍) → 𝑅 Fn ω) |
19 | 18, 6 | fnfvelrnd 7087 | . 2 ⊢ ((𝜑 ∧ 𝐵 ∈ 𝑍) → (𝑅‘(◡𝐺‘𝐵)) ∈ ran 𝑅) |
20 | 14, 19 | eqeltrrd 2827 | 1 ⊢ ((𝜑 ∧ 𝐵 ∈ 𝑍) → 〈𝐵, (2nd ‘(𝑅‘(◡𝐺‘𝐵)))〉 ∈ ran 𝑅) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 394 = wceq 1534 ∈ wcel 2099 Vcvv 3464 〈cop 4631 ↦ cmpt 5228 ◡ccnv 5673 ran crn 5675 ↾ cres 5676 “ cima 5677 Fn wfn 6540 –1-1-onto→wf1o 6544 ‘cfv 6545 (class class class)co 7415 ∈ cmpo 7417 ωcom 7867 2nd c2nd 7993 reccrdg 8430 No csur 27665 1s c1s 27849 +s cadds 27969 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1790 ax-4 1804 ax-5 1906 ax-6 1964 ax-7 2004 ax-8 2101 ax-9 2109 ax-10 2130 ax-11 2147 ax-12 2167 ax-ext 2697 ax-rep 5282 ax-sep 5296 ax-nul 5303 ax-pow 5361 ax-pr 5425 ax-un 7737 |
This theorem depends on definitions: df-bi 206 df-an 395 df-or 846 df-3or 1085 df-3an 1086 df-tru 1537 df-fal 1547 df-ex 1775 df-nf 1779 df-sb 2061 df-mo 2529 df-eu 2558 df-clab 2704 df-cleq 2718 df-clel 2803 df-nfc 2878 df-ne 2931 df-ral 3052 df-rex 3061 df-rmo 3365 df-reu 3366 df-rab 3421 df-v 3466 df-sbc 3778 df-csb 3894 df-dif 3951 df-un 3953 df-in 3955 df-ss 3965 df-pss 3968 df-nul 4325 df-if 4526 df-pw 4601 df-sn 4626 df-pr 4628 df-tp 4630 df-op 4632 df-ot 4634 df-uni 4908 df-int 4949 df-iun 4997 df-br 5146 df-opab 5208 df-mpt 5229 df-tr 5263 df-id 5572 df-eprel 5578 df-po 5586 df-so 5587 df-fr 5629 df-se 5630 df-we 5631 df-xp 5680 df-rel 5681 df-cnv 5682 df-co 5683 df-dm 5684 df-rn 5685 df-res 5686 df-ima 5687 df-pred 6304 df-ord 6370 df-on 6371 df-lim 6372 df-suc 6373 df-iota 6497 df-fun 6547 df-fn 6548 df-f 6549 df-f1 6550 df-fo 6551 df-f1o 6552 df-fv 6553 df-riota 7371 df-ov 7418 df-oprab 7419 df-mpo 7420 df-om 7868 df-1st 7994 df-2nd 7995 df-frecs 8287 df-wrecs 8318 df-recs 8392 df-rdg 8431 df-1o 8487 df-2o 8488 df-oadd 8491 df-nadd 8687 df-no 27668 df-slt 27669 df-bday 27670 df-sle 27771 df-sslt 27807 df-scut 27809 df-0s 27850 df-1s 27851 df-made 27867 df-old 27868 df-left 27870 df-right 27871 df-norec2 27959 df-adds 27970 |
This theorem is referenced by: noseqrdgfn 28276 noseqrdgsuc 28278 |
Copyright terms: Public domain | W3C validator |