![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > abnex | Structured version Visualization version GIF version |
Description: Sufficient condition for a class abstraction to be a proper class. Lemma for snnex 7745 and pwnex 7746. See the comment of abnexg 7743. (Contributed by BJ, 2-May-2021.) |
Ref | Expression |
---|---|
abnex | ⊢ (∀𝑥(𝐹 ∈ 𝑉 ∧ 𝑥 ∈ 𝐹) → ¬ {𝑦 ∣ ∃𝑥 𝑦 = 𝐹} ∈ V) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | vprc 5316 | . 2 ⊢ ¬ V ∈ V | |
2 | alral 3076 | . . 3 ⊢ (∀𝑥(𝐹 ∈ 𝑉 ∧ 𝑥 ∈ 𝐹) → ∀𝑥 ∈ V (𝐹 ∈ 𝑉 ∧ 𝑥 ∈ 𝐹)) | |
3 | rexv 3500 | . . . . . . 7 ⊢ (∃𝑥 ∈ V 𝑦 = 𝐹 ↔ ∃𝑥 𝑦 = 𝐹) | |
4 | 3 | bicomi 223 | . . . . . 6 ⊢ (∃𝑥 𝑦 = 𝐹 ↔ ∃𝑥 ∈ V 𝑦 = 𝐹) |
5 | 4 | abbii 2803 | . . . . 5 ⊢ {𝑦 ∣ ∃𝑥 𝑦 = 𝐹} = {𝑦 ∣ ∃𝑥 ∈ V 𝑦 = 𝐹} |
6 | 5 | eleq1i 2825 | . . . 4 ⊢ ({𝑦 ∣ ∃𝑥 𝑦 = 𝐹} ∈ V ↔ {𝑦 ∣ ∃𝑥 ∈ V 𝑦 = 𝐹} ∈ V) |
7 | 6 | biimpi 215 | . . 3 ⊢ ({𝑦 ∣ ∃𝑥 𝑦 = 𝐹} ∈ V → {𝑦 ∣ ∃𝑥 ∈ V 𝑦 = 𝐹} ∈ V) |
8 | abnexg 7743 | . . 3 ⊢ (∀𝑥 ∈ V (𝐹 ∈ 𝑉 ∧ 𝑥 ∈ 𝐹) → ({𝑦 ∣ ∃𝑥 ∈ V 𝑦 = 𝐹} ∈ V → V ∈ V)) | |
9 | 2, 7, 8 | syl2im 40 | . 2 ⊢ (∀𝑥(𝐹 ∈ 𝑉 ∧ 𝑥 ∈ 𝐹) → ({𝑦 ∣ ∃𝑥 𝑦 = 𝐹} ∈ V → V ∈ V)) |
10 | 1, 9 | mtoi 198 | 1 ⊢ (∀𝑥(𝐹 ∈ 𝑉 ∧ 𝑥 ∈ 𝐹) → ¬ {𝑦 ∣ ∃𝑥 𝑦 = 𝐹} ∈ V) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ∧ wa 397 ∀wal 1540 = wceq 1542 ∃wex 1782 ∈ wcel 2107 {cab 2710 ∀wral 3062 ∃wrex 3071 Vcvv 3475 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2109 ax-9 2117 ax-11 2155 ax-ext 2704 ax-sep 5300 ax-un 7725 |
This theorem depends on definitions: df-bi 206 df-an 398 df-tru 1545 df-ex 1783 df-sb 2069 df-clab 2711 df-cleq 2725 df-clel 2811 df-ral 3063 df-rex 3072 df-rab 3434 df-v 3477 df-in 3956 df-ss 3966 df-sn 4630 df-uni 4910 df-iun 5000 |
This theorem is referenced by: snnex 7745 pwnex 7746 |
Copyright terms: Public domain | W3C validator |