Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > sb5f | Structured version Visualization version GIF version |
Description: Equivalence for substitution when 𝑦 is not free in 𝜑. The implication "to the right" is sb1 2477 and does not require the nonfreeness hypothesis. Theorem sb5 2266 replaces the nonfreeness hypothesis with a disjoint variable condition on 𝑥, 𝑦 and requires fewer axioms. Usage of this theorem is discouraged because it depends on ax-13 2370. (Contributed by NM, 5-Aug-1993.) (Revised by Mario Carneiro, 4-Oct-2016.) (New usage is discouraged.) |
Ref | Expression |
---|---|
sb6f.1 | ⊢ Ⅎ𝑦𝜑 |
Ref | Expression |
---|---|
sb5f | ⊢ ([𝑦 / 𝑥]𝜑 ↔ ∃𝑥(𝑥 = 𝑦 ∧ 𝜑)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | sb6f.1 | . . 3 ⊢ Ⅎ𝑦𝜑 | |
2 | 1 | sb6f 2499 | . 2 ⊢ ([𝑦 / 𝑥]𝜑 ↔ ∀𝑥(𝑥 = 𝑦 → 𝜑)) |
3 | 1 | equs45f 2457 | . 2 ⊢ (∃𝑥(𝑥 = 𝑦 ∧ 𝜑) ↔ ∀𝑥(𝑥 = 𝑦 → 𝜑)) |
4 | 2, 3 | bitr4i 278 | 1 ⊢ ([𝑦 / 𝑥]𝜑 ↔ ∃𝑥(𝑥 = 𝑦 ∧ 𝜑)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 205 ∧ wa 397 ∀wal 1537 ∃wex 1779 Ⅎwnf 1783 [wsb 2065 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1911 ax-6 1969 ax-7 2009 ax-10 2135 ax-12 2169 ax-13 2370 |
This theorem depends on definitions: df-bi 206 df-an 398 df-or 846 df-ex 1780 df-nf 1784 df-sb 2066 |
This theorem is referenced by: sb7f 2528 |
Copyright terms: Public domain | W3C validator |