| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > cdeqel | Structured version Visualization version GIF version | ||
| Description: Distribute conditional equality over elementhood. (Contributed by Mario Carneiro, 11-Aug-2016.) |
| Ref | Expression |
|---|---|
| cdeqeq.1 | ⊢ CondEq(𝑥 = 𝑦 → 𝐴 = 𝐵) |
| cdeqeq.2 | ⊢ CondEq(𝑥 = 𝑦 → 𝐶 = 𝐷) |
| Ref | Expression |
|---|---|
| cdeqel | ⊢ CondEq(𝑥 = 𝑦 → (𝐴 ∈ 𝐶 ↔ 𝐵 ∈ 𝐷)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | cdeqeq.1 | . . . 4 ⊢ CondEq(𝑥 = 𝑦 → 𝐴 = 𝐵) | |
| 2 | 1 | cdeqri 3754 | . . 3 ⊢ (𝑥 = 𝑦 → 𝐴 = 𝐵) |
| 3 | cdeqeq.2 | . . . 4 ⊢ CondEq(𝑥 = 𝑦 → 𝐶 = 𝐷) | |
| 4 | 3 | cdeqri 3754 | . . 3 ⊢ (𝑥 = 𝑦 → 𝐶 = 𝐷) |
| 5 | 2, 4 | eleq12d 2829 | . 2 ⊢ (𝑥 = 𝑦 → (𝐴 ∈ 𝐶 ↔ 𝐵 ∈ 𝐷)) |
| 6 | 5 | cdeqi 3753 | 1 ⊢ CondEq(𝑥 = 𝑦 → (𝐴 ∈ 𝐶 ↔ 𝐵 ∈ 𝐷)) |
| Colors of variables: wff setvar class |
| Syntax hints: ↔ wb 206 = wceq 1540 ∈ wcel 2109 CondEqwcdeq 3751 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-ext 2708 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-ex 1780 df-cleq 2728 df-clel 2810 df-cdeq 3752 |
| This theorem is referenced by: nfccdeq 3766 |
| Copyright terms: Public domain | W3C validator |