| 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 697 | . . 3 ⊢ ((𝑥 ∈ 𝐴 → ¬ 𝜑) ↔ ¬ (𝑥 ∈ 𝐴 ∧ 𝜑)) | |
| 2 | 1 | albii 1519 | . 2 ⊢ (∀𝑥(𝑥 ∈ 𝐴 → ¬ 𝜑) ↔ ∀𝑥 ¬ (𝑥 ∈ 𝐴 ∧ 𝜑)) |
| 3 | df-ral 2516 | . 2 ⊢ (∀𝑥 ∈ 𝐴 ¬ 𝜑 ↔ ∀𝑥(𝑥 ∈ 𝐴 → ¬ 𝜑)) | |
| 4 | sbn 2005 | . . . 4 ⊢ ([𝑦 / 𝑥] ¬ (𝑥 ∈ 𝐴 ∧ 𝜑) ↔ ¬ [𝑦 / 𝑥](𝑥 ∈ 𝐴 ∧ 𝜑)) | |
| 5 | 4 | albii 1519 | . . 3 ⊢ (∀𝑦[𝑦 / 𝑥] ¬ (𝑥 ∈ 𝐴 ∧ 𝜑) ↔ ∀𝑦 ¬ [𝑦 / 𝑥](𝑥 ∈ 𝐴 ∧ 𝜑)) |
| 6 | nfv 1577 | . . . 4 ⊢ Ⅎ𝑦 ¬ (𝑥 ∈ 𝐴 ∧ 𝜑) | |
| 7 | 6 | sb8 1904 | . . 3 ⊢ (∀𝑥 ¬ (𝑥 ∈ 𝐴 ∧ 𝜑) ↔ ∀𝑦[𝑦 / 𝑥] ¬ (𝑥 ∈ 𝐴 ∧ 𝜑)) |
| 8 | eq0 3515 | . . . 4 ⊢ ({𝑥 ∈ 𝐴 ∣ 𝜑} = ∅ ↔ ∀𝑦 ¬ 𝑦 ∈ {𝑥 ∈ 𝐴 ∣ 𝜑}) | |
| 9 | df-rab 2520 | . . . . . . . 8 ⊢ {𝑥 ∈ 𝐴 ∣ 𝜑} = {𝑥 ∣ (𝑥 ∈ 𝐴 ∧ 𝜑)} | |
| 10 | 9 | eleq2i 2298 | . . . . . . 7 ⊢ (𝑦 ∈ {𝑥 ∈ 𝐴 ∣ 𝜑} ↔ 𝑦 ∈ {𝑥 ∣ (𝑥 ∈ 𝐴 ∧ 𝜑)}) |
| 11 | df-clab 2218 | . . . . . . 7 ⊢ (𝑦 ∈ {𝑥 ∣ (𝑥 ∈ 𝐴 ∧ 𝜑)} ↔ [𝑦 / 𝑥](𝑥 ∈ 𝐴 ∧ 𝜑)) | |
| 12 | 10, 11 | bitri 184 | . . . . . 6 ⊢ (𝑦 ∈ {𝑥 ∈ 𝐴 ∣ 𝜑} ↔ [𝑦 / 𝑥](𝑥 ∈ 𝐴 ∧ 𝜑)) |
| 13 | 12 | notbii 674 | . . . . 5 ⊢ (¬ 𝑦 ∈ {𝑥 ∈ 𝐴 ∣ 𝜑} ↔ ¬ [𝑦 / 𝑥](𝑥 ∈ 𝐴 ∧ 𝜑)) |
| 14 | 13 | albii 1519 | . . . 4 ⊢ (∀𝑦 ¬ 𝑦 ∈ {𝑥 ∈ 𝐴 ∣ 𝜑} ↔ ∀𝑦 ¬ [𝑦 / 𝑥](𝑥 ∈ 𝐴 ∧ 𝜑)) |
| 15 | 8, 14 | bitri 184 | . . 3 ⊢ ({𝑥 ∈ 𝐴 ∣ 𝜑} = ∅ ↔ ∀𝑦 ¬ [𝑦 / 𝑥](𝑥 ∈ 𝐴 ∧ 𝜑)) |
| 16 | 5, 7, 15 | 3bitr4ri 213 | . 2 ⊢ ({𝑥 ∈ 𝐴 ∣ 𝜑} = ∅ ↔ ∀𝑥 ¬ (𝑥 ∈ 𝐴 ∧ 𝜑)) |
| 17 | 2, 3, 16 | 3bitr4ri 213 | 1 ⊢ ({𝑥 ∈ 𝐴 ∣ 𝜑} = ∅ ↔ ∀𝑥 ∈ 𝐴 ¬ 𝜑) |
| Colors of variables: wff set class |
| Syntax hints: ¬ wn 3 → wi 4 ∧ wa 104 ↔ wb 105 ∀wal 1396 = wceq 1398 [wsb 1810 ∈ wcel 2202 {cab 2217 ∀wral 2511 {crab 2515 ∅c0 3496 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 619 ax-in2 620 ax-io 717 ax-5 1496 ax-7 1497 ax-gen 1498 ax-ie1 1542 ax-ie2 1543 ax-8 1553 ax-10 1554 ax-11 1555 ax-i12 1556 ax-bndl 1558 ax-4 1559 ax-17 1575 ax-i9 1579 ax-ial 1583 ax-i5r 1584 ax-ext 2213 |
| This theorem depends on definitions: df-bi 117 df-tru 1401 df-fal 1404 df-nf 1510 df-sb 1811 df-clab 2218 df-cleq 2224 df-clel 2227 df-nfc 2364 df-ral 2516 df-rab 2520 df-v 2805 df-dif 3203 df-nul 3497 |
| This theorem is referenced by: rabnc 3529 rabrsndc 3743 exmidsssnc 4299 ssfilem 7105 ssfilemd 7107 diffitest 7119 ssfirab 7172 ctssexmid 7392 exmidonfinlem 7447 iooidg 10188 icc0r 10205 fznlem 10321 ioo0 10565 ico0 10567 ioc0 10568 phiprmpw 12857 hashgcdeq 12875 unennn 13081 znnen 13082 fczpsrbag 14750 lgsquadlem2 15880 pw0ss 16007 umgrnloop0 16041 lfgrnloopen 16057 vtxd0nedgbfi 16223 clwwlkn0 16332 eupth2lembfi 16401 |
| Copyright terms: Public domain | W3C validator |