Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > rabeqiOLD | Structured version Visualization version GIF version |
Description: Obsolete version of rabeqi 3416 as of 3-Jun-2024. (Contributed by Glauco Siliprandi, 26-Jun-2021.) Avoid ax-10 2137 and ax-11 2154. (Revised by Gino Giotto, 20-Aug-2023.) (Proof modification is discouraged.) (New usage is discouraged.) |
Ref | Expression |
---|---|
rabeqi.1 | ⊢ 𝐴 = 𝐵 |
Ref | Expression |
---|---|
rabeqiOLD | ⊢ {𝑥 ∈ 𝐴 ∣ 𝜑} = {𝑥 ∈ 𝐵 ∣ 𝜑} |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | rabeqi.1 | . 2 ⊢ 𝐴 = 𝐵 | |
2 | 1 | nfth 1804 | . . . 4 ⊢ Ⅎ𝑥 𝐴 = 𝐵 |
3 | eleq2 2827 | . . . . 5 ⊢ (𝐴 = 𝐵 → (𝑥 ∈ 𝐴 ↔ 𝑥 ∈ 𝐵)) | |
4 | 3 | anbi1d 630 | . . . 4 ⊢ (𝐴 = 𝐵 → ((𝑥 ∈ 𝐴 ∧ 𝜑) ↔ (𝑥 ∈ 𝐵 ∧ 𝜑))) |
5 | 2, 4 | abbid 2809 | . . 3 ⊢ (𝐴 = 𝐵 → {𝑥 ∣ (𝑥 ∈ 𝐴 ∧ 𝜑)} = {𝑥 ∣ (𝑥 ∈ 𝐵 ∧ 𝜑)}) |
6 | df-rab 3073 | . . 3 ⊢ {𝑥 ∈ 𝐴 ∣ 𝜑} = {𝑥 ∣ (𝑥 ∈ 𝐴 ∧ 𝜑)} | |
7 | df-rab 3073 | . . 3 ⊢ {𝑥 ∈ 𝐵 ∣ 𝜑} = {𝑥 ∣ (𝑥 ∈ 𝐵 ∧ 𝜑)} | |
8 | 5, 6, 7 | 3eqtr4g 2803 | . 2 ⊢ (𝐴 = 𝐵 → {𝑥 ∈ 𝐴 ∣ 𝜑} = {𝑥 ∈ 𝐵 ∣ 𝜑}) |
9 | 1, 8 | ax-mp 5 | 1 ⊢ {𝑥 ∈ 𝐴 ∣ 𝜑} = {𝑥 ∈ 𝐵 ∣ 𝜑} |
Colors of variables: wff setvar class |
Syntax hints: ∧ wa 396 = wceq 1539 ∈ wcel 2106 {cab 2715 {crab 3068 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-12 2171 ax-ext 2709 |
This theorem depends on definitions: df-bi 206 df-an 397 df-ex 1783 df-nf 1787 df-sb 2068 df-clab 2716 df-cleq 2730 df-clel 2816 df-rab 3073 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |