| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > fvmptss2 | GIF version | ||
| Description: A mapping always evaluates to a subset of the substituted expression in the mapping, even if this is a proper class, or we are out of the domain. (Contributed by Mario Carneiro, 13-Feb-2015.) (Revised by Mario Carneiro, 3-Jul-2019.) |
| Ref | Expression |
|---|---|
| fvmptss2.1 | ⊢ (𝑥 = 𝐷 → 𝐵 = 𝐶) |
| fvmptss2.2 | ⊢ 𝐹 = (𝑥 ∈ 𝐴 ↦ 𝐵) |
| Ref | Expression |
|---|---|
| fvmptss2 | ⊢ (𝐹‘𝐷) ⊆ 𝐶 |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | fvss 5707 | . 2 ⊢ (∀𝑦(𝐷𝐹𝑦 → 𝑦 ⊆ 𝐶) → (𝐹‘𝐷) ⊆ 𝐶) | |
| 2 | fvmptss2.2 | . . . . . 6 ⊢ 𝐹 = (𝑥 ∈ 𝐴 ↦ 𝐵) | |
| 3 | 2 | funmpt2 5414 | . . . . 5 ⊢ Fun 𝐹 |
| 4 | funrel 5392 | . . . . 5 ⊢ (Fun 𝐹 → Rel 𝐹) | |
| 5 | 3, 4 | ax-mp 5 | . . . 4 ⊢ Rel 𝐹 |
| 6 | 5 | brrelex1i 4816 | . . 3 ⊢ (𝐷𝐹𝑦 → 𝐷 ∈ V) |
| 7 | nfcv 2392 | . . . 4 ⊢ Ⅎ𝑥𝐷 | |
| 8 | nfmpt1 4222 | . . . . . . 7 ⊢ Ⅎ𝑥(𝑥 ∈ 𝐴 ↦ 𝐵) | |
| 9 | 2, 8 | nfcxfr 2389 | . . . . . 6 ⊢ Ⅎ𝑥𝐹 |
| 10 | nfcv 2392 | . . . . . 6 ⊢ Ⅎ𝑥𝑦 | |
| 11 | 7, 9, 10 | nfbr 4175 | . . . . 5 ⊢ Ⅎ𝑥 𝐷𝐹𝑦 |
| 12 | nfv 1581 | . . . . 5 ⊢ Ⅎ𝑥 𝑦 ⊆ 𝐶 | |
| 13 | 11, 12 | nfim 1625 | . . . 4 ⊢ Ⅎ𝑥(𝐷𝐹𝑦 → 𝑦 ⊆ 𝐶) |
| 14 | breq1 4131 | . . . . 5 ⊢ (𝑥 = 𝐷 → (𝑥𝐹𝑦 ↔ 𝐷𝐹𝑦)) | |
| 15 | fvmptss2.1 | . . . . . 6 ⊢ (𝑥 = 𝐷 → 𝐵 = 𝐶) | |
| 16 | 15 | sseq2d 3278 | . . . . 5 ⊢ (𝑥 = 𝐷 → (𝑦 ⊆ 𝐵 ↔ 𝑦 ⊆ 𝐶)) |
| 17 | 14, 16 | imbi12d 234 | . . . 4 ⊢ (𝑥 = 𝐷 → ((𝑥𝐹𝑦 → 𝑦 ⊆ 𝐵) ↔ (𝐷𝐹𝑦 → 𝑦 ⊆ 𝐶))) |
| 18 | df-br 4129 | . . . . 5 ⊢ (𝑥𝐹𝑦 ↔ 〈𝑥, 𝑦〉 ∈ 𝐹) | |
| 19 | opabid 4396 | . . . . . . 7 ⊢ (〈𝑥, 𝑦〉 ∈ {〈𝑥, 𝑦〉 ∣ (𝑥 ∈ 𝐴 ∧ 𝑦 = 𝐵)} ↔ (𝑥 ∈ 𝐴 ∧ 𝑦 = 𝐵)) | |
| 20 | eqimss 3302 | . . . . . . . 8 ⊢ (𝑦 = 𝐵 → 𝑦 ⊆ 𝐵) | |
| 21 | 20 | adantl 277 | . . . . . . 7 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝑦 = 𝐵) → 𝑦 ⊆ 𝐵) |
| 22 | 19, 21 | sylbi 121 | . . . . . 6 ⊢ (〈𝑥, 𝑦〉 ∈ {〈𝑥, 𝑦〉 ∣ (𝑥 ∈ 𝐴 ∧ 𝑦 = 𝐵)} → 𝑦 ⊆ 𝐵) |
| 23 | df-mpt 4192 | . . . . . . 7 ⊢ (𝑥 ∈ 𝐴 ↦ 𝐵) = {〈𝑥, 𝑦〉 ∣ (𝑥 ∈ 𝐴 ∧ 𝑦 = 𝐵)} | |
| 24 | 2, 23 | eqtri 2259 | . . . . . 6 ⊢ 𝐹 = {〈𝑥, 𝑦〉 ∣ (𝑥 ∈ 𝐴 ∧ 𝑦 = 𝐵)} |
| 25 | 22, 24 | eleq2s 2333 | . . . . 5 ⊢ (〈𝑥, 𝑦〉 ∈ 𝐹 → 𝑦 ⊆ 𝐵) |
| 26 | 18, 25 | sylbi 121 | . . . 4 ⊢ (𝑥𝐹𝑦 → 𝑦 ⊆ 𝐵) |
| 27 | 7, 13, 17, 26 | vtoclgf 2881 | . . 3 ⊢ (𝐷 ∈ V → (𝐷𝐹𝑦 → 𝑦 ⊆ 𝐶)) |
| 28 | 6, 27 | mpcom 36 | . 2 ⊢ (𝐷𝐹𝑦 → 𝑦 ⊆ 𝐶) |
| 29 | 1, 28 | mpg 1504 | 1 ⊢ (𝐹‘𝐷) ⊆ 𝐶 |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 = wceq 1402 ∈ wcel 2209 Vcvv 2821 ⊆ wss 3220 〈cop 3711 class class class wbr 4128 {copab 4189 ↦ cmpt 4190 Rel wrel 4777 Fun wfun 5369 ‘cfv 5375 |
| 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 721 ax-5 1500 ax-7 1501 ax-gen 1502 ax-ie1 1546 ax-ie2 1547 ax-8 1557 ax-10 1558 ax-11 1559 ax-i12 1560 ax-bndl 1562 ax-4 1563 ax-17 1579 ax-i9 1583 ax-ial 1587 ax-i5r 1588 ax-14 2212 ax-ext 2220 ax-sep 4247 ax-pow 4309 ax-pr 4344 |
| This theorem depends on definitions: df-bi 117 df-3an 1011 df-tru 1405 df-nf 1514 df-sb 1816 df-eu 2089 df-mo 2090 df-clab 2225 df-cleq 2231 df-clel 2234 df-nfc 2381 df-ral 2533 df-rex 2534 df-v 2823 df-un 3224 df-in 3226 df-ss 3233 df-pw 3690 df-sn 3714 df-pr 3715 df-op 3717 df-uni 3934 df-br 4129 df-opab 4191 df-mpt 4192 df-id 4436 df-xp 4778 df-rel 4779 df-cnv 4780 df-co 4781 df-iota 5335 df-fun 5377 df-fv 5383 |
| This theorem is referenced by: mptfvex 5788 |
| Copyright terms: Public domain | W3C validator |