| Mathbox for Jonathan Ben-Naim |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > bnj538 | 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.) (Proof shortened by OpenAI, 30-Mar-2020.) |
| Ref | Expression |
|---|---|
| bnj538.1 | ⊢ 𝐴 ∈ V |
| Ref | Expression |
|---|---|
| bnj538 | ⊢ ([𝐴 / 𝑦]∀𝑥 ∈ 𝐵 𝜑 ↔ ∀𝑥 ∈ 𝐵 [𝐴 / 𝑦]𝜑) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | bnj538.1 | . 2 ⊢ 𝐴 ∈ V | |
| 2 | sbcralg 3826 | . 2 ⊢ (𝐴 ∈ V → ([𝐴 / 𝑦]∀𝑥 ∈ 𝐵 𝜑 ↔ ∀𝑥 ∈ 𝐵 [𝐴 / 𝑦]𝜑)) | |
| 3 | 1, 2 | ax-mp 5 | 1 ⊢ ([𝐴 / 𝑦]∀𝑥 ∈ 𝐵 𝜑 ↔ ∀𝑥 ∈ 𝐵 [𝐴 / 𝑦]𝜑) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ↔ wb 209 ∈ wcel 2142 ∀wral 3078 Vcvv 3454 [wsbc 3743 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1824 ax-4 1838 ax-5 1939 ax-6 1996 ax-7 2037 ax-8 2144 ax-9 2152 ax-10 2175 ax-11 2191 ax-12 2212 ax-ext 2734 |
| This proof depends on definitions: df-bi 210 df-an 401 df-or 861 df-tru 1572 df-ex 1809 df-nf 1813 df-sb 2096 df-clab 2741 df-cleq 2754 df-clel 2837 df-nfc 2911 df-ral 3079 df-v 3456 df-sbc 3744 |
| This theorem is used by: bnj92 35259 bnj539 35288 bnj540 35289 |
| Copyright terms: Public domain | W3C validator |