| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > riotabidva | Structured version Visualization version GIF version | ||
| Description: Equivalent wff's yield equal restricted class abstractions (deduction form). (rabbidva 3421 analog.) (Contributed by NM, 17-Jan-2012.) |
| Ref | Expression |
|---|---|
| riotabidva.1 | ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (𝜓 ↔ 𝜒)) |
| Ref | Expression |
|---|---|
| riotabidva | ⊢ (𝜑 → (℩𝑥 ∈ 𝐴 𝜓) = (℩𝑥 ∈ 𝐴 𝜒)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | riotabidva.1 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (𝜓 ↔ 𝜒)) | |
| 2 | 1 | pm5.32da 589 | . . 3 ⊢ (𝜑 → ((𝑥 ∈ 𝐴 ∧ 𝜓) ↔ (𝑥 ∈ 𝐴 ∧ 𝜒))) |
| 3 | 2 | iotabidv 6520 | . 2 ⊢ (𝜑 → (℩𝑥(𝑥 ∈ 𝐴 ∧ 𝜓)) = (℩𝑥(𝑥 ∈ 𝐴 ∧ 𝜒))) |
| 4 | df-riota 7369 | . 2 ⊢ (℩𝑥 ∈ 𝐴 𝜓) = (℩𝑥(𝑥 ∈ 𝐴 ∧ 𝜓)) | |
| 5 | df-riota 7369 | . 2 ⊢ (℩𝑥 ∈ 𝐴 𝜒) = (℩𝑥(𝑥 ∈ 𝐴 ∧ 𝜒)) | |
| 6 | 3, 4, 5 | 3eqtr4g 2822 | 1 ⊢ (𝜑 → (℩𝑥 ∈ 𝐴 𝜓) = (℩𝑥 ∈ 𝐴 𝜒)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 400 = wceq 1569 ∈ wcel 2142 ℩cio 6490 ℩crio 7368 |
| 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-v 3456 df-ss 3921 df-uni 4872 df-iota 6492 df-riota 7369 |
| This theorem is used by: riotabiia 7389 dfceil2 13879 cidpropd 17772 grpinvpropd 19087 mirval 28943 mirfv 28944 grpoidval 30876 adjval2 32254 riotaeqbidva 32853 xdivval 33249 toslub 33302 tosglb 33304 ringinvval 33563 glbconN 40179 cdlemk33N 41711 cdlemk34 41712 cdlemkid4 41736 |
| Copyright terms: Public domain | W3C validator |