| 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 3440 | . . . 4 ⊢ 𝑦 ∈ V | |
| 2 | fneq1 6567 | . . . 4 ⊢ (𝑥 = 𝑦 → (𝑥 Fn 𝐴 ↔ 𝑦 Fn 𝐴)) | |
| 3 | 1, 2 | sbcie 3778 | . . 3 ⊢ ([𝑦 / 𝑥]𝑥 Fn 𝐴 ↔ 𝑦 Fn 𝐴) |
| 4 | 3 | sbcbii 3793 | . 2 ⊢ ([𝑧 / 𝑦][𝑦 / 𝑥]𝑥 Fn 𝐴 ↔ [𝑧 / 𝑦]𝑦 Fn 𝐴) |
| 5 | sbccow 3759 | . 2 ⊢ ([𝑧 / 𝑦][𝑦 / 𝑥]𝑥 Fn 𝐴 ↔ [𝑧 / 𝑥]𝑥 Fn 𝐴) | |
| 6 | vex 3440 | . . 3 ⊢ 𝑧 ∈ V | |
| 7 | fneq1 6567 | . . 3 ⊢ (𝑦 = 𝑧 → (𝑦 Fn 𝐴 ↔ 𝑧 Fn 𝐴)) | |
| 8 | 6, 7 | sbcie 3778 | . 2 ⊢ ([𝑧 / 𝑦]𝑦 Fn 𝐴 ↔ 𝑧 Fn 𝐴) |
| 9 | 4, 5, 8 | 3bitr3i 301 | 1 ⊢ ([𝑧 / 𝑥]𝑥 Fn 𝐴 ↔ 𝑧 Fn 𝐴) |
| Colors of variables: wff setvar class |
| Syntax hints: ↔ wb 206 [wsbc 3736 Fn wfn 6471 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2113 ax-9 2121 ax-ext 2703 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-sb 2068 df-clab 2710 df-cleq 2723 df-clel 2806 df-rab 3396 df-v 3438 df-sbc 3737 df-dif 3900 df-un 3902 df-ss 3914 df-nul 4279 df-if 4471 df-sn 4572 df-pr 4574 df-op 4578 df-br 5087 df-opab 5149 df-rel 5618 df-cnv 5619 df-co 5620 df-dm 5621 df-fun 6478 df-fn 6479 |
| This theorem is referenced by: bnj156 34732 bnj976 34781 bnj581 34912 |
| Copyright terms: Public domain | W3C validator |