| 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 7701 and pwnex 7702. See the comment of abnexg 7699. (Contributed by BJ, 2-May-2021.) |
| Ref | Expression |
|---|---|
| abnex | ⊢ (∀𝑥(𝐹 ∈ 𝑉 ∧ 𝑥 ∈ 𝐹) → ¬ {𝑦 ∣ ∃𝑥 𝑦 = 𝐹} ∈ V) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | vprc 5242 | . 2 ⊢ ¬ V ∈ V | |
| 2 | alral 3068 | . . 3 ⊢ (∀𝑥(𝐹 ∈ 𝑉 ∧ 𝑥 ∈ 𝐹) → ∀𝑥 ∈ V (𝐹 ∈ 𝑉 ∧ 𝑥 ∈ 𝐹)) | |
| 3 | rexv 3458 | . . . . . . 7 ⊢ (∃𝑥 ∈ V 𝑦 = 𝐹 ↔ ∃𝑥 𝑦 = 𝐹) | |
| 4 | 3 | bicomi 225 | . . . . . 6 ⊢ (∃𝑥 𝑦 = 𝐹 ↔ ∃𝑥 ∈ V 𝑦 = 𝐹) |
| 5 | 4 | abbii 2806 | . . . . 5 ⊢ {𝑦 ∣ ∃𝑥 𝑦 = 𝐹} = {𝑦 ∣ ∃𝑥 ∈ V 𝑦 = 𝐹} |
| 6 | 5 | eleq1i 2830 | . . . 4 ⊢ ({𝑦 ∣ ∃𝑥 𝑦 = 𝐹} ∈ V ↔ {𝑦 ∣ ∃𝑥 ∈ V 𝑦 = 𝐹} ∈ V) |
| 7 | 6 | biimpi 217 | . . 3 ⊢ ({𝑦 ∣ ∃𝑥 𝑦 = 𝐹} ∈ V → {𝑦 ∣ ∃𝑥 ∈ V 𝑦 = 𝐹} ∈ V) |
| 8 | abnexg 7699 | . . 3 ⊢ (∀𝑥 ∈ V (𝐹 ∈ 𝑉 ∧ 𝑥 ∈ 𝐹) → ({𝑦 ∣ ∃𝑥 ∈ V 𝑦 = 𝐹} ∈ V → V ∈ V)) | |
| 9 | 2, 7, 8 | syl2im 40 | . 2 ⊢ (∀𝑥(𝐹 ∈ 𝑉 ∧ 𝑥 ∈ 𝐹) → ({𝑦 ∣ ∃𝑥 𝑦 = 𝐹} ∈ V → V ∈ V)) |
| 10 | 1, 9 | mtoi 200 | 1 ⊢ (∀𝑥(𝐹 ∈ 𝑉 ∧ 𝑥 ∈ 𝐹) → ¬ {𝑦 ∣ ∃𝑥 𝑦 = 𝐹} ∈ V) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ∧ wa 396 ∀wal 1545 = wceq 1547 ∃wex 1786 ∈ wcel 2119 {cab 2717 ∀wral 3053 ∃wrex 3063 Vcvv 3431 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1802 ax-4 1816 ax-5 1917 ax-6 1974 ax-7 2015 ax-8 2121 ax-9 2129 ax-11 2168 ax-ext 2711 ax-sep 5218 ax-un 7678 |
| This theorem depends on definitions: df-bi 208 df-an 397 df-3an 1094 df-tru 1550 df-ex 1787 df-sb 2074 df-clab 2718 df-cleq 2731 df-clel 2814 df-ral 3054 df-rex 3064 df-rab 3392 df-v 3433 df-in 3890 df-ss 3900 df-sn 4556 df-uni 4839 df-iun 4923 |
| This theorem is referenced by: snnex 7701 pwnex 7702 |
| Copyright terms: Public domain | W3C validator |