![]() |
Mathbox for Jonathan Ben-Naim |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > Mathboxes > bnj1230 | 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 |
---|---|
bnj1230.1 | ⊢ 𝐵 = {𝑥 ∈ 𝐴 ∣ 𝜑} |
Ref | Expression |
---|---|
bnj1230 | ⊢ (𝑦 ∈ 𝐵 → ∀𝑥 𝑦 ∈ 𝐵) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | bnj1230.1 | . . 3 ⊢ 𝐵 = {𝑥 ∈ 𝐴 ∣ 𝜑} | |
2 | nfrab1 3464 | . . 3 ⊢ Ⅎ𝑥{𝑥 ∈ 𝐴 ∣ 𝜑} | |
3 | 1, 2 | nfcxfr 2906 | . 2 ⊢ Ⅎ𝑥𝐵 |
4 | 3 | nfcrii 2903 | 1 ⊢ (𝑦 ∈ 𝐵 → ∀𝑥 𝑦 ∈ 𝐵) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∀wal 1535 = wceq 1537 ∈ wcel 2108 {crab 3443 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1793 ax-4 1807 ax-5 1909 ax-6 1967 ax-7 2007 ax-8 2110 ax-9 2118 ax-10 2141 ax-12 2178 ax-ext 2711 |
This theorem depends on definitions: df-bi 207 df-an 396 df-or 847 df-ex 1778 df-nf 1782 df-sb 2065 df-clab 2718 df-cleq 2732 df-clel 2819 df-nfc 2895 df-rab 3444 |
This theorem is referenced by: bnj1312 35034 |
Copyright terms: Public domain | W3C validator |