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

Theorem nssrex 3973
Description: Negation of subclass relationship. (Contributed by Glauco Siliprandi, 3-Mar-2021.)
Assertion
Ref Expression
nssrex (¬ 𝐴 ⊆ 𝐵 ↔ ∃𝑥 ∈ 𝐴 ¬ 𝑥 ∈ 𝐵)
Distinct variable groups:   𝑥,𝐴   𝑥,𝐵

Proof of Theorem nssrex
StepHypRef Expression
1 nss 3972 . 2 (¬ 𝐴 ⊆ 𝐵 ↔ ∃𝑥(𝑥 ∈ 𝐴 ∧ ¬ 𝑥 ∈ 𝐵))
2 df-rex 3087 . 2 (∃𝑥 ∈ 𝐴 ¬ 𝑥 ∈ 𝐵 ↔ ∃𝑥(𝑥 ∈ 𝐴 ∧ ¬ 𝑥 ∈ 𝐵))
31, 2bitr4i 281 1 (¬ 𝐴 ⊆ 𝐵 ↔ ∃𝑥 ∈ 𝐴 ¬ 𝑥 ∈ 𝐵)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3   ↔ wb 209   ∧ wa 401  ∃wex 1811   ∈ wcel 2144  ∃wrex 3086   ⊆ wss 3895
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841
This proof depends on definitions:  df-bi 210  df-an 402  df-ex 1812  df-rex 3087  df-ss 3896
This theorem is used by:  lnssplnglem  29274  dflring3  34075  dflring4  34076  mapssbi  46319
  Copyright terms: Public domain W3C validator