| 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 6585 | . . 3 ⊢ (𝑥 = 𝑦 → (𝑧 Fn 𝑥 ↔ 𝑧 Fn 𝑦)) | |
| 3 | fneq2 6585 | . . 3 ⊢ (𝑦 = 𝑌 → (𝑧 Fn 𝑦 ↔ 𝑧 Fn 𝑌)) | |
| 4 | 2, 3 | sbcie2g 3782 | . 2 ⊢ (𝑌 ∈ V → ([𝑌 / 𝑥]𝑧 Fn 𝑥 ↔ 𝑧 Fn 𝑌)) |
| 5 | 1, 4 | ax-mp 5 | 1 ⊢ ([𝑌 / 𝑥]𝑧 Fn 𝑥 ↔ 𝑧 Fn 𝑌) |
| Colors of variables: wff setvar class |
| Syntax hints: ↔ wb 206 ∈ wcel 2114 Vcvv 3441 [wsbc 3741 Fn wfn 6488 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-ext 2709 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-tru 1545 df-ex 1782 df-sb 2069 df-clab 2716 df-cleq 2729 df-clel 2812 df-sbc 3742 df-fn 6496 |
| This theorem is referenced by: bnj121 35028 bnj130 35032 bnj207 35039 |
| Copyright terms: Public domain | W3C validator |