Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > tfrcllemsucfn | GIF version |
Description: We can extend an acceptable function by one element to produce a function. Lemma for tfrcl 6308. (Contributed by Jim Kingdon, 24-Mar-2022.) |
Ref | Expression |
---|---|
tfrcl.f | ⊢ 𝐹 = recs(𝐺) |
tfrcl.g | ⊢ (𝜑 → Fun 𝐺) |
tfrcl.x | ⊢ (𝜑 → Ord 𝑋) |
tfrcl.ex | ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋 ∧ 𝑓:𝑥⟶𝑆) → (𝐺‘𝑓) ∈ 𝑆) |
tfrcllemsucfn.1 | ⊢ 𝐴 = {𝑓 ∣ ∃𝑥 ∈ 𝑋 (𝑓:𝑥⟶𝑆 ∧ ∀𝑦 ∈ 𝑥 (𝑓‘𝑦) = (𝐺‘(𝑓 ↾ 𝑦)))} |
tfrcllemsucfn.3 | ⊢ (𝜑 → 𝑧 ∈ 𝑋) |
tfrcllemsucfn.4 | ⊢ (𝜑 → 𝑔:𝑧⟶𝑆) |
tfrcllemsucfn.5 | ⊢ (𝜑 → 𝑔 ∈ 𝐴) |
Ref | Expression |
---|---|
tfrcllemsucfn | ⊢ (𝜑 → (𝑔 ∪ {〈𝑧, (𝐺‘𝑔)〉}):suc 𝑧⟶𝑆) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | tfrcllemsucfn.4 | . . 3 ⊢ (𝜑 → 𝑔:𝑧⟶𝑆) | |
2 | tfrcllemsucfn.3 | . . . 4 ⊢ (𝜑 → 𝑧 ∈ 𝑋) | |
3 | 2 | elexd 2725 | . . 3 ⊢ (𝜑 → 𝑧 ∈ V) |
4 | tfrcl.x | . . . . 5 ⊢ (𝜑 → Ord 𝑋) | |
5 | ordelon 4343 | . . . . 5 ⊢ ((Ord 𝑋 ∧ 𝑧 ∈ 𝑋) → 𝑧 ∈ On) | |
6 | 4, 2, 5 | syl2anc 409 | . . . 4 ⊢ (𝜑 → 𝑧 ∈ On) |
7 | eloni 4335 | . . . 4 ⊢ (𝑧 ∈ On → Ord 𝑧) | |
8 | ordirr 4500 | . . . 4 ⊢ (Ord 𝑧 → ¬ 𝑧 ∈ 𝑧) | |
9 | 6, 7, 8 | 3syl 17 | . . 3 ⊢ (𝜑 → ¬ 𝑧 ∈ 𝑧) |
10 | feq2 5302 | . . . . . . 7 ⊢ (𝑥 = 𝑧 → (𝑓:𝑥⟶𝑆 ↔ 𝑓:𝑧⟶𝑆)) | |
11 | 10 | imbi1d 230 | . . . . . 6 ⊢ (𝑥 = 𝑧 → ((𝑓:𝑥⟶𝑆 → (𝐺‘𝑓) ∈ 𝑆) ↔ (𝑓:𝑧⟶𝑆 → (𝐺‘𝑓) ∈ 𝑆))) |
12 | 11 | albidv 1804 | . . . . 5 ⊢ (𝑥 = 𝑧 → (∀𝑓(𝑓:𝑥⟶𝑆 → (𝐺‘𝑓) ∈ 𝑆) ↔ ∀𝑓(𝑓:𝑧⟶𝑆 → (𝐺‘𝑓) ∈ 𝑆))) |
13 | tfrcl.ex | . . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋 ∧ 𝑓:𝑥⟶𝑆) → (𝐺‘𝑓) ∈ 𝑆) | |
14 | 13 | 3expia 1187 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → (𝑓:𝑥⟶𝑆 → (𝐺‘𝑓) ∈ 𝑆)) |
15 | 14 | alrimiv 1854 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → ∀𝑓(𝑓:𝑥⟶𝑆 → (𝐺‘𝑓) ∈ 𝑆)) |
16 | 15 | ralrimiva 2530 | . . . . 5 ⊢ (𝜑 → ∀𝑥 ∈ 𝑋 ∀𝑓(𝑓:𝑥⟶𝑆 → (𝐺‘𝑓) ∈ 𝑆)) |
17 | 12, 16, 2 | rspcdva 2821 | . . . 4 ⊢ (𝜑 → ∀𝑓(𝑓:𝑧⟶𝑆 → (𝐺‘𝑓) ∈ 𝑆)) |
18 | feq1 5301 | . . . . . 6 ⊢ (𝑓 = 𝑔 → (𝑓:𝑧⟶𝑆 ↔ 𝑔:𝑧⟶𝑆)) | |
19 | fveq2 5467 | . . . . . . 7 ⊢ (𝑓 = 𝑔 → (𝐺‘𝑓) = (𝐺‘𝑔)) | |
20 | 19 | eleq1d 2226 | . . . . . 6 ⊢ (𝑓 = 𝑔 → ((𝐺‘𝑓) ∈ 𝑆 ↔ (𝐺‘𝑔) ∈ 𝑆)) |
21 | 18, 20 | imbi12d 233 | . . . . 5 ⊢ (𝑓 = 𝑔 → ((𝑓:𝑧⟶𝑆 → (𝐺‘𝑓) ∈ 𝑆) ↔ (𝑔:𝑧⟶𝑆 → (𝐺‘𝑔) ∈ 𝑆))) |
22 | 21 | spv 1840 | . . . 4 ⊢ (∀𝑓(𝑓:𝑧⟶𝑆 → (𝐺‘𝑓) ∈ 𝑆) → (𝑔:𝑧⟶𝑆 → (𝐺‘𝑔) ∈ 𝑆)) |
23 | 17, 1, 22 | sylc 62 | . . 3 ⊢ (𝜑 → (𝐺‘𝑔) ∈ 𝑆) |
24 | fsnunf 5666 | . . 3 ⊢ ((𝑔:𝑧⟶𝑆 ∧ (𝑧 ∈ V ∧ ¬ 𝑧 ∈ 𝑧) ∧ (𝐺‘𝑔) ∈ 𝑆) → (𝑔 ∪ {〈𝑧, (𝐺‘𝑔)〉}):(𝑧 ∪ {𝑧})⟶𝑆) | |
25 | 1, 3, 9, 23, 24 | syl121anc 1225 | . 2 ⊢ (𝜑 → (𝑔 ∪ {〈𝑧, (𝐺‘𝑔)〉}):(𝑧 ∪ {𝑧})⟶𝑆) |
26 | df-suc 4331 | . . 3 ⊢ suc 𝑧 = (𝑧 ∪ {𝑧}) | |
27 | 26 | feq2i 5312 | . 2 ⊢ ((𝑔 ∪ {〈𝑧, (𝐺‘𝑔)〉}):suc 𝑧⟶𝑆 ↔ (𝑔 ∪ {〈𝑧, (𝐺‘𝑔)〉}):(𝑧 ∪ {𝑧})⟶𝑆) |
28 | 25, 27 | sylibr 133 | 1 ⊢ (𝜑 → (𝑔 ∪ {〈𝑧, (𝐺‘𝑔)〉}):suc 𝑧⟶𝑆) |
Colors of variables: wff set class |
Syntax hints: ¬ wn 3 → wi 4 ∧ wa 103 ∧ w3a 963 ∀wal 1333 = wceq 1335 ∈ wcel 2128 {cab 2143 ∀wral 2435 ∃wrex 2436 Vcvv 2712 ∪ cun 3100 {csn 3560 〈cop 3563 Ord word 4322 Oncon0 4323 suc csuc 4325 ↾ cres 4587 Fun wfun 5163 ⟶wf 5165 ‘cfv 5169 recscrecs 6248 |
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 1427 ax-7 1428 ax-gen 1429 ax-ie1 1473 ax-ie2 1474 ax-8 1484 ax-10 1485 ax-11 1486 ax-i12 1487 ax-bndl 1489 ax-4 1490 ax-17 1506 ax-i9 1510 ax-ial 1514 ax-i5r 1515 ax-14 2131 ax-ext 2139 ax-sep 4082 ax-pow 4135 ax-pr 4169 ax-setind 4495 |
This theorem depends on definitions: df-bi 116 df-3an 965 df-tru 1338 df-fal 1341 df-nf 1441 df-sb 1743 df-eu 2009 df-mo 2010 df-clab 2144 df-cleq 2150 df-clel 2153 df-nfc 2288 df-ne 2328 df-ral 2440 df-rex 2441 df-v 2714 df-dif 3104 df-un 3106 df-in 3108 df-ss 3115 df-nul 3395 df-pw 3545 df-sn 3566 df-pr 3567 df-op 3569 df-uni 3773 df-br 3966 df-opab 4026 df-tr 4063 df-id 4253 df-iord 4326 df-on 4328 df-suc 4331 df-xp 4591 df-rel 4592 df-cnv 4593 df-co 4594 df-dm 4595 df-rn 4596 df-iota 5134 df-fun 5171 df-fn 5172 df-f 5173 df-f1 5174 df-fo 5175 df-f1o 5176 df-fv 5177 |
This theorem is referenced by: tfrcllemsucaccv 6298 tfrcllembfn 6301 |
Copyright terms: Public domain | W3C validator |