Mathbox for BJ |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > Mathboxes > bj-hbs1 | Structured version Visualization version GIF version |
Description: Version of hbsb2 2485 with a disjoint variable condition, which does not require ax-13 2371, and removal of ax-13 2371 from hbs1 2270. (Contributed by BJ, 23-Jun-2019.) (Proof modification is discouraged.) |
Ref | Expression |
---|---|
bj-hbs1 | ⊢ ([𝑦 / 𝑥]𝜑 → ∀𝑥[𝑦 / 𝑥]𝜑) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | sb6 2091 | . 2 ⊢ ([𝑦 / 𝑥]𝜑 ↔ ∀𝑥(𝑥 = 𝑦 → 𝜑)) | |
2 | 1 | biimpri 231 | . . 3 ⊢ (∀𝑥(𝑥 = 𝑦 → 𝜑) → [𝑦 / 𝑥]𝜑) |
3 | 2 | axc4i 2321 | . 2 ⊢ (∀𝑥(𝑥 = 𝑦 → 𝜑) → ∀𝑥[𝑦 / 𝑥]𝜑) |
4 | 1, 3 | sylbi 220 | 1 ⊢ ([𝑦 / 𝑥]𝜑 → ∀𝑥[𝑦 / 𝑥]𝜑) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∀wal 1541 [wsb 2070 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1803 ax-4 1817 ax-5 1918 ax-6 1976 ax-7 2016 ax-10 2141 ax-12 2175 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 848 df-ex 1788 df-nf 1792 df-sb 2071 |
This theorem is referenced by: bj-nfs1v 34732 |
Copyright terms: Public domain | W3C validator |