![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > cleq1 | Structured version Visualization version GIF version |
Description: Equality of relations implies equality of closures. (Contributed by RP, 9-May-2020.) |
Ref | Expression |
---|---|
cleq1 | ⊢ (𝑅 = 𝑆 → ∩ {𝑟 ∣ (𝑅 ⊆ 𝑟 ∧ 𝜑)} = ∩ {𝑟 ∣ (𝑆 ⊆ 𝑟 ∧ 𝜑)}) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | cleq1lem 14333 | . . 3 ⊢ (𝑅 = 𝑆 → ((𝑅 ⊆ 𝑟 ∧ 𝜑) ↔ (𝑆 ⊆ 𝑟 ∧ 𝜑))) | |
2 | 1 | abbidv 2862 | . 2 ⊢ (𝑅 = 𝑆 → {𝑟 ∣ (𝑅 ⊆ 𝑟 ∧ 𝜑)} = {𝑟 ∣ (𝑆 ⊆ 𝑟 ∧ 𝜑)}) |
3 | 2 | inteqd 4843 | 1 ⊢ (𝑅 = 𝑆 → ∩ {𝑟 ∣ (𝑅 ⊆ 𝑟 ∧ 𝜑)} = ∩ {𝑟 ∣ (𝑆 ⊆ 𝑟 ∧ 𝜑)}) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 399 = wceq 1538 {cab 2776 ⊆ wss 3881 ∩ cint 4838 |
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 1911 ax-6 1970 ax-7 2015 ax-8 2113 ax-9 2121 ax-ext 2770 |
This theorem depends on definitions: df-bi 210 df-an 400 df-ex 1782 df-sb 2070 df-clab 2777 df-cleq 2791 df-clel 2870 df-ral 3111 df-v 3443 df-in 3888 df-ss 3898 df-int 4839 |
This theorem is referenced by: trcleq1 14340 |
Copyright terms: Public domain | W3C validator |