| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > tfrex | GIF version | ||
| Description: The transfinite recursion function is set-like if the input is. (Contributed by Mario Carneiro, 3-Jul-2019.) |
| Ref | Expression |
|---|---|
| tfrex.1 | ⊢ 𝐹 = recs(𝐺) |
| tfrex.2 | ⊢ (𝜑 → ∀𝑥(Fun 𝐺 ∧ (𝐺‘𝑥) ∈ V)) |
| Ref | Expression |
|---|---|
| tfrex | ⊢ ((𝜑 ∧ 𝐴 ∈ 𝑉) → (𝐹‘𝐴) ∈ V) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | tfrex.1 | . . 3 ⊢ 𝐹 = recs(𝐺) | |
| 2 | 1 | fveq1i 5676 | . 2 ⊢ (𝐹‘𝐴) = (recs(𝐺)‘𝐴) |
| 3 | eqid 2234 | . . . 4 ⊢ {𝑔 ∣ ∃𝑧 ∈ On (𝑔 Fn 𝑧 ∧ ∀𝑢 ∈ 𝑧 (𝑔‘𝑢) = (𝐺‘(𝑔 ↾ 𝑢)))} = {𝑔 ∣ ∃𝑧 ∈ On (𝑔 Fn 𝑧 ∧ ∀𝑢 ∈ 𝑧 (𝑔‘𝑢) = (𝐺‘(𝑔 ↾ 𝑢)))} | |
| 4 | 3 | tfrlem3 6555 | . . 3 ⊢ {𝑔 ∣ ∃𝑧 ∈ On (𝑔 Fn 𝑧 ∧ ∀𝑢 ∈ 𝑧 (𝑔‘𝑢) = (𝐺‘(𝑔 ↾ 𝑢)))} = {𝑓 ∣ ∃𝑥 ∈ On (𝑓 Fn 𝑥 ∧ ∀𝑦 ∈ 𝑥 (𝑓‘𝑦) = (𝐺‘(𝑓 ↾ 𝑦)))} |
| 5 | tfrex.2 | . . 3 ⊢ (𝜑 → ∀𝑥(Fun 𝐺 ∧ (𝐺‘𝑥) ∈ V)) | |
| 6 | 4, 5 | tfrexlem 6578 | . 2 ⊢ ((𝜑 ∧ 𝐴 ∈ 𝑉) → (recs(𝐺)‘𝐴) ∈ V) |
| 7 | 2, 6 | eqeltrid 2321 | 1 ⊢ ((𝜑 ∧ 𝐴 ∈ 𝑉) → (𝐹‘𝐴) ∈ V) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 ∀wal 1396 = wceq 1398 ∈ wcel 2205 {cab 2220 ∀wral 2522 ∃wrex 2523 Vcvv 2815 Oncon0 4489 ↾ cres 4756 Fun wfun 5351 Fn wfn 5352 ‘cfv 5357 recscrecs 6548 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 619 ax-in2 620 ax-io 717 ax-5 1496 ax-7 1497 ax-gen 1498 ax-ie1 1542 ax-ie2 1543 ax-8 1553 ax-10 1554 ax-11 1555 ax-i12 1556 ax-bndl 1558 ax-4 1559 ax-17 1575 ax-i9 1579 ax-ial 1583 ax-i5r 1584 ax-13 2207 ax-14 2208 ax-ext 2216 ax-coll 4230 ax-sep 4233 ax-pow 4292 ax-pr 4327 ax-un 4559 ax-setind 4664 |
| This theorem depends on definitions: df-bi 117 df-3an 1007 df-tru 1401 df-fal 1404 df-nf 1510 df-sb 1812 df-eu 2085 df-mo 2086 df-clab 2221 df-cleq 2227 df-clel 2230 df-nfc 2375 df-ne 2415 df-ral 2527 df-rex 2528 df-reu 2529 df-rab 2531 df-v 2817 df-sbc 3046 df-csb 3142 df-dif 3216 df-un 3218 df-in 3220 df-ss 3227 df-nul 3513 df-pw 3676 df-sn 3700 df-pr 3701 df-op 3703 df-uni 3920 df-iun 3998 df-br 4115 df-opab 4177 df-mpt 4178 df-tr 4214 df-id 4419 df-iord 4492 df-on 4494 df-suc 4497 df-xp 4760 df-rel 4761 df-cnv 4762 df-co 4763 df-dm 4764 df-rn 4765 df-res 4766 df-ima 4767 df-iota 5317 df-fun 5359 df-fn 5360 df-f 5361 df-f1 5362 df-fo 5363 df-f1o 5364 df-fv 5365 df-recs 6549 |
| This theorem is referenced by: rdgexggg 6621 |
| Copyright terms: Public domain | W3C validator |