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 5131 | . 2 ⊢ (𝐹‘𝐴) = (℩𝑥𝐴𝐹𝑥) | |
2 | iotass 5105 | . 2 ⊢ (∀𝑥(𝐴𝐹𝑥 → 𝑥 ⊆ 𝐵) → (℩𝑥𝐴𝐹𝑥) ⊆ 𝐵) | |
3 | 1, 2 | eqsstrid 3143 | 1 ⊢ (∀𝑥(𝐴𝐹𝑥 → 𝑥 ⊆ 𝐵) → (𝐹‘𝐴) ⊆ 𝐵) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∀wal 1329 ⊆ wss 3071 class class class wbr 3929 ℩cio 5086 ‘cfv 5123 |
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-io 698 ax-5 1423 ax-7 1424 ax-gen 1425 ax-ie1 1469 ax-ie2 1470 ax-8 1482 ax-10 1483 ax-11 1484 ax-i12 1485 ax-bndl 1486 ax-4 1487 ax-17 1506 ax-i9 1510 ax-ial 1514 ax-i5r 1515 ax-ext 2121 |
This theorem depends on definitions: df-bi 116 df-tru 1334 df-nf 1437 df-sb 1736 df-clab 2126 df-cleq 2132 df-clel 2135 df-nfc 2270 df-ral 2421 df-rex 2422 df-v 2688 df-un 3075 df-in 3077 df-ss 3084 df-pw 3512 df-sn 3533 df-pr 3534 df-uni 3737 df-iota 5088 df-fv 5131 |
This theorem is referenced by: fvssunirng 5436 relfvssunirn 5437 sefvex 5442 fvmptss2 5496 tfrexlem 6231 |
Copyright terms: Public domain | W3C validator |