Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > rabeq0 | GIF version |
Description: Condition for a restricted class abstraction to be empty. (Contributed by Jeff Madsen, 7-Jun-2010.) |
Ref | Expression |
---|---|
rabeq0 | ⊢ ({𝑥 ∈ 𝐴 ∣ 𝜑} = ∅ ↔ ∀𝑥 ∈ 𝐴 ¬ 𝜑) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | imnan 679 | . . 3 ⊢ ((𝑥 ∈ 𝐴 → ¬ 𝜑) ↔ ¬ (𝑥 ∈ 𝐴 ∧ 𝜑)) | |
2 | 1 | albii 1446 | . 2 ⊢ (∀𝑥(𝑥 ∈ 𝐴 → ¬ 𝜑) ↔ ∀𝑥 ¬ (𝑥 ∈ 𝐴 ∧ 𝜑)) |
3 | df-ral 2419 | . 2 ⊢ (∀𝑥 ∈ 𝐴 ¬ 𝜑 ↔ ∀𝑥(𝑥 ∈ 𝐴 → ¬ 𝜑)) | |
4 | sbn 1923 | . . . 4 ⊢ ([𝑦 / 𝑥] ¬ (𝑥 ∈ 𝐴 ∧ 𝜑) ↔ ¬ [𝑦 / 𝑥](𝑥 ∈ 𝐴 ∧ 𝜑)) | |
5 | 4 | albii 1446 | . . 3 ⊢ (∀𝑦[𝑦 / 𝑥] ¬ (𝑥 ∈ 𝐴 ∧ 𝜑) ↔ ∀𝑦 ¬ [𝑦 / 𝑥](𝑥 ∈ 𝐴 ∧ 𝜑)) |
6 | nfv 1508 | . . . 4 ⊢ Ⅎ𝑦 ¬ (𝑥 ∈ 𝐴 ∧ 𝜑) | |
7 | 6 | sb8 1828 | . . 3 ⊢ (∀𝑥 ¬ (𝑥 ∈ 𝐴 ∧ 𝜑) ↔ ∀𝑦[𝑦 / 𝑥] ¬ (𝑥 ∈ 𝐴 ∧ 𝜑)) |
8 | eq0 3376 | . . . 4 ⊢ ({𝑥 ∈ 𝐴 ∣ 𝜑} = ∅ ↔ ∀𝑦 ¬ 𝑦 ∈ {𝑥 ∈ 𝐴 ∣ 𝜑}) | |
9 | df-rab 2423 | . . . . . . . 8 ⊢ {𝑥 ∈ 𝐴 ∣ 𝜑} = {𝑥 ∣ (𝑥 ∈ 𝐴 ∧ 𝜑)} | |
10 | 9 | eleq2i 2204 | . . . . . . 7 ⊢ (𝑦 ∈ {𝑥 ∈ 𝐴 ∣ 𝜑} ↔ 𝑦 ∈ {𝑥 ∣ (𝑥 ∈ 𝐴 ∧ 𝜑)}) |
11 | df-clab 2124 | . . . . . . 7 ⊢ (𝑦 ∈ {𝑥 ∣ (𝑥 ∈ 𝐴 ∧ 𝜑)} ↔ [𝑦 / 𝑥](𝑥 ∈ 𝐴 ∧ 𝜑)) | |
12 | 10, 11 | bitri 183 | . . . . . 6 ⊢ (𝑦 ∈ {𝑥 ∈ 𝐴 ∣ 𝜑} ↔ [𝑦 / 𝑥](𝑥 ∈ 𝐴 ∧ 𝜑)) |
13 | 12 | notbii 657 | . . . . 5 ⊢ (¬ 𝑦 ∈ {𝑥 ∈ 𝐴 ∣ 𝜑} ↔ ¬ [𝑦 / 𝑥](𝑥 ∈ 𝐴 ∧ 𝜑)) |
14 | 13 | albii 1446 | . . . 4 ⊢ (∀𝑦 ¬ 𝑦 ∈ {𝑥 ∈ 𝐴 ∣ 𝜑} ↔ ∀𝑦 ¬ [𝑦 / 𝑥](𝑥 ∈ 𝐴 ∧ 𝜑)) |
15 | 8, 14 | bitri 183 | . . 3 ⊢ ({𝑥 ∈ 𝐴 ∣ 𝜑} = ∅ ↔ ∀𝑦 ¬ [𝑦 / 𝑥](𝑥 ∈ 𝐴 ∧ 𝜑)) |
16 | 5, 7, 15 | 3bitr4ri 212 | . 2 ⊢ ({𝑥 ∈ 𝐴 ∣ 𝜑} = ∅ ↔ ∀𝑥 ¬ (𝑥 ∈ 𝐴 ∧ 𝜑)) |
17 | 2, 3, 16 | 3bitr4ri 212 | 1 ⊢ ({𝑥 ∈ 𝐴 ∣ 𝜑} = ∅ ↔ ∀𝑥 ∈ 𝐴 ¬ 𝜑) |
Colors of variables: wff set class |
Syntax hints: ¬ wn 3 → wi 4 ∧ wa 103 ↔ wb 104 ∀wal 1329 = wceq 1331 ∈ wcel 1480 [wsb 1735 {cab 2123 ∀wral 2414 {crab 2418 ∅c0 3358 |
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 603 ax-in2 604 ax-io 698 ax-5 1423 ax-7 1424 ax-gen 1425 ax-ie1 1469 ax-ie2 1470 ax-8 1482 ax-10 1483 ax-11 1484 ax-i12 1485 ax-bndl 1486 ax-4 1487 ax-17 1506 ax-i9 1510 ax-ial 1514 ax-i5r 1515 ax-ext 2119 |
This theorem depends on definitions: df-bi 116 df-tru 1334 df-fal 1337 df-nf 1437 df-sb 1736 df-clab 2124 df-cleq 2130 df-clel 2133 df-nfc 2268 df-ral 2419 df-rab 2423 df-v 2683 df-dif 3068 df-nul 3359 |
This theorem is referenced by: rabnc 3390 rabrsndc 3586 exmidsssnc 4121 ssfilem 6762 diffitest 6774 ssfirab 6815 ctssexmid 7017 exmidonfinlem 7042 iooidg 9685 icc0r 9702 fznlem 9814 ioo0 10030 ico0 10032 ioc0 10033 phiprmpw 11887 hashgcdeq 11893 unennn 11899 znnen 11900 |
Copyright terms: Public domain | W3C validator |