| 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 7753 and pwnex 7754. See the comment of abnexg 7751. (Contributed by BJ, 2-May-2021.) |
| Ref | Expression |
|---|---|
| abnex | ⊢ (∀𝑥(𝐹 ∈ 𝑉 ∧ 𝑥 ∈ 𝐹) → ¬ {𝑦 ∣ ∃𝑥 𝑦 = 𝐹} ∈ V) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | vprc 5283 | . 2 ⊢ ¬ V ∈ V | |
| 2 | alral 3094 | . . 3 ⊢ (∀𝑥(𝐹 ∈ 𝑉 ∧ 𝑥 ∈ 𝐹) → ∀𝑥 ∈ V (𝐹 ∈ 𝑉 ∧ 𝑥 ∈ 𝐹)) | |
| 3 | rexv 3482 | . . . . . . 7 ⊢ (∃𝑥 ∈ V 𝑦 = 𝐹 ↔ ∃𝑥 𝑦 = 𝐹) | |
| 4 | 3 | bicomi 227 | . . . . . 6 ⊢ (∃𝑥 𝑦 = 𝐹 ↔ ∃𝑥 ∈ V 𝑦 = 𝐹) |
| 5 | 4 | abbii 2830 | . . . . 5 ⊢ {𝑦 ∣ ∃𝑥 𝑦 = 𝐹} = {𝑦 ∣ ∃𝑥 ∈ V 𝑦 = 𝐹} |
| 6 | 5 | eleq1i 2854 | . . . 4 ⊢ ({𝑦 ∣ ∃𝑥 𝑦 = 𝐹} ∈ V ↔ {𝑦 ∣ ∃𝑥 ∈ V 𝑦 = 𝐹} ∈ V) |
| 7 | 6 | biimpi 219 | . . 3 ⊢ ({𝑦 ∣ ∃𝑥 𝑦 = 𝐹} ∈ V → {𝑦 ∣ ∃𝑥 ∈ V 𝑦 = 𝐹} ∈ V) |
| 8 | abnexg 7751 | . . 3 ⊢ (∀𝑥 ∈ V (𝐹 ∈ 𝑉 ∧ 𝑥 ∈ 𝐹) → ({𝑦 ∣ ∃𝑥 ∈ V 𝑦 = 𝐹} ∈ V → V ∈ V)) | |
| 9 | 2, 7, 8 | syl2im 41 | . 2 ⊢ (∀𝑥(𝐹 ∈ 𝑉 ∧ 𝑥 ∈ 𝐹) → ({𝑦 ∣ ∃𝑥 𝑦 = 𝐹} ∈ V → V ∈ V)) |
| 10 | 1, 9 | mtoi 202 | 1 ⊢ (∀𝑥(𝐹 ∈ 𝑉 ∧ 𝑥 ∈ 𝐹) → ¬ {𝑦 ∣ ∃𝑥 𝑦 = 𝐹} ∈ V) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ∧ wa 400 ∀wal 1568 = wceq 1570 ∃wex 1809 ∈ wcel 2143 {cab 2741 ∀wral 3079 ∃wrex 3089 Vcvv 3455 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1825 ax-4 1839 ax-5 1940 ax-6 1997 ax-7 2038 ax-8 2145 ax-9 2153 ax-11 2192 ax-ext 2735 ax-sep 5257 ax-un 7732 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-3an 1105 df-tru 1573 df-ex 1810 df-sb 2097 df-clab 2742 df-cleq 2755 df-clel 2838 df-ral 3080 df-rex 3090 df-rab 3417 df-v 3457 df-in 3912 df-ss 3922 df-sn 4590 df-uni 4873 df-iun 4958 |
| This theorem is referenced by: snnex 7753 pwnex 7754 |
| Copyright terms: Public domain | W3C validator |