Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > tfr1on | GIF version |
Description: Recursion is defined on an ordinal if the characteristic function is defined up to a suitable point. (Contributed by Jim Kingdon, 12-Mar-2022.) |
Ref | Expression |
---|---|
tfr1on.f | ⊢ 𝐹 = recs(𝐺) |
tfr1on.g | ⊢ (𝜑 → Fun 𝐺) |
tfr1on.x | ⊢ (𝜑 → Ord 𝑋) |
tfr1on.ex | ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋 ∧ 𝑓 Fn 𝑥) → (𝐺‘𝑓) ∈ V) |
tfr1on.u | ⊢ ((𝜑 ∧ 𝑥 ∈ ∪ 𝑋) → suc 𝑥 ∈ 𝑋) |
tfr1on.yx | ⊢ (𝜑 → 𝑌 ∈ 𝑋) |
Ref | Expression |
---|---|
tfr1on | ⊢ (𝜑 → 𝑌 ⊆ dom 𝐹) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | tfr1on.f | . 2 ⊢ 𝐹 = recs(𝐺) | |
2 | tfr1on.g | . 2 ⊢ (𝜑 → Fun 𝐺) | |
3 | tfr1on.x | . 2 ⊢ (𝜑 → Ord 𝑋) | |
4 | tfr1on.ex | . 2 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋 ∧ 𝑓 Fn 𝑥) → (𝐺‘𝑓) ∈ V) | |
5 | eqid 2164 | . . 3 ⊢ {𝑎 ∣ ∃𝑏 ∈ 𝑋 (𝑎 Fn 𝑏 ∧ ∀𝑐 ∈ 𝑏 (𝑎‘𝑐) = (𝐺‘(𝑎 ↾ 𝑐)))} = {𝑎 ∣ ∃𝑏 ∈ 𝑋 (𝑎 Fn 𝑏 ∧ ∀𝑐 ∈ 𝑏 (𝑎‘𝑐) = (𝐺‘(𝑎 ↾ 𝑐)))} | |
6 | 5 | tfr1onlem3 6297 | . 2 ⊢ {𝑎 ∣ ∃𝑏 ∈ 𝑋 (𝑎 Fn 𝑏 ∧ ∀𝑐 ∈ 𝑏 (𝑎‘𝑐) = (𝐺‘(𝑎 ↾ 𝑐)))} = {𝑓 ∣ ∃𝑥 ∈ 𝑋 (𝑓 Fn 𝑥 ∧ ∀𝑦 ∈ 𝑥 (𝑓‘𝑦) = (𝐺‘(𝑓 ↾ 𝑦)))} |
7 | tfr1on.u | . 2 ⊢ ((𝜑 ∧ 𝑥 ∈ ∪ 𝑋) → suc 𝑥 ∈ 𝑋) | |
8 | tfr1on.yx | . 2 ⊢ (𝜑 → 𝑌 ∈ 𝑋) | |
9 | 1, 2, 3, 4, 6, 7, 8 | tfr1onlemres 6308 | 1 ⊢ (𝜑 → 𝑌 ⊆ dom 𝐹) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 103 ∧ w3a 967 = wceq 1342 ∈ wcel 2135 {cab 2150 ∀wral 2442 ∃wrex 2443 Vcvv 2721 ⊆ wss 3111 ∪ cuni 3783 Ord word 4334 suc csuc 4337 dom cdm 4598 ↾ cres 4600 Fun wfun 5176 Fn wfn 5177 ‘cfv 5182 recscrecs 6263 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 105 ax-ia2 106 ax-ia3 107 ax-in1 604 ax-in2 605 ax-io 699 ax-5 1434 ax-7 1435 ax-gen 1436 ax-ie1 1480 ax-ie2 1481 ax-8 1491 ax-10 1492 ax-11 1493 ax-i12 1494 ax-bndl 1496 ax-4 1497 ax-17 1513 ax-i9 1517 ax-ial 1521 ax-i5r 1522 ax-13 2137 ax-14 2138 ax-ext 2146 ax-coll 4091 ax-sep 4094 ax-pow 4147 ax-pr 4181 ax-un 4405 ax-setind 4508 |
This theorem depends on definitions: df-bi 116 df-3an 969 df-tru 1345 df-fal 1348 df-nf 1448 df-sb 1750 df-eu 2016 df-mo 2017 df-clab 2151 df-cleq 2157 df-clel 2160 df-nfc 2295 df-ne 2335 df-ral 2447 df-rex 2448 df-reu 2449 df-rab 2451 df-v 2723 df-sbc 2947 df-csb 3041 df-dif 3113 df-un 3115 df-in 3117 df-ss 3124 df-nul 3405 df-pw 3555 df-sn 3576 df-pr 3577 df-op 3579 df-uni 3784 df-iun 3862 df-br 3977 df-opab 4038 df-mpt 4039 df-tr 4075 df-id 4265 df-iord 4338 df-on 4340 df-suc 4343 df-xp 4604 df-rel 4605 df-cnv 4606 df-co 4607 df-dm 4608 df-rn 4609 df-res 4610 df-ima 4611 df-iota 5147 df-fun 5184 df-fn 5185 df-f 5186 df-f1 5187 df-fo 5188 df-f1o 5189 df-fv 5190 df-recs 6264 |
This theorem is referenced by: tfri1dALT 6310 |
Copyright terms: Public domain | W3C validator |