| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > fvss | GIF version | ||
| Description: The value of a function is a subset of 𝐵 if every element that could be a candidate for the value is a subset of 𝐵. (Contributed by Mario Carneiro, 24-May-2019.) |
| Ref | Expression |
|---|---|
| fvss | ⊢ (∀𝑥(𝐴𝐹𝑥 → 𝑥 ⊆ 𝐵) → (𝐹‘𝐴) ⊆ 𝐵) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | df-fv 5341 | . 2 ⊢ (𝐹‘𝐴) = (℩𝑥𝐴𝐹𝑥) | |
| 2 | iotass 5311 | . 2 ⊢ (∀𝑥(𝐴𝐹𝑥 → 𝑥 ⊆ 𝐵) → (℩𝑥𝐴𝐹𝑥) ⊆ 𝐵) | |
| 3 | 1, 2 | eqsstrid 3274 | 1 ⊢ (∀𝑥(𝐴𝐹𝑥 → 𝑥 ⊆ 𝐵) → (𝐹‘𝐴) ⊆ 𝐵) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∀wal 1396 ⊆ wss 3201 class class class wbr 4093 ℩cio 5291 ‘cfv 5333 |
| 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 717 ax-5 1496 ax-7 1497 ax-gen 1498 ax-ie1 1542 ax-ie2 1543 ax-8 1553 ax-10 1554 ax-11 1555 ax-i12 1556 ax-bndl 1558 ax-4 1559 ax-17 1575 ax-i9 1579 ax-ial 1583 ax-i5r 1584 ax-ext 2213 |
| This theorem depends on definitions: df-bi 117 df-tru 1401 df-nf 1510 df-sb 1811 df-clab 2218 df-cleq 2224 df-clel 2227 df-nfc 2364 df-ral 2516 df-rex 2517 df-v 2805 df-un 3205 df-in 3207 df-ss 3214 df-pw 3658 df-sn 3679 df-pr 3680 df-uni 3899 df-iota 5293 df-fv 5341 |
| This theorem is referenced by: fvssunirng 5663 relfvssunirn 5664 sefvex 5669 fvmptss2 5730 tfrexlem 6543 |
| Copyright terms: Public domain | W3C validator |