![]() |
Mathbox for Glauco Siliprandi |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > Mathboxes > cbvrabv2w | Structured version Visualization version GIF version |
Description: A more general version of cbvrabv 3454. Version of cbvrabv2 45019 with a disjoint variable condition, which does not require ax-13 2380. (Contributed by Glauco Siliprandi, 23-Oct-2021.) (Revised by GG, 14-Aug-2025.) |
Ref | Expression |
---|---|
cbvrabv2w.1 | ⊢ (𝑥 = 𝑦 → 𝐴 = 𝐵) |
cbvrabv2w.2 | ⊢ (𝑥 = 𝑦 → (𝜑 ↔ 𝜓)) |
Ref | Expression |
---|---|
cbvrabv2w | ⊢ {𝑥 ∈ 𝐴 ∣ 𝜑} = {𝑦 ∈ 𝐵 ∣ 𝜓} |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | id 22 | . . . . 5 ⊢ (𝑥 = 𝑦 → 𝑥 = 𝑦) | |
2 | cbvrabv2w.1 | . . . . 5 ⊢ (𝑥 = 𝑦 → 𝐴 = 𝐵) | |
3 | 1, 2 | eleq12d 2838 | . . . 4 ⊢ (𝑥 = 𝑦 → (𝑥 ∈ 𝐴 ↔ 𝑦 ∈ 𝐵)) |
4 | cbvrabv2w.2 | . . . 4 ⊢ (𝑥 = 𝑦 → (𝜑 ↔ 𝜓)) | |
5 | 3, 4 | anbi12d 631 | . . 3 ⊢ (𝑥 = 𝑦 → ((𝑥 ∈ 𝐴 ∧ 𝜑) ↔ (𝑦 ∈ 𝐵 ∧ 𝜓))) |
6 | 5 | cbvabv 2815 | . 2 ⊢ {𝑥 ∣ (𝑥 ∈ 𝐴 ∧ 𝜑)} = {𝑦 ∣ (𝑦 ∈ 𝐵 ∧ 𝜓)} |
7 | df-rab 3444 | . 2 ⊢ {𝑥 ∈ 𝐴 ∣ 𝜑} = {𝑥 ∣ (𝑥 ∈ 𝐴 ∧ 𝜑)} | |
8 | df-rab 3444 | . 2 ⊢ {𝑦 ∈ 𝐵 ∣ 𝜓} = {𝑦 ∣ (𝑦 ∈ 𝐵 ∧ 𝜓)} | |
9 | 6, 7, 8 | 3eqtr4i 2778 | 1 ⊢ {𝑥 ∈ 𝐴 ∣ 𝜑} = {𝑦 ∈ 𝐵 ∣ 𝜓} |
Colors of variables: wff setvar class |
Syntax hints: ↔ wb 206 ∧ wa 395 = wceq 1537 ∈ wcel 2108 {cab 2717 {crab 3443 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1793 ax-4 1807 ax-5 1909 ax-6 1967 ax-7 2007 ax-8 2110 ax-9 2118 ax-ext 2711 |
This theorem depends on definitions: df-bi 207 df-an 396 df-ex 1778 df-sb 2065 df-clab 2718 df-cleq 2732 df-clel 2819 df-rab 3444 |
This theorem is referenced by: smfsuplem2 46723 |
Copyright terms: Public domain | W3C validator |