Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > tfrlemibacc | GIF version |
Description: Each element of 𝐵 is an acceptable function. Lemma for tfrlemi1 6197. (Contributed by Jim Kingdon, 14-Mar-2019.) (Proof shortened by Mario Carneiro, 24-May-2019.) |
Ref | Expression |
---|---|
tfrlemisucfn.1 | ⊢ 𝐴 = {𝑓 ∣ ∃𝑥 ∈ On (𝑓 Fn 𝑥 ∧ ∀𝑦 ∈ 𝑥 (𝑓‘𝑦) = (𝐹‘(𝑓 ↾ 𝑦)))} |
tfrlemisucfn.2 | ⊢ (𝜑 → ∀𝑥(Fun 𝐹 ∧ (𝐹‘𝑥) ∈ V)) |
tfrlemi1.3 | ⊢ 𝐵 = {ℎ ∣ ∃𝑧 ∈ 𝑥 ∃𝑔(𝑔 Fn 𝑧 ∧ 𝑔 ∈ 𝐴 ∧ ℎ = (𝑔 ∪ {〈𝑧, (𝐹‘𝑔)〉}))} |
tfrlemi1.4 | ⊢ (𝜑 → 𝑥 ∈ On) |
tfrlemi1.5 | ⊢ (𝜑 → ∀𝑧 ∈ 𝑥 ∃𝑔(𝑔 Fn 𝑧 ∧ ∀𝑤 ∈ 𝑧 (𝑔‘𝑤) = (𝐹‘(𝑔 ↾ 𝑤)))) |
Ref | Expression |
---|---|
tfrlemibacc | ⊢ (𝜑 → 𝐵 ⊆ 𝐴) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | tfrlemi1.3 | . 2 ⊢ 𝐵 = {ℎ ∣ ∃𝑧 ∈ 𝑥 ∃𝑔(𝑔 Fn 𝑧 ∧ 𝑔 ∈ 𝐴 ∧ ℎ = (𝑔 ∪ {〈𝑧, (𝐹‘𝑔)〉}))} | |
2 | simpr3 974 | . . . . . . 7 ⊢ (((𝜑 ∧ 𝑧 ∈ 𝑥) ∧ (𝑔 Fn 𝑧 ∧ 𝑔 ∈ 𝐴 ∧ ℎ = (𝑔 ∪ {〈𝑧, (𝐹‘𝑔)〉}))) → ℎ = (𝑔 ∪ {〈𝑧, (𝐹‘𝑔)〉})) | |
3 | tfrlemisucfn.1 | . . . . . . . 8 ⊢ 𝐴 = {𝑓 ∣ ∃𝑥 ∈ On (𝑓 Fn 𝑥 ∧ ∀𝑦 ∈ 𝑥 (𝑓‘𝑦) = (𝐹‘(𝑓 ↾ 𝑦)))} | |
4 | tfrlemisucfn.2 | . . . . . . . . 9 ⊢ (𝜑 → ∀𝑥(Fun 𝐹 ∧ (𝐹‘𝑥) ∈ V)) | |
5 | 4 | ad2antrr 479 | . . . . . . . 8 ⊢ (((𝜑 ∧ 𝑧 ∈ 𝑥) ∧ (𝑔 Fn 𝑧 ∧ 𝑔 ∈ 𝐴 ∧ ℎ = (𝑔 ∪ {〈𝑧, (𝐹‘𝑔)〉}))) → ∀𝑥(Fun 𝐹 ∧ (𝐹‘𝑥) ∈ V)) |
6 | tfrlemi1.4 | . . . . . . . . . 10 ⊢ (𝜑 → 𝑥 ∈ On) | |
7 | 6 | ad2antrr 479 | . . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑧 ∈ 𝑥) ∧ (𝑔 Fn 𝑧 ∧ 𝑔 ∈ 𝐴 ∧ ℎ = (𝑔 ∪ {〈𝑧, (𝐹‘𝑔)〉}))) → 𝑥 ∈ On) |
8 | simplr 504 | . . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑧 ∈ 𝑥) ∧ (𝑔 Fn 𝑧 ∧ 𝑔 ∈ 𝐴 ∧ ℎ = (𝑔 ∪ {〈𝑧, (𝐹‘𝑔)〉}))) → 𝑧 ∈ 𝑥) | |
9 | onelon 4276 | . . . . . . . . 9 ⊢ ((𝑥 ∈ On ∧ 𝑧 ∈ 𝑥) → 𝑧 ∈ On) | |
10 | 7, 8, 9 | syl2anc 408 | . . . . . . . 8 ⊢ (((𝜑 ∧ 𝑧 ∈ 𝑥) ∧ (𝑔 Fn 𝑧 ∧ 𝑔 ∈ 𝐴 ∧ ℎ = (𝑔 ∪ {〈𝑧, (𝐹‘𝑔)〉}))) → 𝑧 ∈ On) |
11 | simpr1 972 | . . . . . . . 8 ⊢ (((𝜑 ∧ 𝑧 ∈ 𝑥) ∧ (𝑔 Fn 𝑧 ∧ 𝑔 ∈ 𝐴 ∧ ℎ = (𝑔 ∪ {〈𝑧, (𝐹‘𝑔)〉}))) → 𝑔 Fn 𝑧) | |
12 | simpr2 973 | . . . . . . . 8 ⊢ (((𝜑 ∧ 𝑧 ∈ 𝑥) ∧ (𝑔 Fn 𝑧 ∧ 𝑔 ∈ 𝐴 ∧ ℎ = (𝑔 ∪ {〈𝑧, (𝐹‘𝑔)〉}))) → 𝑔 ∈ 𝐴) | |
13 | 3, 5, 10, 11, 12 | tfrlemisucaccv 6190 | . . . . . . 7 ⊢ (((𝜑 ∧ 𝑧 ∈ 𝑥) ∧ (𝑔 Fn 𝑧 ∧ 𝑔 ∈ 𝐴 ∧ ℎ = (𝑔 ∪ {〈𝑧, (𝐹‘𝑔)〉}))) → (𝑔 ∪ {〈𝑧, (𝐹‘𝑔)〉}) ∈ 𝐴) |
14 | 2, 13 | eqeltrd 2194 | . . . . . 6 ⊢ (((𝜑 ∧ 𝑧 ∈ 𝑥) ∧ (𝑔 Fn 𝑧 ∧ 𝑔 ∈ 𝐴 ∧ ℎ = (𝑔 ∪ {〈𝑧, (𝐹‘𝑔)〉}))) → ℎ ∈ 𝐴) |
15 | 14 | ex 114 | . . . . 5 ⊢ ((𝜑 ∧ 𝑧 ∈ 𝑥) → ((𝑔 Fn 𝑧 ∧ 𝑔 ∈ 𝐴 ∧ ℎ = (𝑔 ∪ {〈𝑧, (𝐹‘𝑔)〉})) → ℎ ∈ 𝐴)) |
16 | 15 | exlimdv 1775 | . . . 4 ⊢ ((𝜑 ∧ 𝑧 ∈ 𝑥) → (∃𝑔(𝑔 Fn 𝑧 ∧ 𝑔 ∈ 𝐴 ∧ ℎ = (𝑔 ∪ {〈𝑧, (𝐹‘𝑔)〉})) → ℎ ∈ 𝐴)) |
17 | 16 | rexlimdva 2526 | . . 3 ⊢ (𝜑 → (∃𝑧 ∈ 𝑥 ∃𝑔(𝑔 Fn 𝑧 ∧ 𝑔 ∈ 𝐴 ∧ ℎ = (𝑔 ∪ {〈𝑧, (𝐹‘𝑔)〉})) → ℎ ∈ 𝐴)) |
18 | 17 | abssdv 3141 | . 2 ⊢ (𝜑 → {ℎ ∣ ∃𝑧 ∈ 𝑥 ∃𝑔(𝑔 Fn 𝑧 ∧ 𝑔 ∈ 𝐴 ∧ ℎ = (𝑔 ∪ {〈𝑧, (𝐹‘𝑔)〉}))} ⊆ 𝐴) |
19 | 1, 18 | eqsstrid 3113 | 1 ⊢ (𝜑 → 𝐵 ⊆ 𝐴) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 103 ∧ w3a 947 ∀wal 1314 = wceq 1316 ∃wex 1453 ∈ wcel 1465 {cab 2103 ∀wral 2393 ∃wrex 2394 Vcvv 2660 ∪ cun 3039 ⊆ wss 3041 {csn 3497 〈cop 3500 Oncon0 4255 ↾ cres 4511 Fun wfun 5087 Fn wfn 5088 ‘cfv 5093 |
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 588 ax-in2 589 ax-io 683 ax-5 1408 ax-7 1409 ax-gen 1410 ax-ie1 1454 ax-ie2 1455 ax-8 1467 ax-10 1468 ax-11 1469 ax-i12 1470 ax-bndl 1471 ax-4 1472 ax-13 1476 ax-14 1477 ax-17 1491 ax-i9 1495 ax-ial 1499 ax-i5r 1500 ax-ext 2099 ax-sep 4016 ax-pow 4068 ax-pr 4101 ax-un 4325 ax-setind 4422 |
This theorem depends on definitions: df-bi 116 df-3an 949 df-tru 1319 df-fal 1322 df-nf 1422 df-sb 1721 df-eu 1980 df-mo 1981 df-clab 2104 df-cleq 2110 df-clel 2113 df-nfc 2247 df-ne 2286 df-ral 2398 df-rex 2399 df-v 2662 df-sbc 2883 df-dif 3043 df-un 3045 df-in 3047 df-ss 3054 df-nul 3334 df-pw 3482 df-sn 3503 df-pr 3504 df-op 3506 df-uni 3707 df-br 3900 df-opab 3960 df-tr 3997 df-id 4185 df-iord 4258 df-on 4260 df-suc 4263 df-xp 4515 df-rel 4516 df-cnv 4517 df-co 4518 df-dm 4519 df-res 4521 df-iota 5058 df-fun 5095 df-fn 5096 df-fv 5101 |
This theorem is referenced by: tfrlemibfn 6193 tfrlemiubacc 6195 |
Copyright terms: Public domain | W3C validator |