| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > dfss7 | Structured version Visualization version GIF version | ||
| Description: Alternate definition of subclass relationship. (Contributed by AV, 1-Aug-2022.) |
| Ref | Expression |
|---|---|
| dfss7 | ⊢ (𝐵 ⊆ 𝐴 ↔ {𝑥 ∈ 𝐴 ∣ 𝑥 ∈ 𝐵} = 𝐵) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | dfss2 3920 | . 2 ⊢ (𝐵 ⊆ 𝐴 ↔ (𝐵 ∩ 𝐴) = 𝐵) | |
| 2 | dfin5 3910 | . . . 4 ⊢ (𝐴 ∩ 𝐵) = {𝑥 ∈ 𝐴 ∣ 𝑥 ∈ 𝐵} | |
| 3 | 2 | ineqcomi 4161 | . . 3 ⊢ (𝐵 ∩ 𝐴) = {𝑥 ∈ 𝐴 ∣ 𝑥 ∈ 𝐵} |
| 4 | 3 | eqeq1i 2766 | . 2 ⊢ ((𝐵 ∩ 𝐴) = 𝐵 ↔ {𝑥 ∈ 𝐴 ∣ 𝑥 ∈ 𝐵} = 𝐵) |
| 5 | 1, 4 | bitri 277 | 1 ⊢ (𝐵 ⊆ 𝐴 ↔ {𝑥 ∈ 𝐴 ∣ 𝑥 ∈ 𝐵} = 𝐵) |
| Colors of variables: wff setvar class |
| Syntax hints: ↔ wb 208 = wceq 1559 ∈ wcel 2141 {crab 3413 ∩ cin 3901 ⊆ wss 3902 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1814 ax-4 1828 ax-5 1929 ax-6 1986 ax-7 2027 ax-8 2143 ax-9 2151 ax-ext 2733 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-3an 1099 df-tru 1562 df-ex 1799 df-sb 2090 df-clab 2740 df-cleq 2753 df-clel 2836 df-rab 3414 df-in 3909 df-ss 3919 |
| This theorem is referenced by: qusker 33496 nsgqusf1olem3 33562 f1oresf1orab 47844 |
| Copyright terms: Public domain | W3C validator |