| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > ralxfr | Structured version Visualization version GIF version | ||
| Description: Transfer universal quantification from a variable 𝑥 to another variable 𝑦 contained in expression 𝐴. (Contributed by NM, 10-Jun-2005.) (Revised by Mario Carneiro, 15-Aug-2014.) |
| Ref | Expression |
|---|---|
| ralxfr.1 | ⊢ (𝑦 ∈ 𝐶 → 𝐴 ∈ 𝐵) |
| ralxfr.2 | ⊢ (𝑥 ∈ 𝐵 → ∃𝑦 ∈ 𝐶 𝑥 = 𝐴) |
| ralxfr.3 | ⊢ (𝑥 = 𝐴 → (𝜑 ↔ 𝜓)) |
| Ref | Expression |
|---|---|
| ralxfr | ⊢ (∀𝑥 ∈ 𝐵 𝜑 ↔ ∀𝑦 ∈ 𝐶 𝜓) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ralxfr.1 | . . . 4 ⊢ (𝑦 ∈ 𝐶 → 𝐴 ∈ 𝐵) | |
| 2 | 1 | adantl 486 | . . 3 ⊢ ((⊤ ∧ 𝑦 ∈ 𝐶) → 𝐴 ∈ 𝐵) |
| 3 | ralxfr.2 | . . . 4 ⊢ (𝑥 ∈ 𝐵 → ∃𝑦 ∈ 𝐶 𝑥 = 𝐴) | |
| 4 | 3 | adantl 486 | . . 3 ⊢ ((⊤ ∧ 𝑥 ∈ 𝐵) → ∃𝑦 ∈ 𝐶 𝑥 = 𝐴) |
| 5 | ralxfr.3 | . . . 4 ⊢ (𝑥 = 𝐴 → (𝜑 ↔ 𝜓)) | |
| 6 | 5 | adantl 486 | . . 3 ⊢ ((⊤ ∧ 𝑥 = 𝐴) → (𝜑 ↔ 𝜓)) |
| 7 | 2, 4, 6 | ralxfrd 5378 | . 2 ⊢ (⊤ → (∀𝑥 ∈ 𝐵 𝜑 ↔ ∀𝑦 ∈ 𝐶 𝜓)) |
| 8 | 7 | mptru 1576 | 1 ⊢ (∀𝑥 ∈ 𝐵 𝜑 ↔ ∀𝑦 ∈ 𝐶 𝜓) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 = wceq 1569 ⊤wtru 1570 ∈ wcel 2142 ∀wral 3078 ∃wrex 3088 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1824 ax-4 1838 ax-5 1939 ax-6 1996 ax-7 2037 ax-8 2144 ax-9 2152 ax-ext 2734 |
| This proof depends on definitions: df-bi 210 df-an 401 df-tru 1572 df-ex 1809 df-sb 2096 df-clab 2741 df-cleq 2754 df-clel 2837 df-ral 3079 df-rex 3089 |
| This theorem is used by: rexxfr 5386 infm3 12180 |
| Copyright terms: Public domain | W3C validator |