| 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 3901 | . 2 ⊢ (𝐵 ⊆ 𝐴 ↔ (𝐵 ∩ 𝐴) = 𝐵) | |
| 2 | dfin5 3891 | . . . 4 ⊢ (𝐴 ∩ 𝐵) = {𝑥 ∈ 𝐴 ∣ 𝑥 ∈ 𝐵} | |
| 3 | 2 | ineqcomi 4140 | . . 3 ⊢ (𝐵 ∩ 𝐴) = {𝑥 ∈ 𝐴 ∣ 𝑥 ∈ 𝐵} |
| 4 | 3 | eqeq1i 2744 | . 2 ⊢ ((𝐵 ∩ 𝐴) = 𝐵 ↔ {𝑥 ∈ 𝐴 ∣ 𝑥 ∈ 𝐵} = 𝐵) |
| 5 | 1, 4 | bitri 276 | 1 ⊢ (𝐵 ⊆ 𝐴 ↔ {𝑥 ∈ 𝐴 ∣ 𝑥 ∈ 𝐵} = 𝐵) |
| Colors of variables: wff setvar class |
| Syntax hints: ↔ wb 207 = wceq 1547 ∈ wcel 2119 {crab 3391 ∩ cin 3882 ⊆ wss 3883 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1802 ax-4 1816 ax-5 1917 ax-6 1974 ax-7 2015 ax-8 2121 ax-9 2129 ax-ext 2711 |
| This theorem depends on definitions: df-bi 208 df-an 397 df-3an 1094 df-tru 1550 df-ex 1787 df-sb 2074 df-clab 2718 df-cleq 2731 df-clel 2814 df-rab 3392 df-in 3890 df-ss 3900 |
| This theorem is referenced by: qusker 33432 nsgqusf1olem3 33498 f1oresf1orab 47752 |
| Copyright terms: Public domain | W3C validator |