Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > n0lpligALT | Structured version Visualization version GIF version |
Description: Alternate version of n0lplig 28266 using the predicate ∉ instead of ¬ ∈ and whose proof bypasses nsnlplig 28264. (Contributed by AV, 28-Nov-2021.) (Proof modification is discouraged.) (New usage is discouraged.) |
Ref | Expression |
---|---|
n0lpligALT | ⊢ (𝐺 ∈ Plig → ∅ ∉ 𝐺) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | eqid 2798 | . . . 4 ⊢ ∪ 𝐺 = ∪ 𝐺 | |
2 | 1 | l2p 28262 | . . 3 ⊢ ((𝐺 ∈ Plig ∧ ∅ ∈ 𝐺) → ∃𝑎 ∈ ∪ 𝐺∃𝑏 ∈ ∪ 𝐺(𝑎 ≠ 𝑏 ∧ 𝑎 ∈ ∅ ∧ 𝑏 ∈ ∅)) |
3 | noel 4247 | . . . . . . 7 ⊢ ¬ 𝑎 ∈ ∅ | |
4 | 3 | pm2.21i 119 | . . . . . 6 ⊢ (𝑎 ∈ ∅ → ∅ ∉ 𝐺) |
5 | 4 | 3ad2ant2 1131 | . . . . 5 ⊢ ((𝑎 ≠ 𝑏 ∧ 𝑎 ∈ ∅ ∧ 𝑏 ∈ ∅) → ∅ ∉ 𝐺) |
6 | 5 | a1i 11 | . . . 4 ⊢ ((𝑎 ∈ ∪ 𝐺 ∧ 𝑏 ∈ ∪ 𝐺) → ((𝑎 ≠ 𝑏 ∧ 𝑎 ∈ ∅ ∧ 𝑏 ∈ ∅) → ∅ ∉ 𝐺)) |
7 | 6 | rexlimivv 3251 | . . 3 ⊢ (∃𝑎 ∈ ∪ 𝐺∃𝑏 ∈ ∪ 𝐺(𝑎 ≠ 𝑏 ∧ 𝑎 ∈ ∅ ∧ 𝑏 ∈ ∅) → ∅ ∉ 𝐺) |
8 | 2, 7 | syl 17 | . 2 ⊢ ((𝐺 ∈ Plig ∧ ∅ ∈ 𝐺) → ∅ ∉ 𝐺) |
9 | simpr 488 | . 2 ⊢ ((𝐺 ∈ Plig ∧ ∅ ∉ 𝐺) → ∅ ∉ 𝐺) | |
10 | 8, 9 | pm2.61danel 3105 | 1 ⊢ (𝐺 ∈ Plig → ∅ ∉ 𝐺) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 399 ∧ w3a 1084 ∈ wcel 2111 ≠ wne 2987 ∉ wnel 3091 ∃wrex 3107 ∅c0 4243 ∪ cuni 4800 Pligcplig 28257 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2113 ax-9 2121 ax-10 2142 ax-11 2158 ax-12 2175 ax-ext 2770 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 845 df-3an 1086 df-tru 1541 df-ex 1782 df-nf 1786 df-sb 2070 df-mo 2598 df-eu 2629 df-clab 2777 df-cleq 2791 df-clel 2870 df-nfc 2938 df-nel 3092 df-ral 3111 df-rex 3112 df-reu 3113 df-v 3443 df-dif 3884 df-in 3888 df-ss 3898 df-nul 4244 df-uni 4801 df-plig 28258 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |