![]() |
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 3941 | . 2 ⊢ (𝐴 = 𝐵 → (𝐶𝑅𝐴 ↔ 𝐶𝑅𝐵)) | |
3 | 1, 2 | ax-mp 5 | 1 ⊢ (𝐶𝑅𝐴 ↔ 𝐶𝑅𝐵) |
Colors of variables: wff set class |
Syntax hints: ↔ wb 104 = wceq 1332 class class class wbr 3937 |
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-io 699 ax-5 1424 ax-7 1425 ax-gen 1426 ax-ie1 1470 ax-ie2 1471 ax-8 1483 ax-10 1484 ax-11 1485 ax-i12 1486 ax-bndl 1487 ax-4 1488 ax-17 1507 ax-i9 1511 ax-ial 1515 ax-i5r 1516 ax-ext 2122 |
This theorem depends on definitions: df-bi 116 df-3an 965 df-tru 1335 df-nf 1438 df-sb 1737 df-clab 2127 df-cleq 2133 df-clel 2136 df-nfc 2271 df-v 2691 df-un 3080 df-sn 3538 df-pr 3539 df-op 3541 df-br 3938 |
This theorem is referenced by: breqtri 3961 en1 6701 snnen2og 6761 1nen2 6763 pm54.43 7063 caucvgprprlemval 7520 caucvgprprlemmu 7527 caucvgsr 7634 pitonnlem1 7677 lt0neg2 8255 le0neg2 8257 negap0 8416 recexaplem2 8437 recgt1 8679 crap0 8740 addltmul 8980 nn0lt10b 9155 nn0lt2 9156 3halfnz 9172 xlt0neg2 9652 xle0neg2 9654 iccshftr 9807 iccshftl 9809 iccdil 9811 icccntr 9813 fihashen1 10577 cjap0 10711 abs00ap 10866 xrmaxiflemval 11051 mertenslem2 11337 mertensabs 11338 3dvdsdec 11598 3dvds2dec 11599 ndvdsi 11666 3prm 11845 prmfac1 11866 sinhalfpilem 12920 sincosq1lem 12954 sincosq1sgn 12955 sincosq2sgn 12956 sincosq3sgn 12957 sincosq4sgn 12958 logrpap0b 13005 |
Copyright terms: Public domain | W3C validator |