Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > freq1 | GIF version |
Description: Equality theorem for the well-founded predicate. (Contributed by NM, 9-Mar-1997.) |
Ref | Expression |
---|---|
freq1 | ⊢ (𝑅 = 𝑆 → (𝑅 Fr 𝐴 ↔ 𝑆 Fr 𝐴)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | frforeq1 4260 | . . 3 ⊢ (𝑅 = 𝑆 → ( FrFor 𝑅𝐴𝑠 ↔ FrFor 𝑆𝐴𝑠)) | |
2 | 1 | albidv 1796 | . 2 ⊢ (𝑅 = 𝑆 → (∀𝑠 FrFor 𝑅𝐴𝑠 ↔ ∀𝑠 FrFor 𝑆𝐴𝑠)) |
3 | df-frind 4249 | . 2 ⊢ (𝑅 Fr 𝐴 ↔ ∀𝑠 FrFor 𝑅𝐴𝑠) | |
4 | df-frind 4249 | . 2 ⊢ (𝑆 Fr 𝐴 ↔ ∀𝑠 FrFor 𝑆𝐴𝑠) | |
5 | 2, 3, 4 | 3bitr4g 222 | 1 ⊢ (𝑅 = 𝑆 → (𝑅 Fr 𝐴 ↔ 𝑆 Fr 𝐴)) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ↔ wb 104 ∀wal 1329 = wceq 1331 FrFor wfrfor 4244 Fr wfr 4245 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 105 ax-ia2 106 ax-ia3 107 ax-5 1423 ax-gen 1425 ax-ie1 1469 ax-ie2 1470 ax-4 1487 ax-17 1506 ax-ial 1514 ax-ext 2119 |
This theorem depends on definitions: df-bi 116 df-nf 1437 df-cleq 2130 df-clel 2133 df-ral 2419 df-br 3925 df-frfor 4248 df-frind 4249 |
This theorem is referenced by: weeq1 4273 |
Copyright terms: Public domain | W3C validator |