Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > ralss | Structured version Visualization version GIF version |
Description: Restricted universal quantification on a subset in terms of superset. (Contributed by Stefan O'Rear, 3-Apr-2015.) |
Ref | Expression |
---|---|
ralss | ⊢ (𝐴 ⊆ 𝐵 → (∀𝑥 ∈ 𝐴 𝜑 ↔ ∀𝑥 ∈ 𝐵 (𝑥 ∈ 𝐴 → 𝜑))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | ssel 3562 | . . . . 5 ⊢ (𝐴 ⊆ 𝐵 → (𝑥 ∈ 𝐴 → 𝑥 ∈ 𝐵)) | |
2 | 1 | pm4.71rd 665 | . . . 4 ⊢ (𝐴 ⊆ 𝐵 → (𝑥 ∈ 𝐴 ↔ (𝑥 ∈ 𝐵 ∧ 𝑥 ∈ 𝐴))) |
3 | 2 | imbi1d 330 | . . 3 ⊢ (𝐴 ⊆ 𝐵 → ((𝑥 ∈ 𝐴 → 𝜑) ↔ ((𝑥 ∈ 𝐵 ∧ 𝑥 ∈ 𝐴) → 𝜑))) |
4 | impexp 461 | . . 3 ⊢ (((𝑥 ∈ 𝐵 ∧ 𝑥 ∈ 𝐴) → 𝜑) ↔ (𝑥 ∈ 𝐵 → (𝑥 ∈ 𝐴 → 𝜑))) | |
5 | 3, 4 | syl6bb 275 | . 2 ⊢ (𝐴 ⊆ 𝐵 → ((𝑥 ∈ 𝐴 → 𝜑) ↔ (𝑥 ∈ 𝐵 → (𝑥 ∈ 𝐴 → 𝜑)))) |
6 | 5 | ralbidv2 2967 | 1 ⊢ (𝐴 ⊆ 𝐵 → (∀𝑥 ∈ 𝐴 𝜑 ↔ ∀𝑥 ∈ 𝐵 (𝑥 ∈ 𝐴 → 𝜑))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 195 ∧ wa 383 ∈ wcel 1977 ∀wral 2896 ⊆ wss 3540 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1713 ax-4 1728 ax-5 1827 ax-6 1875 ax-7 1922 ax-10 2006 ax-11 2021 ax-12 2034 ax-13 2234 ax-ext 2590 |
This theorem depends on definitions: df-bi 196 df-or 384 df-an 385 df-tru 1478 df-ex 1696 df-nf 1701 df-sb 1868 df-clab 2597 df-cleq 2603 df-clel 2606 df-ral 2901 df-in 3547 df-ss 3554 |
This theorem is referenced by: acsfn 16143 acsfn1 16145 acsfn2 16147 mdetunilem9 20245 acsfn1p 36788 ntrneik3 37414 ntrneix3 37415 ntrneik13 37416 ntrneix13 37417 |
Copyright terms: Public domain | W3C validator |