| Mathbox for Jonathan Ben-Naim |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > bnj1476 | Structured version Visualization version GIF version | ||
| Description: First-order logic and set theory. (Contributed by Jonathan Ben-Naim, 3-Jun-2011.) (New usage is discouraged.) |
| Ref | Expression |
|---|---|
| bnj1476.1 | ⊢ 𝐷 = {𝑥 ∈ 𝐴 ∣ ¬ 𝜑} |
| bnj1476.2 | ⊢ (𝜓 → 𝐷 = ∅) |
| Ref | Expression |
|---|---|
| bnj1476 | ⊢ (𝜓 → ∀𝑥 ∈ 𝐴 𝜑) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | bnj1476.2 | . . . 4 ⊢ (𝜓 → 𝐷 = ∅) | |
| 2 | bnj1476.1 | . . . . . 6 ⊢ 𝐷 = {𝑥 ∈ 𝐴 ∣ ¬ 𝜑} | |
| 3 | nfrab1 3434 | . . . . . 6 ⊢ Ⅎ𝑥{𝑥 ∈ 𝐴 ∣ ¬ 𝜑} | |
| 4 | 2, 3 | nfcxfr 2922 | . . . . 5 ⊢ Ⅎ𝑥𝐷 |
| 5 | 4 | eq0f 4297 | . . . 4 ⊢ (𝐷 = ∅ ↔ ∀𝑥 ¬ 𝑥 ∈ 𝐷) |
| 6 | 1, 5 | sylib 221 | . . 3 ⊢ (𝜓 → ∀𝑥 ¬ 𝑥 ∈ 𝐷) |
| 7 | 2 | reqabi 3437 | . . . . 5 ⊢ (𝑥 ∈ 𝐷 ↔ (𝑥 ∈ 𝐴 ∧ ¬ 𝜑)) |
| 8 | 7 | notbii 323 | . . . 4 ⊢ (¬ 𝑥 ∈ 𝐷 ↔ ¬ (𝑥 ∈ 𝐴 ∧ ¬ 𝜑)) |
| 9 | iman 407 | . . . 4 ⊢ ((𝑥 ∈ 𝐴 → 𝜑) ↔ ¬ (𝑥 ∈ 𝐴 ∧ ¬ 𝜑)) | |
| 10 | 8, 9 | sylbb2 241 | . . 3 ⊢ (¬ 𝑥 ∈ 𝐷 → (𝑥 ∈ 𝐴 → 𝜑)) |
| 11 | 6, 10 | sylg 1856 | . 2 ⊢ (𝜓 → ∀𝑥(𝑥 ∈ 𝐴 → 𝜑)) |
| 12 | 11 | ralrid 3086 | 1 ⊢ (𝜓 → ∀𝑥 ∈ 𝐴 𝜑) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 → wi 4 ∧ wa 401 ∀wal 1568 = wceq 1570 ∈ wcel 2145 ∀wral 3078 {crab 3414 ∅c0 4282 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2215 ax-ext 2734 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-clab 2741 df-cleq 2754 df-clel 2837 df-nfc 2911 df-ral 3079 df-rab 3415 df-dif 3905 df-nul 4283 |
| This theorem is used by: bnj1312 35575 |
| Copyright terms: Public domain | W3C validator |