| 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 5360 | . 2 ⊢ (𝐹‘𝐴) = (℩𝑥𝐴𝐹𝑥) | |
| 2 | iotass 5330 | . 2 ⊢ (∀𝑥(𝐴𝐹𝑥 → 𝑥 ⊆ 𝐵) → (℩𝑥𝐴𝐹𝑥) ⊆ 𝐵) | |
| 3 | 1, 2 | eqsstrid 3284 | 1 ⊢ (∀𝑥(𝐴𝐹𝑥 → 𝑥 ⊆ 𝐵) → (𝐹‘𝐴) ⊆ 𝐵) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∀wal 1396 ⊆ wss 3211 class class class wbr 4109 ℩cio 5310 ‘cfv 5352 |
| 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 2214 |
| This theorem depends on definitions: df-bi 117 df-tru 1401 df-nf 1510 df-sb 1812 df-clab 2219 df-cleq 2225 df-clel 2228 df-nfc 2373 df-ral 2525 df-rex 2526 df-v 2815 df-un 3215 df-in 3217 df-ss 3224 df-pw 3671 df-sn 3695 df-pr 3696 df-uni 3915 df-iota 5312 df-fv 5360 |
| This theorem is referenced by: fvssunirng 5685 relfvssunirn 5686 sefvex 5691 fvmptss2 5752 tfrexlem 6565 |
| Copyright terms: Public domain | W3C validator |