| 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 6973 snnen2og 7045 1nen2 7047 pm54.43 7395 caucvgprprlemval 7908 caucvgprprlemmu 7915 caucvgsr 8022 pitonnlem1 8065 lt0neg2 8649 le0neg2 8651 negap0 8810 recexaplem2 8832 recgt1 9077 crap0 9138 addltmul 9381 nn0lt10b 9560 nn0lt2 9561 3halfnz 9577 xlt0neg2 10074 xle0neg2 10076 iccshftr 10229 iccshftl 10231 iccdil 10233 icccntr 10235 fihashen1 11062 swrdccatin2 11311 pfxccat3 11316 cjap0 11469 abs00ap 11624 xrmaxiflemval 11812 mertenslem2 12099 mertensabs 12100 3dvdsdec 12428 3dvds2dec 12429 ndvdsi 12496 bitsfzo 12518 3prm 12702 prmfac1 12726 prm23lt5 12838 dec2dvds 12986 dec5dvds2 12988 sinhalfpilem 15518 sincosq1lem 15552 sincosq1sgn 15553 sincosq2sgn 15554 sincosq3sgn 15555 sincosq4sgn 15556 logrpap0b 15603 gausslemma2dlem1a 15790 2lgsoddprmlem3 15843 |
| Copyright terms: Public domain | W3C validator |