| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > rabeqc | Structured version Visualization version GIF version | ||
| Description: A restricted class abstraction equals the restricting class if its condition follows from the membership of the free setvar variable in the restricting class. (Contributed by AV, 20-Apr-2022.) (Proof shortened by SN, 15-Jan-2025.) |
| Ref | Expression |
|---|---|
| rabeqc.1 | ⊢ (𝑥 ∈ 𝐴 → 𝜑) |
| Ref | Expression |
|---|---|
| rabeqc | ⊢ {𝑥 ∈ 𝐴 ∣ 𝜑} = 𝐴 |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | rabeqc.1 | . . . 4 ⊢ (𝑥 ∈ 𝐴 → 𝜑) | |
| 2 | 1 | adantl 481 | . . 3 ⊢ ((⊤ ∧ 𝑥 ∈ 𝐴) → 𝜑) |
| 3 | 2 | rabeqcda 3432 | . 2 ⊢ (⊤ → {𝑥 ∈ 𝐴 ∣ 𝜑} = 𝐴) |
| 4 | 3 | mptru 1547 | 1 ⊢ {𝑥 ∈ 𝐴 ∣ 𝜑} = 𝐴 |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1540 ⊤wtru 1541 ∈ wcel 2109 {crab 3420 |
| 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-tru 1543 df-ex 1780 df-sb 2066 df-clab 2715 df-cleq 2728 df-clel 2810 df-rab 3421 |
| This theorem is referenced by: bday0s 27797 2clwwlk2 30334 numclwwlk3lem2lem 30369 fply1 33576 elnanelprv 35456 ipolub0 48933 ipoglb0 48935 |
| Copyright terms: Public domain | W3C validator |