Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > abnex | GIF version |
Description: Sufficient condition for a class abstraction to be a proper class. Lemma for snnex 4433 and pwnex 4434. See the comment of abnexg 4431. (Contributed by BJ, 2-May-2021.) |
Ref | Expression |
---|---|
abnex | ⊢ (∀𝑥(𝐹 ∈ 𝑉 ∧ 𝑥 ∈ 𝐹) → ¬ {𝑦 ∣ ∃𝑥 𝑦 = 𝐹} ∈ V) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | vprc 4121 | . 2 ⊢ ¬ V ∈ V | |
2 | alral 2515 | . . 3 ⊢ (∀𝑥(𝐹 ∈ 𝑉 ∧ 𝑥 ∈ 𝐹) → ∀𝑥 ∈ V (𝐹 ∈ 𝑉 ∧ 𝑥 ∈ 𝐹)) | |
3 | rexv 2748 | . . . . . . 7 ⊢ (∃𝑥 ∈ V 𝑦 = 𝐹 ↔ ∃𝑥 𝑦 = 𝐹) | |
4 | 3 | bicomi 131 | . . . . . 6 ⊢ (∃𝑥 𝑦 = 𝐹 ↔ ∃𝑥 ∈ V 𝑦 = 𝐹) |
5 | 4 | abbii 2286 | . . . . 5 ⊢ {𝑦 ∣ ∃𝑥 𝑦 = 𝐹} = {𝑦 ∣ ∃𝑥 ∈ V 𝑦 = 𝐹} |
6 | 5 | eleq1i 2236 | . . . 4 ⊢ ({𝑦 ∣ ∃𝑥 𝑦 = 𝐹} ∈ V ↔ {𝑦 ∣ ∃𝑥 ∈ V 𝑦 = 𝐹} ∈ V) |
7 | 6 | biimpi 119 | . . 3 ⊢ ({𝑦 ∣ ∃𝑥 𝑦 = 𝐹} ∈ V → {𝑦 ∣ ∃𝑥 ∈ V 𝑦 = 𝐹} ∈ V) |
8 | abnexg 4431 | . . 3 ⊢ (∀𝑥 ∈ V (𝐹 ∈ 𝑉 ∧ 𝑥 ∈ 𝐹) → ({𝑦 ∣ ∃𝑥 ∈ V 𝑦 = 𝐹} ∈ V → V ∈ V)) | |
9 | 2, 7, 8 | syl2im 38 | . 2 ⊢ (∀𝑥(𝐹 ∈ 𝑉 ∧ 𝑥 ∈ 𝐹) → ({𝑦 ∣ ∃𝑥 𝑦 = 𝐹} ∈ V → V ∈ V)) |
10 | 1, 9 | mtoi 659 | 1 ⊢ (∀𝑥(𝐹 ∈ 𝑉 ∧ 𝑥 ∈ 𝐹) → ¬ {𝑦 ∣ ∃𝑥 𝑦 = 𝐹} ∈ V) |
Colors of variables: wff set class |
Syntax hints: ¬ wn 3 → wi 4 ∧ wa 103 ∀wal 1346 = wceq 1348 ∃wex 1485 ∈ wcel 2141 {cab 2156 ∀wral 2448 ∃wrex 2449 Vcvv 2730 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 105 ax-ia2 106 ax-ia3 107 ax-in1 609 ax-in2 610 ax-io 704 ax-5 1440 ax-7 1441 ax-gen 1442 ax-ie1 1486 ax-ie2 1487 ax-8 1497 ax-10 1498 ax-11 1499 ax-i12 1500 ax-bndl 1502 ax-4 1503 ax-17 1519 ax-i9 1523 ax-ial 1527 ax-i5r 1528 ax-13 2143 ax-14 2144 ax-ext 2152 ax-sep 4107 ax-un 4418 |
This theorem depends on definitions: df-bi 116 df-tru 1351 df-fal 1354 df-nf 1454 df-sb 1756 df-clab 2157 df-cleq 2163 df-clel 2166 df-nfc 2301 df-ral 2453 df-rex 2454 df-v 2732 df-in 3127 df-ss 3134 df-sn 3589 df-uni 3797 df-iun 3875 |
This theorem is referenced by: pwnex 4434 |
Copyright terms: Public domain | W3C validator |