| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > rabss3d | Structured version Visualization version GIF version | ||
| Description: Subclass law for restricted abstraction. (Contributed by Thierry Arnoux, 25-Sep-2017.) |
| Ref | Expression |
|---|---|
| rabss3d.1 | ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐴 ∧ 𝜓)) → 𝑥 ∈ 𝐵) |
| Ref | Expression |
|---|---|
| rabss3d | ⊢ (𝜑 → {𝑥 ∈ 𝐴 ∣ 𝜓} ⊆ {𝑥 ∈ 𝐵 ∣ 𝜓}) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | nfv 1915 | . 2 ⊢ Ⅎ𝑥𝜑 | |
| 2 | nfrab1 3415 | . 2 ⊢ Ⅎ𝑥{𝑥 ∈ 𝐴 ∣ 𝜓} | |
| 3 | nfrab1 3415 | . 2 ⊢ Ⅎ𝑥{𝑥 ∈ 𝐵 ∣ 𝜓} | |
| 4 | rabss3d.1 | . . . . 5 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐴 ∧ 𝜓)) → 𝑥 ∈ 𝐵) | |
| 5 | simprr 772 | . . . . 5 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐴 ∧ 𝜓)) → 𝜓) | |
| 6 | 4, 5 | jca 511 | . . . 4 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐴 ∧ 𝜓)) → (𝑥 ∈ 𝐵 ∧ 𝜓)) |
| 7 | 6 | ex 412 | . . 3 ⊢ (𝜑 → ((𝑥 ∈ 𝐴 ∧ 𝜓) → (𝑥 ∈ 𝐵 ∧ 𝜓))) |
| 8 | rabid 3416 | . . 3 ⊢ (𝑥 ∈ {𝑥 ∈ 𝐴 ∣ 𝜓} ↔ (𝑥 ∈ 𝐴 ∧ 𝜓)) | |
| 9 | rabid 3416 | . . 3 ⊢ (𝑥 ∈ {𝑥 ∈ 𝐵 ∣ 𝜓} ↔ (𝑥 ∈ 𝐵 ∧ 𝜓)) | |
| 10 | 7, 8, 9 | 3imtr4g 296 | . 2 ⊢ (𝜑 → (𝑥 ∈ {𝑥 ∈ 𝐴 ∣ 𝜓} → 𝑥 ∈ {𝑥 ∈ 𝐵 ∣ 𝜓})) |
| 11 | 1, 2, 3, 10 | ssrd 3934 | 1 ⊢ (𝜑 → {𝑥 ∈ 𝐴 ∣ 𝜓} ⊆ {𝑥 ∈ 𝐵 ∣ 𝜓}) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 ∈ wcel 2111 {crab 3395 ⊆ wss 3897 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2113 ax-9 2121 ax-10 2144 ax-11 2160 ax-12 2180 ax-ext 2703 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-tru 1544 df-ex 1781 df-nf 1785 df-sb 2068 df-clab 2710 df-cleq 2723 df-clel 2806 df-nfc 2881 df-rab 3396 df-ss 3914 |
| This theorem is referenced by: chnflenfi 18534 xpinpreima2 33920 reprss 34630 reprinfz1 34635 unitscyglem2 42237 unitscyglem4 42239 unitscyglem5 42240 |
| Copyright terms: Public domain | W3C validator |