| Mathbox for Jonathan Ben-Naim |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > bnj90 | Structured version Visualization version GIF version | ||
| Description: First-order logic and set theory. (Contributed by Jonathan Ben-Naim, 3-Jun-2011.) (Proof shortened by Mario Carneiro, 22-Dec-2016.) (New usage is discouraged.) |
| Ref | Expression |
|---|---|
| bnj90.1 | ⊢ 𝑌 ∈ V |
| Ref | Expression |
|---|---|
| bnj90 | ⊢ ([𝑌 / 𝑥]𝑧 Fn 𝑥 ↔ 𝑧 Fn 𝑌) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | bnj90.1 | . 2 ⊢ 𝑌 ∈ V | |
| 2 | fneq2 6627 | . . 3 ⊢ (𝑥 = 𝑦 → (𝑧 Fn 𝑥 ↔ 𝑧 Fn 𝑦)) | |
| 3 | fneq2 6627 | . . 3 ⊢ (𝑦 = 𝑌 → (𝑧 Fn 𝑦 ↔ 𝑧 Fn 𝑌)) | |
| 4 | 2, 3 | sbcie2g 3804 | . 2 ⊢ (𝑌 ∈ V → ([𝑌 / 𝑥]𝑧 Fn 𝑥 ↔ 𝑧 Fn 𝑌)) |
| 5 | 1, 4 | ax-mp 5 | 1 ⊢ ([𝑌 / 𝑥]𝑧 Fn 𝑥 ↔ 𝑧 Fn 𝑌) |
| Colors of variables: wff setvar class |
| Syntax hints: ↔ wb 206 ∈ wcel 2107 Vcvv 3457 [wsbc 3763 Fn wfn 6523 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1794 ax-4 1808 ax-5 1909 ax-6 1966 ax-7 2006 ax-8 2109 ax-9 2117 ax-ext 2706 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-tru 1542 df-ex 1779 df-sb 2064 df-clab 2713 df-cleq 2726 df-clel 2808 df-sbc 3764 df-fn 6531 |
| This theorem is referenced by: bnj121 34830 bnj130 34834 bnj207 34841 |
| Copyright terms: Public domain | W3C validator |