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 3122 | . . . . . 6 ⊢ Ⅎ𝑥{𝑥 ∈ 𝐴 ∣ ¬ 𝜑} | |
4 | 2, 3 | nfcxfr 2762 | . . . . 5 ⊢ Ⅎ𝑥𝐷 |
5 | 4 | eq0f 3925 | . . . 4 ⊢ (𝐷 = ∅ ↔ ∀𝑥 ¬ 𝑥 ∈ 𝐷) |
6 | 1, 5 | sylib 208 | . . 3 ⊢ (𝜓 → ∀𝑥 ¬ 𝑥 ∈ 𝐷) |
7 | 2 | rabeq2i 3197 | . . . . 5 ⊢ (𝑥 ∈ 𝐷 ↔ (𝑥 ∈ 𝐴 ∧ ¬ 𝜑)) |
8 | 7 | notbii 310 | . . . 4 ⊢ (¬ 𝑥 ∈ 𝐷 ↔ ¬ (𝑥 ∈ 𝐴 ∧ ¬ 𝜑)) |
9 | iman 440 | . . . 4 ⊢ ((𝑥 ∈ 𝐴 → 𝜑) ↔ ¬ (𝑥 ∈ 𝐴 ∧ ¬ 𝜑)) | |
10 | 8, 9 | sylbb2 228 | . . 3 ⊢ (¬ 𝑥 ∈ 𝐷 → (𝑥 ∈ 𝐴 → 𝜑)) |
11 | 6, 10 | sylg 1750 | . 2 ⊢ (𝜓 → ∀𝑥(𝑥 ∈ 𝐴 → 𝜑)) |
12 | 11 | bnj1142 30860 | 1 ⊢ (𝜓 → ∀𝑥 ∈ 𝐴 𝜑) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ∧ wa 384 ∀wal 1481 = wceq 1483 ∈ wcel 1990 ∀wral 2912 {crab 2916 ∅c0 3915 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1722 ax-4 1737 ax-5 1839 ax-6 1888 ax-7 1935 ax-9 1999 ax-10 2019 ax-11 2034 ax-12 2047 ax-13 2246 ax-ext 2602 |
This theorem depends on definitions: df-bi 197 df-or 385 df-an 386 df-tru 1486 df-ex 1705 df-nf 1710 df-sb 1881 df-clab 2609 df-cleq 2615 df-clel 2618 df-nfc 2753 df-ral 2917 df-rab 2921 df-v 3202 df-dif 3577 df-nul 3916 |
This theorem is referenced by: bnj1312 31126 |
Copyright terms: Public domain | W3C validator |