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 6448 | . . 3 ⊢ (𝑥 = 𝑦 → (𝑧 Fn 𝑥 ↔ 𝑧 Fn 𝑦)) | |
3 | fneq2 6448 | . . 3 ⊢ (𝑦 = 𝑌 → (𝑧 Fn 𝑦 ↔ 𝑧 Fn 𝑌)) | |
4 | 2, 3 | sbcie2g 3814 | . 2 ⊢ (𝑌 ∈ V → ([𝑌 / 𝑥]𝑧 Fn 𝑥 ↔ 𝑧 Fn 𝑌)) |
5 | 1, 4 | ax-mp 5 | 1 ⊢ ([𝑌 / 𝑥]𝑧 Fn 𝑥 ↔ 𝑧 Fn 𝑌) |
Colors of variables: wff setvar class |
Syntax hints: ↔ wb 208 ∈ wcel 2113 Vcvv 3497 [wsbc 3775 Fn wfn 6353 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1969 ax-7 2014 ax-8 2115 ax-9 2123 ax-ext 2796 |
This theorem depends on definitions: df-bi 209 df-an 399 df-ex 1780 df-sb 2069 df-clab 2803 df-cleq 2817 df-clel 2896 df-sbc 3776 df-fn 6361 |
This theorem is referenced by: bnj121 32146 bnj130 32150 bnj207 32157 |
Copyright terms: Public domain | W3C validator |