| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > freq2 | 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 | frforeq2 4485 | . . 3 ⊢ (𝐴 = 𝐵 → ( FrFor 𝑅𝐴𝑠 ↔ FrFor 𝑅𝐵𝑠)) | |
| 2 | 1 | albidv 1877 | . 2 ⊢ (𝐴 = 𝐵 → (∀𝑠 FrFor 𝑅𝐴𝑠 ↔ ∀𝑠 FrFor 𝑅𝐵𝑠)) |
| 3 | df-frind 4472 | . 2 ⊢ (𝑅 Fr 𝐴 ↔ ∀𝑠 FrFor 𝑅𝐴𝑠) | |
| 4 | df-frind 4472 | . 2 ⊢ (𝑅 Fr 𝐵 ↔ ∀𝑠 FrFor 𝑅𝐵𝑠) | |
| 5 | 2, 3, 4 | 3bitr4g 223 | 1 ⊢ (𝐴 = 𝐵 → (𝑅 Fr 𝐴 ↔ 𝑅 Fr 𝐵)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ↔ wb 105 ∀wal 1400 = wceq 1402 FrFor wfrfor 4467 Fr wfr 4468 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-io 721 ax-5 1500 ax-7 1501 ax-gen 1502 ax-ie1 1546 ax-ie2 1547 ax-8 1557 ax-10 1558 ax-11 1559 ax-i12 1560 ax-bndl 1562 ax-4 1563 ax-17 1579 ax-i9 1583 ax-ial 1587 ax-i5r 1588 ax-ext 2220 |
| This theorem depends on definitions: df-bi 117 df-tru 1405 df-nf 1514 df-sb 1816 df-clab 2225 df-cleq 2231 df-clel 2234 df-nfc 2381 df-ral 2533 df-in 3226 df-ss 3233 df-frfor 4471 df-frind 4472 |
| This theorem is referenced by: weeq2 4497 |
| Copyright terms: Public domain | W3C validator |