| 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 3418 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 590 | . . 3 ⊢ (𝜑 → ((𝑥 ∈ 𝐴 ∧ 𝜓) ↔ (𝑥 ∈ 𝐴 ∧ 𝜒))) |
| 3 | 2 | iotabidv 6511 | . 2 ⊢ (𝜑 → (℩𝑥(𝑥 ∈ 𝐴 ∧ 𝜓)) = (℩𝑥(𝑥 ∈ 𝐴 ∧ 𝜒))) |
| 4 | df-riota 7365 | . 2 ⊢ (℩𝑥 ∈ 𝐴 𝜓) = (℩𝑥(𝑥 ∈ 𝐴 ∧ 𝜓)) | |
| 5 | df-riota 7365 | . 2 ⊢ (℩𝑥 ∈ 𝐴 𝜒) = (℩𝑥(𝑥 ∈ 𝐴 ∧ 𝜒)) | |
| 6 | 3, 4, 5 | 3eqtr4g 2820 | 1 ⊢ (𝜑 → (℩𝑥 ∈ 𝐴 𝜓) = (℩𝑥 ∈ 𝐴 𝜒)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 = wceq 1570 ∈ wcel 2145 ℩cio 6481 ℩crio 7364 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-ext 2732 |
| This proof depends on definitions: df-bi 210 df-an 402 df-tru 1573 df-ex 1813 df-sb 2100 df-clab 2739 df-cleq 2752 df-clel 2835 df-v 3452 df-ss 3915 df-uni 4867 df-iota 6483 df-riota 7365 |
| This theorem is used by: riotabiia 7385 dfceil2 13947 cidpropd 17845 grpinvpropd 19186 mirval 29060 mirfv 29061 grpoidval 31048 adjval2 32426 riotaeqbidva 33025 xdivval 33418 toslub 33467 tosglb 33469 ringinvval 33728 glbconN 40354 cdlemk33N 41886 cdlemk34 41887 cdlemkid4 41911 |
| Copyright terms: Public domain | W3C validator |