| 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 3457 | . . . 4 ⊢ 𝑦 ∈ V | |
| 2 | fneq1 6607 | . . . 4 ⊢ (𝑥 = 𝑦 → (𝑥 Fn 𝐴 ↔ 𝑦 Fn 𝐴)) | |
| 3 | 1, 2 | sbcie 3783 | . . 3 ⊢ ([𝑦 / 𝑥]𝑥 Fn 𝐴 ↔ 𝑦 Fn 𝐴) |
| 4 | 3 | sbcbii 3798 | . 2 ⊢ ([𝑧 / 𝑦][𝑦 / 𝑥]𝑥 Fn 𝐴 ↔ [𝑧 / 𝑦]𝑦 Fn 𝐴) |
| 5 | sbccow 3765 | . 2 ⊢ ([𝑧 / 𝑦][𝑦 / 𝑥]𝑥 Fn 𝐴 ↔ [𝑧 / 𝑥]𝑥 Fn 𝐴) | |
| 6 | vex 3457 | . . 3 ⊢ 𝑧 ∈ V | |
| 7 | fneq1 6607 | . . 3 ⊢ (𝑦 = 𝑧 → (𝑦 Fn 𝐴 ↔ 𝑧 Fn 𝐴)) | |
| 8 | 6, 7 | sbcie 3783 | . 2 ⊢ ([𝑧 / 𝑦]𝑦 Fn 𝐴 ↔ 𝑧 Fn 𝐴) |
| 9 | 4, 5, 8 | 3bitr3i 303 | 1 ⊢ ([𝑧 / 𝑥]𝑥 Fn 𝐴 ↔ 𝑧 Fn 𝐴) |
| Colors of variables: wff setvar class |
| Syntax hints: ↔ wb 208 [wsbc 3742 Fn wfn 6511 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1814 ax-4 1828 ax-5 1929 ax-6 1986 ax-7 2027 ax-8 2143 ax-9 2151 ax-ext 2733 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3an 1099 df-tru 1562 df-fal 1572 df-ex 1799 df-sb 2090 df-clab 2740 df-cleq 2753 df-clel 2836 df-rab 3414 df-v 3455 df-sbc 3743 df-dif 3905 df-un 3907 df-ss 3919 df-nul 4284 df-if 4478 df-sn 4580 df-pr 4582 df-op 4586 df-br 5098 df-opab 5160 df-rel 5650 df-cnv 5651 df-co 5652 df-dm 5653 df-fun 6518 df-fn 6519 |
| This theorem is referenced by: bnj156 34985 bnj976 35034 bnj581 35164 |
| Copyright terms: Public domain | W3C validator |