Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > rexss | Structured version Visualization version GIF version |
Description: Restricted existential quantification on a subset in terms of superset. (Contributed by Stefan O'Rear, 3-Apr-2015.) |
Ref | Expression |
---|---|
rexss | ⊢ (𝐴 ⊆ 𝐵 → (∃𝑥 ∈ 𝐴 𝜑 ↔ ∃𝑥 ∈ 𝐵 (𝑥 ∈ 𝐴 ∧ 𝜑))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | ssel 3964 | . . . . 5 ⊢ (𝐴 ⊆ 𝐵 → (𝑥 ∈ 𝐴 → 𝑥 ∈ 𝐵)) | |
2 | 1 | pm4.71rd 565 | . . . 4 ⊢ (𝐴 ⊆ 𝐵 → (𝑥 ∈ 𝐴 ↔ (𝑥 ∈ 𝐵 ∧ 𝑥 ∈ 𝐴))) |
3 | 2 | anbi1d 631 | . . 3 ⊢ (𝐴 ⊆ 𝐵 → ((𝑥 ∈ 𝐴 ∧ 𝜑) ↔ ((𝑥 ∈ 𝐵 ∧ 𝑥 ∈ 𝐴) ∧ 𝜑))) |
4 | anass 471 | . . 3 ⊢ (((𝑥 ∈ 𝐵 ∧ 𝑥 ∈ 𝐴) ∧ 𝜑) ↔ (𝑥 ∈ 𝐵 ∧ (𝑥 ∈ 𝐴 ∧ 𝜑))) | |
5 | 3, 4 | syl6bb 289 | . 2 ⊢ (𝐴 ⊆ 𝐵 → ((𝑥 ∈ 𝐴 ∧ 𝜑) ↔ (𝑥 ∈ 𝐵 ∧ (𝑥 ∈ 𝐴 ∧ 𝜑)))) |
6 | 5 | rexbidv2 3298 | 1 ⊢ (𝐴 ⊆ 𝐵 → (∃𝑥 ∈ 𝐴 𝜑 ↔ ∃𝑥 ∈ 𝐵 (𝑥 ∈ 𝐴 ∧ 𝜑))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 208 ∧ wa 398 ∈ wcel 2113 ∃wrex 3142 ⊆ wss 3939 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1969 ax-7 2014 ax-8 2115 ax-9 2123 ax-10 2144 ax-11 2160 ax-12 2176 ax-ext 2796 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-tru 1539 df-ex 1780 df-nf 1784 df-sb 2069 df-clab 2803 df-cleq 2817 df-clel 2896 df-rex 3147 df-in 3946 df-ss 3955 |
This theorem is referenced by: oddnn02np1 15700 oddge22np1 15701 evennn02n 15702 evennn2n 15703 2lgslem1a 25970 omssubadd 31562 limsupmnfuzlem 42013 sbgoldbo 43959 |
Copyright terms: Public domain | W3C validator |