| 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 3924 | . 2 ⊢ (𝐵 ⊆ 𝐴 ↔ (𝐵 ∩ 𝐴) = 𝐵) | |
| 2 | dfin5 3914 | . . . 4 ⊢ (𝐴 ∩ 𝐵) = {𝑥 ∈ 𝐴 ∣ 𝑥 ∈ 𝐵} | |
| 3 | 2 | ineqcomi 4164 | . . 3 ⊢ (𝐵 ∩ 𝐴) = {𝑥 ∈ 𝐴 ∣ 𝑥 ∈ 𝐵} |
| 4 | 3 | eqeq1i 2770 | . 2 ⊢ ((𝐵 ∩ 𝐴) = 𝐵 ↔ {𝑥 ∈ 𝐴 ∣ 𝑥 ∈ 𝐵} = 𝐵) |
| 5 | 1, 4 | bitri 278 | 1 ⊢ (𝐵 ⊆ 𝐴 ↔ {𝑥 ∈ 𝐴 ∣ 𝑥 ∈ 𝐵} = 𝐵) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ↔ wb 209 = wceq 1570 ∈ wcel 2146 {crab 3418 ∩ cin 3905 ⊆ wss 3906 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2148 ax-9 2156 ax-ext 2737 |
| This proof depends on definitions: df-bi 210 df-an 402 df-3an 1105 df-tru 1573 df-ex 1813 df-sb 2100 df-clab 2744 df-cleq 2757 df-clel 2840 df-rab 3419 df-in 3913 df-ss 3923 |
| This theorem is used by: qusker 33709 nsgqusf1olem3 33764 f1oresf1orab 48059 |
| Copyright terms: Public domain | W3C validator |