![]() |
Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > ILE Home > Th. List > tfr1onlem3 | GIF version |
Description: Lemma for transfinite recursion. This lemma changes some bound variables in 𝐴 (version of tfrlem3 6325 but for tfr1on 6364 related lemmas). (Contributed by Jim Kingdon, 14-Mar-2022.) |
Ref | Expression |
---|---|
tfr1onlem3ag.1 | ⊢ 𝐴 = {𝑓 ∣ ∃𝑥 ∈ 𝑋 (𝑓 Fn 𝑥 ∧ ∀𝑦 ∈ 𝑥 (𝑓‘𝑦) = (𝐺‘(𝑓 ↾ 𝑦)))} |
Ref | Expression |
---|---|
tfr1onlem3 | ⊢ 𝐴 = {𝑔 ∣ ∃𝑧 ∈ 𝑋 (𝑔 Fn 𝑧 ∧ ∀𝑤 ∈ 𝑧 (𝑔‘𝑤) = (𝐺‘(𝑔 ↾ 𝑤)))} |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | vex 2752 | . . 3 ⊢ 𝑔 ∈ V | |
2 | tfr1onlem3ag.1 | . . . 4 ⊢ 𝐴 = {𝑓 ∣ ∃𝑥 ∈ 𝑋 (𝑓 Fn 𝑥 ∧ ∀𝑦 ∈ 𝑥 (𝑓‘𝑦) = (𝐺‘(𝑓 ↾ 𝑦)))} | |
3 | 2 | tfr1onlem3ag 6351 | . . 3 ⊢ (𝑔 ∈ V → (𝑔 ∈ 𝐴 ↔ ∃𝑧 ∈ 𝑋 (𝑔 Fn 𝑧 ∧ ∀𝑤 ∈ 𝑧 (𝑔‘𝑤) = (𝐺‘(𝑔 ↾ 𝑤))))) |
4 | 1, 3 | ax-mp 5 | . 2 ⊢ (𝑔 ∈ 𝐴 ↔ ∃𝑧 ∈ 𝑋 (𝑔 Fn 𝑧 ∧ ∀𝑤 ∈ 𝑧 (𝑔‘𝑤) = (𝐺‘(𝑔 ↾ 𝑤)))) |
5 | 4 | abbi2i 2302 | 1 ⊢ 𝐴 = {𝑔 ∣ ∃𝑧 ∈ 𝑋 (𝑔 Fn 𝑧 ∧ ∀𝑤 ∈ 𝑧 (𝑔‘𝑤) = (𝐺‘(𝑔 ↾ 𝑤)))} |
Colors of variables: wff set class |
Syntax hints: ∧ wa 104 ↔ wb 105 = wceq 1363 ∈ wcel 2158 {cab 2173 ∀wral 2465 ∃wrex 2466 Vcvv 2749 ↾ cres 4640 Fn wfn 5223 ‘cfv 5228 |
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-io 710 ax-5 1457 ax-7 1458 ax-gen 1459 ax-ie1 1503 ax-ie2 1504 ax-8 1514 ax-10 1515 ax-11 1516 ax-i12 1517 ax-bndl 1519 ax-4 1520 ax-17 1536 ax-i9 1540 ax-ial 1544 ax-i5r 1545 ax-ext 2169 |
This theorem depends on definitions: df-bi 117 df-3an 981 df-tru 1366 df-nf 1471 df-sb 1773 df-clab 2174 df-cleq 2180 df-clel 2183 df-nfc 2318 df-ral 2470 df-rex 2471 df-v 2751 df-un 3145 df-in 3147 df-ss 3154 df-sn 3610 df-pr 3611 df-op 3613 df-uni 3822 df-br 4016 df-opab 4077 df-xp 4644 df-rel 4645 df-cnv 4646 df-co 4647 df-dm 4648 df-res 4650 df-iota 5190 df-fun 5230 df-fn 5231 df-fv 5236 |
This theorem is referenced by: tfr1on 6364 |
Copyright terms: Public domain | W3C validator |