| Mathbox for Jonathan Ben-Naim |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > bnj62 | 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.) |
| Ref | Expression |
|---|---|
| bnj62 | ⊢ ([𝑧 / 𝑥]𝑥 Fn 𝐴 ↔ 𝑧 Fn 𝐴) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | vex 3459 | . . . 4 ⊢ 𝑦 ∈ V | |
| 2 | fneq1 6628 | . . . 4 ⊢ (𝑥 = 𝑦 → (𝑥 Fn 𝐴 ↔ 𝑦 Fn 𝐴)) | |
| 3 | 1, 2 | sbcie 3786 | . . 3 ⊢ ([𝑦 / 𝑥]𝑥 Fn 𝐴 ↔ 𝑦 Fn 𝐴) |
| 4 | 3 | sbcbii 3801 | . 2 ⊢ ([𝑧 / 𝑦][𝑦 / 𝑥]𝑥 Fn 𝐴 ↔ [𝑧 / 𝑦]𝑦 Fn 𝐴) |
| 5 | sbccow 3768 | . 2 ⊢ ([𝑧 / 𝑦][𝑦 / 𝑥]𝑥 Fn 𝐴 ↔ [𝑧 / 𝑥]𝑥 Fn 𝐴) | |
| 6 | vex 3459 | . . 3 ⊢ 𝑧 ∈ V | |
| 7 | fneq1 6628 | . . 3 ⊢ (𝑦 = 𝑧 → (𝑦 Fn 𝐴 ↔ 𝑧 Fn 𝐴)) | |
| 8 | 6, 7 | sbcie 3786 | . 2 ⊢ ([𝑧 / 𝑦]𝑦 Fn 𝐴 ↔ 𝑧 Fn 𝐴) |
| 9 | 4, 5, 8 | 3bitr3i 304 | 1 ⊢ ([𝑧 / 𝑥]𝑥 Fn 𝐴 ↔ 𝑧 Fn 𝐴) |
| Colors of variables: wff setvar class |
| Syntax hints: ↔ wb 209 [wsbc 3745 Fn wfn 6533 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1825 ax-4 1839 ax-5 1940 ax-6 1997 ax-7 2038 ax-8 2145 ax-9 2153 ax-ext 2735 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1810 df-sb 2097 df-clab 2742 df-cleq 2755 df-clel 2838 df-rab 3417 df-v 3457 df-sbc 3746 df-dif 3909 df-un 3911 df-ss 3923 df-nul 4288 df-if 4489 df-sn 4591 df-pr 4593 df-op 4597 df-br 5111 df-opab 5175 df-rel 5670 df-cnv 5671 df-co 5672 df-dm 5673 df-fun 6540 df-fn 6541 |
| This theorem is referenced by: bnj156 35098 bnj976 35147 bnj581 35277 |
| Copyright terms: Public domain | W3C validator |