![]() |
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 6651 | . . 3 ⊢ (𝑥 = 𝑦 → (𝑧 Fn 𝑥 ↔ 𝑧 Fn 𝑦)) | |
3 | fneq2 6651 | . . 3 ⊢ (𝑦 = 𝑌 → (𝑧 Fn 𝑦 ↔ 𝑧 Fn 𝑌)) | |
4 | 2, 3 | sbcie2g 3821 | . 2 ⊢ (𝑌 ∈ V → ([𝑌 / 𝑥]𝑧 Fn 𝑥 ↔ 𝑧 Fn 𝑌)) |
5 | 1, 4 | ax-mp 5 | 1 ⊢ ([𝑌 / 𝑥]𝑧 Fn 𝑥 ↔ 𝑧 Fn 𝑌) |
Colors of variables: wff setvar class |
Syntax hints: ↔ wb 205 ∈ wcel 2098 Vcvv 3473 [wsbc 3778 Fn wfn 6548 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1789 ax-4 1803 ax-5 1905 ax-6 1963 ax-7 2003 ax-8 2100 ax-9 2108 ax-ext 2699 |
This theorem depends on definitions: df-bi 206 df-an 395 df-tru 1536 df-ex 1774 df-sb 2060 df-clab 2706 df-cleq 2720 df-clel 2806 df-sbc 3779 df-fn 6556 |
This theorem is referenced by: bnj121 34534 bnj130 34538 bnj207 34545 |
Copyright terms: Public domain | W3C validator |