| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > ssrexv | GIF version | ||
| Description: Existential quantification restricted to a subclass. (Contributed by NM, 11-Jan-2007.) |
| Ref | Expression |
|---|---|
| ssrexv | ⊢ (𝐴 ⊆ 𝐵 → (∃𝑥 ∈ 𝐴 𝜑 → ∃𝑥 ∈ 𝐵 𝜑)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ssel 3219 | . . 3 ⊢ (𝐴 ⊆ 𝐵 → (𝑥 ∈ 𝐴 → 𝑥 ∈ 𝐵)) | |
| 2 | 1 | anim1d 336 | . 2 ⊢ (𝐴 ⊆ 𝐵 → ((𝑥 ∈ 𝐴 ∧ 𝜑) → (𝑥 ∈ 𝐵 ∧ 𝜑))) |
| 3 | 2 | reximdv2 2629 | 1 ⊢ (𝐴 ⊆ 𝐵 → (∃𝑥 ∈ 𝐴 𝜑 → ∃𝑥 ∈ 𝐵 𝜑)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∈ wcel 2200 ∃wrex 2509 ⊆ wss 3198 |
| 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-5 1493 ax-7 1494 ax-gen 1495 ax-ie1 1539 ax-ie2 1540 ax-8 1550 ax-11 1552 ax-4 1556 ax-17 1572 ax-i9 1576 ax-ial 1580 ax-i5r 1581 ax-ext 2211 |
| This theorem depends on definitions: df-bi 117 df-nf 1507 df-sb 1809 df-clab 2216 df-cleq 2222 df-clel 2225 df-rex 2514 df-in 3204 df-ss 3211 |
| This theorem is referenced by: iunss1 3979 moriotass 5997 tfr1onlemssrecs 6500 tfrcllemssrecs 6513 fiss 7170 supelti 7195 ctssdclemn0 7303 ctssdc 7306 enumctlemm 7307 nninfwlpoimlemginf 7369 ficardon 7387 rerecapb 9016 lbzbi 9843 zsupcl 10484 infssuzex 10486 fiubm 11085 rexico 11775 alzdvds 12408 bitsfzolem 12508 gcddvds 12527 dvdslegcd 12528 pclemub 12853 subrgdvds 14242 ssrest 14899 plyss 15455 reeff1olem 15488 bj-charfunbi 16356 bj-nn0suc 16509 |
| Copyright terms: Public domain | W3C validator |