| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > breq1i | GIF version | ||
| Description: Equality inference for a binary relation. (Contributed by NM, 8-Feb-1996.) |
| Ref | Expression |
|---|---|
| breq1i.1 | ⊢ 𝐴 = 𝐵 |
| Ref | Expression |
|---|---|
| breq1i | ⊢ (𝐴𝑅𝐶 ↔ 𝐵𝑅𝐶) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | breq1i.1 | . 2 ⊢ 𝐴 = 𝐵 | |
| 2 | breq1 4134 | . 2 ⊢ (𝐴 = 𝐵 → (𝐴𝑅𝐶 ↔ 𝐵𝑅𝐶)) | |
| 3 | 1, 2 | ax-mp 5 | 1 ⊢ (𝐴𝑅𝐶 ↔ 𝐵𝑅𝐶) |
| Colors of variables: wff set class |
| This proof depends on syntax axioms: ↔ wb 105 = wceq 1402 class class class wbr 4131 |
| This proof depends on 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 proof depends on definitions: df-bi 117 df-3an 1011 df-tru 1405 df-nf 1514 df-sb 1816 df-clab 2225 df-cleq 2231 df-clel 2234 df-nfc 2381 df-v 2823 df-un 3224 df-sn 3715 df-pr 3716 df-op 3718 df-br 4132 |
| This theorem is used by: eqbrtri 4152 brtpos0 6527 euen1 7093 euen1b 7094 2dom 7097 modom2 7113 infglbti 7371 pr2nelem 7543 pr2cv2 7548 caucvgprprlemnbj 8066 caucvgprprlemmu 8068 caucvgprprlemaddq 8081 caucvgprprlem1 8082 gt0srpr 8121 caucvgsr 8175 mappsrprg 8177 map2psrprg 8178 pitonnlem1 8218 pitoregt0 8222 axprecex 8253 axpre-mulgt0 8260 axcaucvglemres 8272 lt0neg1 8803 le0neg1 8805 reclt1 9234 addltmul 9553 eluz2b1 10017 nn01to3 10033 xlt0neg1 10257 xle0neg1 10259 iccshftr 10413 iccshftl 10415 iccdil 10417 icccntr 10419 bernneq 11119 cbvsum 12151 expcnv 12296 cbvprod 12350 oddge22np1 12673 nn0o1gt2 12697 isprm3 12921 dvdsnprmd 12928 pwbdvdslemn 12969 ballotfilemi1 13303 txmetcnp 15744 sincosq1sgn 16053 sincosq3sgn 16055 sincosq4sgn 16056 logrpap0b 16106 bposlem6 16316 gausslemma2dlem3 16387 konigsberglem5 16938 |
| Copyright terms: Public domain | W3C validator |