MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  dfss7 Structured version   Visualization version   GIF version

Theorem dfss7 4151
Description: Alternate definition of subclass relationship. (Contributed by AV, 1-Aug-2022.)
Assertion
Ref Expression
dfss7 (𝐵 ⊆ 𝐴 ↔ {𝑥 ∈ 𝐴 ∣ 𝑥 ∈ 𝐵} = 𝐵)
Distinct variable groups:   𝑥,𝐴   𝑥,𝐵

Proof of Theorem dfss7
StepHypRef Expression
1 dfss2 4097 . 2 (𝐵 ⊆ 𝐴 ↔ (𝐵 ∩ 𝐴) = 𝐵)
2 dfin5 4095 . . . 4 (𝐴 ∩ 𝐵) = {𝑥 ∈ 𝐴 ∣ 𝑥 ∈ 𝐵}
32ineqcomi 4111 . . 3 (𝐵 ∩ 𝐴) = {𝑥 ∈ 𝐴 ∣ 𝑥 ∈ 𝐵}
43eqeq1i 2768 . 2 ((𝐵 ∩ 𝐴) = 𝐵 ↔ {𝑥 ∈ 𝐴 ∣ 𝑥 ∈ 𝐵} = 𝐵)
51, 4bitri 278 1 (𝐵 ⊆ 𝐴 ↔ {𝑥 ∈ 𝐴 ∣ 𝑥 ∈ 𝐵} = 𝐵)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   ↔ wb 209   = wceq 1570   ∈ wcel 2147  {crab 3416   ⊆ wss 3900   ∩ cin 4092
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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-ext 2735
This proof depends on definitions:  df-bi 210  df-an 402  df-3an 1105  df-tru 1573  df-ex 1813  df-sb 2102  df-clab 2742  df-cleq 2755  df-clel 2839  df-rab 3417  df-ss 3901  df-in 4094
This theorem is used by:  qusker  34014  nsgqusf1olem3  34070  f1oresf1orab  48632
  Copyright terms: Public domain W3C validator