| 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 3420 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 6521 | . 2 ⊢ (𝜑 → (℩𝑥(𝑥 ∈ 𝐴 ∧ 𝜓)) = (℩𝑥(𝑥 ∈ 𝐴 ∧ 𝜒))) |
| 4 | df-riota 7373 | . 2 ⊢ (℩𝑥 ∈ 𝐴 𝜓) = (℩𝑥(𝑥 ∈ 𝐴 ∧ 𝜓)) | |
| 5 | df-riota 7373 | . 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 401 = wceq 1570 ∈ wcel 2145 ℩cio 6491 ℩crio 7372 |
| 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 2734 |
| This proof depends on definitions: df-bi 210 df-an 402 df-tru 1573 df-ex 1813 df-sb 2100 df-clab 2741 df-cleq 2754 df-clel 2837 df-v 3455 df-ss 3919 df-uni 4871 df-iota 6493 df-riota 7373 |
| This theorem is used by: riotabiia 7393 dfceil2 13902 cidpropd 17802 grpinvpropd 19139 mirval 29004 mirfv 29005 grpoidval 30980 adjval2 32358 riotaeqbidva 32957 xdivval 33351 toslub 33400 tosglb 33402 ringinvval 33661 glbconN 40237 cdlemk33N 41769 cdlemk34 41770 cdlemkid4 41794 |
| Copyright terms: Public domain | W3C validator |