| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > nssrex | Structured version Visualization version GIF version | ||
| Description: Negation of subclass relationship. (Contributed by Glauco Siliprandi, 3-Mar-2021.) |
| Ref | Expression |
|---|---|
| nssrex | ⊢ (¬ 𝐴 ⊆ 𝐵 ↔ ∃𝑥 ∈ 𝐴 ¬ 𝑥 ∈ 𝐵) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | nss 4003 | . 2 ⊢ (¬ 𝐴 ⊆ 𝐵 ↔ ∃𝑥(𝑥 ∈ 𝐴 ∧ ¬ 𝑥 ∈ 𝐵)) | |
| 2 | df-rex 3090 | . 2 ⊢ (∃𝑥 ∈ 𝐴 ¬ 𝑥 ∈ 𝐵 ↔ ∃𝑥(𝑥 ∈ 𝐴 ∧ ¬ 𝑥 ∈ 𝐵)) | |
| 3 | 1, 2 | bitr4i 281 | 1 ⊢ (¬ 𝐴 ⊆ 𝐵 ↔ ∃𝑥 ∈ 𝐴 ¬ 𝑥 ∈ 𝐵) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 ↔ wb 209 ∧ wa 400 ∃wex 1802 ∈ wcel 2145 ∃wrex 3089 ⊆ wss 3907 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1818 ax-4 1832 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-ex 1803 df-rex 3090 df-ss 3924 |
| This theorem is referenced by: lnssplnglem 29021 dflring3 33704 dflring4 33705 mapssbi 45787 |
| Copyright terms: Public domain | W3C validator |