![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > ssintrab | Structured version Visualization version GIF version |
Description: Subclass of the intersection of a restricted class builder. (Contributed by NM, 30-Jan-2015.) |
Ref | Expression |
---|---|
ssintrab | ⊢ (𝐴 ⊆ ∩ {𝑥 ∈ 𝐵 ∣ 𝜑} ↔ ∀𝑥 ∈ 𝐵 (𝜑 → 𝐴 ⊆ 𝑥)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | df-rab 3126 | . . . 4 ⊢ {𝑥 ∈ 𝐵 ∣ 𝜑} = {𝑥 ∣ (𝑥 ∈ 𝐵 ∧ 𝜑)} | |
2 | 1 | inteqi 4703 | . . 3 ⊢ ∩ {𝑥 ∈ 𝐵 ∣ 𝜑} = ∩ {𝑥 ∣ (𝑥 ∈ 𝐵 ∧ 𝜑)} |
3 | 2 | sseq2i 3855 | . 2 ⊢ (𝐴 ⊆ ∩ {𝑥 ∈ 𝐵 ∣ 𝜑} ↔ 𝐴 ⊆ ∩ {𝑥 ∣ (𝑥 ∈ 𝐵 ∧ 𝜑)}) |
4 | impexp 443 | . . . 4 ⊢ (((𝑥 ∈ 𝐵 ∧ 𝜑) → 𝐴 ⊆ 𝑥) ↔ (𝑥 ∈ 𝐵 → (𝜑 → 𝐴 ⊆ 𝑥))) | |
5 | 4 | albii 1918 | . . 3 ⊢ (∀𝑥((𝑥 ∈ 𝐵 ∧ 𝜑) → 𝐴 ⊆ 𝑥) ↔ ∀𝑥(𝑥 ∈ 𝐵 → (𝜑 → 𝐴 ⊆ 𝑥))) |
6 | ssintab 4716 | . . 3 ⊢ (𝐴 ⊆ ∩ {𝑥 ∣ (𝑥 ∈ 𝐵 ∧ 𝜑)} ↔ ∀𝑥((𝑥 ∈ 𝐵 ∧ 𝜑) → 𝐴 ⊆ 𝑥)) | |
7 | df-ral 3122 | . . 3 ⊢ (∀𝑥 ∈ 𝐵 (𝜑 → 𝐴 ⊆ 𝑥) ↔ ∀𝑥(𝑥 ∈ 𝐵 → (𝜑 → 𝐴 ⊆ 𝑥))) | |
8 | 5, 6, 7 | 3bitr4i 295 | . 2 ⊢ (𝐴 ⊆ ∩ {𝑥 ∣ (𝑥 ∈ 𝐵 ∧ 𝜑)} ↔ ∀𝑥 ∈ 𝐵 (𝜑 → 𝐴 ⊆ 𝑥)) |
9 | 3, 8 | bitri 267 | 1 ⊢ (𝐴 ⊆ ∩ {𝑥 ∈ 𝐵 ∣ 𝜑} ↔ ∀𝑥 ∈ 𝐵 (𝜑 → 𝐴 ⊆ 𝑥)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 198 ∧ wa 386 ∀wal 1654 ∈ wcel 2164 {cab 2811 ∀wral 3117 {crab 3121 ⊆ wss 3798 ∩ cint 4699 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1894 ax-4 1908 ax-5 2009 ax-6 2075 ax-7 2112 ax-9 2173 ax-10 2192 ax-11 2207 ax-12 2220 ax-13 2389 ax-ext 2803 |
This theorem depends on definitions: df-bi 199 df-an 387 df-or 879 df-tru 1660 df-ex 1879 df-nf 1883 df-sb 2068 df-clab 2812 df-cleq 2818 df-clel 2821 df-nfc 2958 df-ral 3122 df-rab 3126 df-v 3416 df-in 3805 df-ss 3812 df-int 4700 |
This theorem is referenced by: knatar 6867 harval2 9143 pwfseqlem3 9804 ldgenpisyslem3 30769 topjoin 32893 |
Copyright terms: Public domain | W3C validator |