| 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 3422 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 6538 | . 2 ⊢ (𝜑 → (℩𝑥(𝑥 ∈ 𝐴 ∧ 𝜓)) = (℩𝑥(𝑥 ∈ 𝐴 ∧ 𝜒))) |
| 4 | df-riota 7397 | . 2 ⊢ (℩𝑥 ∈ 𝐴 𝜓) = (℩𝑥(𝑥 ∈ 𝐴 ∧ 𝜓)) | |
| 5 | df-riota 7397 | . 2 ⊢ (℩𝑥 ∈ 𝐴 𝜒) = (℩𝑥(𝑥 ∈ 𝐴 ∧ 𝜒)) | |
| 6 | 3, 4, 5 | 3eqtr4g 2823 | 1 ⊢ (𝜑 → (℩𝑥 ∈ 𝐴 𝜓) = (℩𝑥 ∈ 𝐴 𝜒)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 = wceq 1570 ∈ wcel 2147 ℩cio 6507 ℩crio 7396 |
| 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 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-ext 2735 |
| This proof depends on definitions: df-bi 210 df-an 402 df-tru 1573 df-ex 1813 df-sb 2102 df-clab 2742 df-cleq 2755 df-clel 2839 df-v 3456 df-ss 3901 df-uni 4871 df-iota 6509 df-riota 7397 |
| This theorem is used by: riotabiia 7417 dfceil2 14003 cidpropd 17910 grpinvpropd 19251 mirval 29154 mirfv 29155 grpoidval 31142 adjval2 32520 riotaeqbidva 33161 xdivval 33552 toslub 33601 tosglb 33603 ringinvval 33862 glbconN 40625 cdlemk33N 42157 cdlemk34 42158 cdlemkid4 42182 |
| Copyright terms: Public domain | W3C validator |