![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > sbralie | Structured version Visualization version GIF version |
Description: Implicit to explicit substitution that swaps variables in a rectrictedly universally quantified expression. (Contributed by NM, 5-Sep-2004.) |
Ref | Expression |
---|---|
sbralie.1 | ⊢ (𝑥 = 𝑦 → (𝜑 ↔ 𝜓)) |
Ref | Expression |
---|---|
sbralie | ⊢ (∀𝑥 ∈ 𝑦 𝜑 ↔ [𝑦 / 𝑥]∀𝑦 ∈ 𝑥 𝜓) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | cbvralsvw 3299 | . . 3 ⊢ (∀𝑦 ∈ 𝑥 𝜓 ↔ ∀𝑧 ∈ 𝑥 [𝑧 / 𝑦]𝜓) | |
2 | 1 | sbbii 2079 | . 2 ⊢ ([𝑦 / 𝑥]∀𝑦 ∈ 𝑥 𝜓 ↔ [𝑦 / 𝑥]∀𝑧 ∈ 𝑥 [𝑧 / 𝑦]𝜓) |
3 | raleq 3308 | . . 3 ⊢ (𝑥 = 𝑦 → (∀𝑧 ∈ 𝑥 [𝑧 / 𝑦]𝜓 ↔ ∀𝑧 ∈ 𝑦 [𝑧 / 𝑦]𝜓)) | |
4 | 3 | sbievw 2095 | . 2 ⊢ ([𝑦 / 𝑥]∀𝑧 ∈ 𝑥 [𝑧 / 𝑦]𝜓 ↔ ∀𝑧 ∈ 𝑦 [𝑧 / 𝑦]𝜓) |
5 | cbvralsvw 3299 | . . 3 ⊢ (∀𝑧 ∈ 𝑦 [𝑧 / 𝑦]𝜓 ↔ ∀𝑥 ∈ 𝑦 [𝑥 / 𝑧][𝑧 / 𝑦]𝜓) | |
6 | sbco2vv 2100 | . . . . 5 ⊢ ([𝑥 / 𝑧][𝑧 / 𝑦]𝜓 ↔ [𝑥 / 𝑦]𝜓) | |
7 | sbralie.1 | . . . . . . . 8 ⊢ (𝑥 = 𝑦 → (𝜑 ↔ 𝜓)) | |
8 | 7 | bicomd 222 | . . . . . . 7 ⊢ (𝑥 = 𝑦 → (𝜓 ↔ 𝜑)) |
9 | 8 | equcoms 2023 | . . . . . 6 ⊢ (𝑦 = 𝑥 → (𝜓 ↔ 𝜑)) |
10 | 9 | sbievw 2095 | . . . . 5 ⊢ ([𝑥 / 𝑦]𝜓 ↔ 𝜑) |
11 | 6, 10 | bitri 274 | . . . 4 ⊢ ([𝑥 / 𝑧][𝑧 / 𝑦]𝜓 ↔ 𝜑) |
12 | 11 | ralbii 3095 | . . 3 ⊢ (∀𝑥 ∈ 𝑦 [𝑥 / 𝑧][𝑧 / 𝑦]𝜓 ↔ ∀𝑥 ∈ 𝑦 𝜑) |
13 | 5, 12 | bitri 274 | . 2 ⊢ (∀𝑧 ∈ 𝑦 [𝑧 / 𝑦]𝜓 ↔ ∀𝑥 ∈ 𝑦 𝜑) |
14 | 2, 4, 13 | 3bitrri 297 | 1 ⊢ (∀𝑥 ∈ 𝑦 𝜑 ↔ [𝑦 / 𝑥]∀𝑦 ∈ 𝑥 𝜓) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 205 [wsb 2067 ∀wral 3063 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2707 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 846 df-ex 1782 df-nf 1786 df-sb 2068 df-cleq 2728 df-clel 2814 df-nfc 2888 df-ral 3064 |
This theorem is referenced by: tfinds2 7797 |
Copyright terms: Public domain | W3C validator |