| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > freq2 | Structured version Visualization version GIF version | ||
| Description: Equality theorem for the well-founded predicate. (Contributed by NM, 3-Apr-1994.) |
| Ref | Expression |
|---|---|
| freq2 | ⊢ (𝐴 = 𝐵 → (𝑅 Fr 𝐴 ↔ 𝑅 Fr 𝐵)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eqimss2 3997 | . . 3 ⊢ (𝐴 = 𝐵 → 𝐵 ⊆ 𝐴) | |
| 2 | frss 5627 | . . 3 ⊢ (𝐵 ⊆ 𝐴 → (𝑅 Fr 𝐴 → 𝑅 Fr 𝐵)) | |
| 3 | 1, 2 | syl 18 | . 2 ⊢ (𝐴 = 𝐵 → (𝑅 Fr 𝐴 → 𝑅 Fr 𝐵)) |
| 4 | eqimss 3996 | . . 3 ⊢ (𝐴 = 𝐵 → 𝐴 ⊆ 𝐵) | |
| 5 | frss 5627 | . . 3 ⊢ (𝐴 ⊆ 𝐵 → (𝑅 Fr 𝐵 → 𝑅 Fr 𝐴)) | |
| 6 | 4, 5 | syl 18 | . 2 ⊢ (𝐴 = 𝐵 → (𝑅 Fr 𝐵 → 𝑅 Fr 𝐴)) |
| 7 | 3, 6 | impbid 215 | 1 ⊢ (𝐴 = 𝐵 → (𝑅 Fr 𝐴 ↔ 𝑅 Fr 𝐵)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 = wceq 1570 ⊆ wss 3906 Fr wfr 5613 |
| 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-9 2156 ax-ext 2737 |
| This proof depends on definitions: df-bi 210 df-an 402 df-ex 1813 df-cleq 2757 df-ss 3923 df-fr 5616 |
| This theorem is used by: freq12d 5632 weeq2 5651 frsn 5751 f1oweALT 7971 frfi 9248 ifr0 45192 |
| Copyright terms: Public domain | W3C validator |