Theorem n0lpligALT 30575

Description: Alternate version of n0lplig 30574 using the predicate ∉ instead of ¬ ∈ and whose proof bypasses nsnlplig 30572. (Contributed by AV, 28-Nov-2021.) (Proof modification is discouraged.) (New usage is discouraged.)

Assertion

Ref	Expression
n0lpligALT	⊢ (𝐺 ∈ Plig → ∅ ∉ 𝐺)

Proof of Theorem n0lpligALT

Dummy variables 𝑎 𝑏 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		eqid 2741	. . . 4 ⊢ ∪ 𝐺 = ∪ 𝐺
2	1	l2p 30570	. . 3 ⊢ ((𝐺 ∈ Plig ∧ ∅ ∈ 𝐺) → ∃𝑎 ∈ ∪ 𝐺∃𝑏 ∈ ∪ 𝐺(𝑎 ≠ 𝑏 ∧ 𝑎 ∈ ∅ ∧ 𝑏 ∈ ∅))
3		noel 4268	. . . . . . 7 ⊢ ¬ 𝑎 ∈ ∅
4	3	pm2.21i 119	. . . . . 6 ⊢ (𝑎 ∈ ∅ → ∅ ∉ 𝐺)
5	4	3ad2ant2 1141	. . . . 5 ⊢ ((𝑎 ≠ 𝑏 ∧ 𝑎 ∈ ∅ ∧ 𝑏 ∈ ∅) → ∅ ∉ 𝐺)
6	5	a1i 11	. . . 4 ⊢ ((𝑎 ∈ ∪ 𝐺 ∧ 𝑏 ∈ ∪ 𝐺) → ((𝑎 ≠ 𝑏 ∧ 𝑎 ∈ ∅ ∧ 𝑏 ∈ ∅) → ∅ ∉ 𝐺))
7	6	rexlimivv 3183	. . 3 ⊢ (∃𝑎 ∈ ∪ 𝐺∃𝑏 ∈ ∪ 𝐺(𝑎 ≠ 𝑏 ∧ 𝑎 ∈ ∅ ∧ 𝑏 ∈ ∅) → ∅ ∉ 𝐺)
8	2, 7	syl 17	. 2 ⊢ ((𝐺 ∈ Plig ∧ ∅ ∈ 𝐺) → ∅ ∉ 𝐺)
9		simpr 486	. 2 ⊢ ((𝐺 ∈ Plig ∧ ∅ ∉ 𝐺) → ∅ ∉ 𝐺)
10	8, 9	pm2.61danel 3054	1 ⊢ (𝐺 ∈ Plig → ∅ ∉ 𝐺)

Syntax hints:   → wi 4   ∧ wa 397   ∧ w3a 1093   ∈ wcel 2121   ≠ wne 2936   ∉ wnel 3040  ∃wrex 3065  ∅c0 4263  ∪ cuni 4840  Pligcplig 30565

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1803  ax-4 1817  ax-5 1918  ax-6 1975  ax-7 2016  ax-8 2123  ax-9 2131  ax-ext 2713

This theorem depends on definitions:  df-bi 209  df-an 398  df-3an 1095  df-tru 1551  df-fal 1561  df-ex 1788  df-sb 2075  df-mo 2545  df-eu 2575  df-clab 2720  df-cleq 2733  df-clel 2816  df-nel 3041  df-ral 3056  df-rex 3066  df-rmo 3346  df-reu 3347  df-v 3435  df-dif 3887  df-ss 3901  df-nul 4264  df-uni 4841  df-plig 30566

This theorem is referenced by: (None)