| 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 3931 | . 2 ⊢ (𝐵 ⊆ 𝐴 ↔ (𝐵 ∩ 𝐴) = 𝐵) | |
| 2 | dfin5 3921 | . . . 4 ⊢ (𝐴 ∩ 𝐵) = {𝑥 ∈ 𝐴 ∣ 𝑥 ∈ 𝐵} | |
| 3 | 2 | ineqcomi 4172 | . . 3 ⊢ (𝐵 ∩ 𝐴) = {𝑥 ∈ 𝐴 ∣ 𝑥 ∈ 𝐵} |
| 4 | 3 | eqeq1i 2774 | . 2 ⊢ ((𝐵 ∩ 𝐴) = 𝐵 ↔ {𝑥 ∈ 𝐴 ∣ 𝑥 ∈ 𝐵} = 𝐵) |
| 5 | 1, 4 | bitri 278 | 1 ⊢ (𝐵 ⊆ 𝐴 ↔ {𝑥 ∈ 𝐴 ∣ 𝑥 ∈ 𝐵} = 𝐵) |
| Colors of variables: wff setvar class |
| Syntax hints: ↔ wb 209 = wceq 1567 ∈ wcel 2149 {crab 3423 ∩ cin 3912 ⊆ wss 3913 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1822 ax-4 1836 ax-5 1937 ax-6 1994 ax-7 2035 ax-8 2151 ax-9 2159 ax-ext 2741 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-3an 1103 df-tru 1570 df-ex 1807 df-sb 2098 df-clab 2748 df-cleq 2761 df-clel 2844 df-rab 3424 df-in 3920 df-ss 3930 |
| This theorem is referenced by: qusker 33608 nsgqusf1olem3 33664 f1oresf1orab 47908 |
| Copyright terms: Public domain | W3C validator |