| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > breq2i | GIF version | ||
| Description: Equality inference for a binary relation. (Contributed by NM, 8-Feb-1996.) |
| Ref | Expression |
|---|---|
| breq1i.1 | ⊢ 𝐴 = 𝐵 |
| Ref | Expression |
|---|---|
| breq2i | ⊢ (𝐶𝑅𝐴 ↔ 𝐶𝑅𝐵) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | breq1i.1 | . 2 ⊢ 𝐴 = 𝐵 | |
| 2 | breq2 4092 | . 2 ⊢ (𝐴 = 𝐵 → (𝐶𝑅𝐴 ↔ 𝐶𝑅𝐵)) | |
| 3 | 1, 2 | ax-mp 5 | 1 ⊢ (𝐶𝑅𝐴 ↔ 𝐶𝑅𝐵) |
| Colors of variables: wff set class |
| Syntax hints: ↔ wb 105 = wceq 1397 class class class wbr 4088 |
| 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 716 ax-5 1495 ax-7 1496 ax-gen 1497 ax-ie1 1541 ax-ie2 1542 ax-8 1552 ax-10 1553 ax-11 1554 ax-i12 1555 ax-bndl 1557 ax-4 1558 ax-17 1574 ax-i9 1578 ax-ial 1582 ax-i5r 1583 ax-ext 2213 |
| This theorem depends on definitions: df-bi 117 df-3an 1006 df-tru 1400 df-nf 1509 df-sb 1811 df-clab 2218 df-cleq 2224 df-clel 2227 df-nfc 2363 df-v 2804 df-un 3204 df-sn 3675 df-pr 3676 df-op 3678 df-br 4089 |
| This theorem is referenced by: breqtri 4113 en1 6972 snnen2og 7044 1nen2 7046 pm54.43 7394 caucvgprprlemval 7907 caucvgprprlemmu 7914 caucvgsr 8021 pitonnlem1 8064 lt0neg2 8648 le0neg2 8650 negap0 8809 recexaplem2 8831 recgt1 9076 crap0 9137 addltmul 9380 nn0lt10b 9559 nn0lt2 9560 3halfnz 9576 xlt0neg2 10073 xle0neg2 10075 iccshftr 10228 iccshftl 10230 iccdil 10232 icccntr 10234 fihashen1 11060 swrdccatin2 11309 pfxccat3 11314 cjap0 11467 abs00ap 11622 xrmaxiflemval 11810 mertenslem2 12096 mertensabs 12097 3dvdsdec 12425 3dvds2dec 12426 ndvdsi 12493 bitsfzo 12515 3prm 12699 prmfac1 12723 prm23lt5 12835 dec2dvds 12983 dec5dvds2 12985 sinhalfpilem 15514 sincosq1lem 15548 sincosq1sgn 15549 sincosq2sgn 15550 sincosq3sgn 15551 sincosq4sgn 15552 logrpap0b 15599 gausslemma2dlem1a 15786 2lgsoddprmlem3 15839 |
| Copyright terms: Public domain | W3C validator |