![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > ssabral | Structured version Visualization version GIF version |
Description: The relation for a subclass of a class abstraction is equivalent to restricted quantification. (Contributed by NM, 6-Sep-2006.) |
Ref | Expression |
---|---|
ssabral | ⊢ (𝐴 ⊆ {𝑥 ∣ 𝜑} ↔ ∀𝑥 ∈ 𝐴 𝜑) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | ssab 4087 | . 2 ⊢ (𝐴 ⊆ {𝑥 ∣ 𝜑} ↔ ∀𝑥(𝑥 ∈ 𝐴 → 𝜑)) | |
2 | df-ral 3068 | . 2 ⊢ (∀𝑥 ∈ 𝐴 𝜑 ↔ ∀𝑥(𝑥 ∈ 𝐴 → 𝜑)) | |
3 | 1, 2 | bitr4i 278 | 1 ⊢ (𝐴 ⊆ {𝑥 ∣ 𝜑} ↔ ∀𝑥 ∈ 𝐴 𝜑) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 206 ∀wal 1535 ∈ wcel 2108 {cab 2717 ∀wral 3067 ⊆ wss 3976 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1793 ax-4 1807 ax-5 1909 ax-6 1967 ax-7 2007 ax-8 2110 ax-9 2118 ax-10 2141 ax-11 2158 ax-12 2178 ax-ext 2711 |
This theorem depends on definitions: df-bi 207 df-an 396 df-or 847 df-tru 1540 df-ex 1778 df-nf 1782 df-sb 2065 df-clab 2718 df-cleq 2732 df-clel 2819 df-nfc 2895 df-ral 3068 df-ss 3993 |
This theorem is referenced by: comppfsc 23561 txdis1cn 23664 qustgplem 24150 xrhmeo 24996 cncmet 25375 itg1addlem4 25753 itg1addlem4OLD 25754 subfacp1lem6 35153 poimirlem9 37589 istotbnd3 37731 sstotbnd 37735 heibor1lem 37769 heibor1 37770 setis 48790 |
Copyright terms: Public domain | W3C validator |