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

Theorem nsnlpligALT 31130
Description: Alternate version of nsnlplig 31129 using the predicate ∉ instead of ¬ ∈ and whose proof is shorter. (Contributed by AV, 5-Dec-2021.) (Proof modification is discouraged.) (New usage is discouraged.)
Assertion
Ref Expression
nsnlpligALT (𝐺 ∈ Plig → {𝐴} ∉ 𝐺)

Proof of Theorem nsnlpligALT
Dummy variables 𝑎 𝑏 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 eqid 2763 . . . 4 ∪ 𝐺 = ∪ 𝐺
21l2p 31127 . . 3 ((𝐺 ∈ Plig ∧ {𝐴} ∈ 𝐺) → ∃𝑎 ∈ ∪ 𝐺∃𝑏 ∈ ∪ 𝐺(𝑎 ≠ 𝑏 ∧ 𝑎 ∈ {𝐴} ∧ 𝑏 ∈ {𝐴}))
3 elsni 4601 . . . . . . . 8 (𝑎 ∈ {𝐴} → 𝑎 = 𝐴)
4 elsni 4601 . . . . . . . 8 (𝑏 ∈ {𝐴} → 𝑏 = 𝐴)
5 eqtr3 2785 . . . . . . . . 9 ((𝑎 = 𝐴 ∧ 𝑏 = 𝐴) → 𝑎 = 𝑏)
6 eqneqall 2970 . . . . . . . . 9 (𝑎 = 𝑏 → (𝑎 ≠ 𝑏 → {𝐴} ∉ 𝐺))
75, 6syl 18 . . . . . . . 8 ((𝑎 = 𝐴 ∧ 𝑏 = 𝐴) → (𝑎 ≠ 𝑏 → {𝐴} ∉ 𝐺))
83, 4, 7syl2an 608 . . . . . . 7 ((𝑎 ∈ {𝐴} ∧ 𝑏 ∈ {𝐴}) → (𝑎 ≠ 𝑏 → {𝐴} ∉ 𝐺))
98impcom 413 . . . . . 6 ((𝑎 ≠ 𝑏 ∧ (𝑎 ∈ {𝐴} ∧ 𝑏 ∈ {𝐴})) → {𝐴} ∉ 𝐺)
1093impb 1132 . . . . 5 ((𝑎 ≠ 𝑏 ∧ 𝑎 ∈ {𝐴} ∧ 𝑏 ∈ {𝐴}) → {𝐴} ∉ 𝐺)
1110a1i 11 . . . 4 ((𝑎 ∈ ∪ 𝐺 ∧ 𝑏 ∈ ∪ 𝐺) → ((𝑎 ≠ 𝑏 ∧ 𝑎 ∈ {𝐴} ∧ 𝑏 ∈ {𝐴}) → {𝐴} ∉ 𝐺))
1211rexlimivv 3208 . . 3 (∃𝑎 ∈ ∪ 𝐺∃𝑏 ∈ ∪ 𝐺(𝑎 ≠ 𝑏 ∧ 𝑎 ∈ {𝐴} ∧ 𝑏 ∈ {𝐴}) → {𝐴} ∉ 𝐺)
132, 12syl 18 . 2 ((𝐺 ∈ Plig ∧ {𝐴} ∈ 𝐺) → {𝐴} ∉ 𝐺)
14 simpr 490 . 2 ((𝐺 ∈ Plig ∧ {𝐴} ∉ 𝐺) → {𝐴} ∉ 𝐺)
1513, 14pm2.61danel 3079 1 (𝐺 ∈ Plig → {𝐴} ∉ 𝐺)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2147   ≠ wne 2959   ∉ wnel 3065  ∃wrex 3090  {csn 4588  ∪ cuni 4870  Pligcplig 31122
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-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-ne 2960  df-nel 3066  df-ral 3081  df-rex 3091  df-rmo 3369  df-reu 3370  df-v 3456  df-ss 3901  df-sn 4589  df-uni 4871  df-plig 31123
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator