![]() |
Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > ILE Home > Th. List > tfrcllemex | GIF version |
Description: Lemma for tfrcl 6417. (Contributed by Jim Kingdon, 26-Mar-2022.) |
Ref | Expression |
---|---|
tfrcl.f | ⊢ 𝐹 = recs(𝐺) |
tfrcl.g | ⊢ (𝜑 → Fun 𝐺) |
tfrcl.x | ⊢ (𝜑 → Ord 𝑋) |
tfrcl.ex | ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋 ∧ 𝑓:𝑥⟶𝑆) → (𝐺‘𝑓) ∈ 𝑆) |
tfrcllemsucfn.1 | ⊢ 𝐴 = {𝑓 ∣ ∃𝑥 ∈ 𝑋 (𝑓:𝑥⟶𝑆 ∧ ∀𝑦 ∈ 𝑥 (𝑓‘𝑦) = (𝐺‘(𝑓 ↾ 𝑦)))} |
tfrcllembacc.3 | ⊢ 𝐵 = {ℎ ∣ ∃𝑧 ∈ 𝐷 ∃𝑔(𝑔:𝑧⟶𝑆 ∧ 𝑔 ∈ 𝐴 ∧ ℎ = (𝑔 ∪ {〈𝑧, (𝐺‘𝑔)〉}))} |
tfrcllembacc.u | ⊢ ((𝜑 ∧ 𝑥 ∈ ∪ 𝑋) → suc 𝑥 ∈ 𝑋) |
tfrcllembacc.4 | ⊢ (𝜑 → 𝐷 ∈ 𝑋) |
tfrcllembacc.5 | ⊢ (𝜑 → ∀𝑧 ∈ 𝐷 ∃𝑔(𝑔:𝑧⟶𝑆 ∧ ∀𝑤 ∈ 𝑧 (𝑔‘𝑤) = (𝐺‘(𝑔 ↾ 𝑤)))) |
Ref | Expression |
---|---|
tfrcllemex | ⊢ (𝜑 → ∃𝑓(𝑓:𝐷⟶𝑆 ∧ ∀𝑢 ∈ 𝐷 (𝑓‘𝑢) = (𝐺‘(𝑓 ↾ 𝑢)))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | tfrcl.f | . . . 4 ⊢ 𝐹 = recs(𝐺) | |
2 | tfrcl.g | . . . 4 ⊢ (𝜑 → Fun 𝐺) | |
3 | tfrcl.x | . . . 4 ⊢ (𝜑 → Ord 𝑋) | |
4 | tfrcl.ex | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋 ∧ 𝑓:𝑥⟶𝑆) → (𝐺‘𝑓) ∈ 𝑆) | |
5 | tfrcllemsucfn.1 | . . . 4 ⊢ 𝐴 = {𝑓 ∣ ∃𝑥 ∈ 𝑋 (𝑓:𝑥⟶𝑆 ∧ ∀𝑦 ∈ 𝑥 (𝑓‘𝑦) = (𝐺‘(𝑓 ↾ 𝑦)))} | |
6 | tfrcllembacc.3 | . . . 4 ⊢ 𝐵 = {ℎ ∣ ∃𝑧 ∈ 𝐷 ∃𝑔(𝑔:𝑧⟶𝑆 ∧ 𝑔 ∈ 𝐴 ∧ ℎ = (𝑔 ∪ {〈𝑧, (𝐺‘𝑔)〉}))} | |
7 | tfrcllembacc.u | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ ∪ 𝑋) → suc 𝑥 ∈ 𝑋) | |
8 | tfrcllembacc.4 | . . . 4 ⊢ (𝜑 → 𝐷 ∈ 𝑋) | |
9 | tfrcllembacc.5 | . . . 4 ⊢ (𝜑 → ∀𝑧 ∈ 𝐷 ∃𝑔(𝑔:𝑧⟶𝑆 ∧ ∀𝑤 ∈ 𝑧 (𝑔‘𝑤) = (𝐺‘(𝑔 ↾ 𝑤)))) | |
10 | 1, 2, 3, 4, 5, 6, 7, 8, 9 | tfrcllembex 6411 | . . 3 ⊢ (𝜑 → 𝐵 ∈ V) |
11 | uniexg 4470 | . . 3 ⊢ (𝐵 ∈ V → ∪ 𝐵 ∈ V) | |
12 | 10, 11 | syl 14 | . 2 ⊢ (𝜑 → ∪ 𝐵 ∈ V) |
13 | 1, 2, 3, 4, 5, 6, 7, 8, 9 | tfrcllembfn 6410 | . . 3 ⊢ (𝜑 → ∪ 𝐵:𝐷⟶𝑆) |
14 | 1, 2, 3, 4, 5, 6, 7, 8, 9 | tfrcllemubacc 6412 | . . 3 ⊢ (𝜑 → ∀𝑢 ∈ 𝐷 (∪ 𝐵‘𝑢) = (𝐺‘(∪ 𝐵 ↾ 𝑢))) |
15 | 13, 14 | jca 306 | . 2 ⊢ (𝜑 → (∪ 𝐵:𝐷⟶𝑆 ∧ ∀𝑢 ∈ 𝐷 (∪ 𝐵‘𝑢) = (𝐺‘(∪ 𝐵 ↾ 𝑢)))) |
16 | feq1 5386 | . . . 4 ⊢ (𝑓 = ∪ 𝐵 → (𝑓:𝐷⟶𝑆 ↔ ∪ 𝐵:𝐷⟶𝑆)) | |
17 | fveq1 5553 | . . . . . 6 ⊢ (𝑓 = ∪ 𝐵 → (𝑓‘𝑢) = (∪ 𝐵‘𝑢)) | |
18 | reseq1 4936 | . . . . . . 7 ⊢ (𝑓 = ∪ 𝐵 → (𝑓 ↾ 𝑢) = (∪ 𝐵 ↾ 𝑢)) | |
19 | 18 | fveq2d 5558 | . . . . . 6 ⊢ (𝑓 = ∪ 𝐵 → (𝐺‘(𝑓 ↾ 𝑢)) = (𝐺‘(∪ 𝐵 ↾ 𝑢))) |
20 | 17, 19 | eqeq12d 2208 | . . . . 5 ⊢ (𝑓 = ∪ 𝐵 → ((𝑓‘𝑢) = (𝐺‘(𝑓 ↾ 𝑢)) ↔ (∪ 𝐵‘𝑢) = (𝐺‘(∪ 𝐵 ↾ 𝑢)))) |
21 | 20 | ralbidv 2494 | . . . 4 ⊢ (𝑓 = ∪ 𝐵 → (∀𝑢 ∈ 𝐷 (𝑓‘𝑢) = (𝐺‘(𝑓 ↾ 𝑢)) ↔ ∀𝑢 ∈ 𝐷 (∪ 𝐵‘𝑢) = (𝐺‘(∪ 𝐵 ↾ 𝑢)))) |
22 | 16, 21 | anbi12d 473 | . . 3 ⊢ (𝑓 = ∪ 𝐵 → ((𝑓:𝐷⟶𝑆 ∧ ∀𝑢 ∈ 𝐷 (𝑓‘𝑢) = (𝐺‘(𝑓 ↾ 𝑢))) ↔ (∪ 𝐵:𝐷⟶𝑆 ∧ ∀𝑢 ∈ 𝐷 (∪ 𝐵‘𝑢) = (𝐺‘(∪ 𝐵 ↾ 𝑢))))) |
23 | 22 | spcegv 2848 | . 2 ⊢ (∪ 𝐵 ∈ V → ((∪ 𝐵:𝐷⟶𝑆 ∧ ∀𝑢 ∈ 𝐷 (∪ 𝐵‘𝑢) = (𝐺‘(∪ 𝐵 ↾ 𝑢))) → ∃𝑓(𝑓:𝐷⟶𝑆 ∧ ∀𝑢 ∈ 𝐷 (𝑓‘𝑢) = (𝐺‘(𝑓 ↾ 𝑢))))) |
24 | 12, 15, 23 | sylc 62 | 1 ⊢ (𝜑 → ∃𝑓(𝑓:𝐷⟶𝑆 ∧ ∀𝑢 ∈ 𝐷 (𝑓‘𝑢) = (𝐺‘(𝑓 ↾ 𝑢)))) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 104 ∧ w3a 980 = wceq 1364 ∃wex 1503 ∈ wcel 2164 {cab 2179 ∀wral 2472 ∃wrex 2473 Vcvv 2760 ∪ cun 3151 {csn 3618 〈cop 3621 ∪ cuni 3835 Ord word 4393 suc csuc 4396 ↾ cres 4661 Fun wfun 5248 ⟶wf 5250 ‘cfv 5254 recscrecs 6357 |
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 615 ax-in2 616 ax-io 710 ax-5 1458 ax-7 1459 ax-gen 1460 ax-ie1 1504 ax-ie2 1505 ax-8 1515 ax-10 1516 ax-11 1517 ax-i12 1518 ax-bndl 1520 ax-4 1521 ax-17 1537 ax-i9 1541 ax-ial 1545 ax-i5r 1546 ax-13 2166 ax-14 2167 ax-ext 2175 ax-coll 4144 ax-sep 4147 ax-pow 4203 ax-pr 4238 ax-un 4464 ax-setind 4569 |
This theorem depends on definitions: df-bi 117 df-3an 982 df-tru 1367 df-fal 1370 df-nf 1472 df-sb 1774 df-eu 2045 df-mo 2046 df-clab 2180 df-cleq 2186 df-clel 2189 df-nfc 2325 df-ne 2365 df-ral 2477 df-rex 2478 df-reu 2479 df-rab 2481 df-v 2762 df-sbc 2986 df-csb 3081 df-dif 3155 df-un 3157 df-in 3159 df-ss 3166 df-nul 3447 df-pw 3603 df-sn 3624 df-pr 3625 df-op 3627 df-uni 3836 df-iun 3914 df-br 4030 df-opab 4091 df-mpt 4092 df-tr 4128 df-id 4324 df-iord 4397 df-on 4399 df-suc 4402 df-xp 4665 df-rel 4666 df-cnv 4667 df-co 4668 df-dm 4669 df-rn 4670 df-res 4671 df-ima 4672 df-iota 5215 df-fun 5256 df-fn 5257 df-f 5258 df-f1 5259 df-fo 5260 df-f1o 5261 df-fv 5262 df-recs 6358 |
This theorem is referenced by: tfrcllemaccex 6414 |
Copyright terms: Public domain | W3C validator |