| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > breqtrid | Structured version Visualization version GIF version | ||
| Description: A chained equality inference for a binary relation. (Contributed by NM, 11-Oct-1999.) |
| Ref | Expression |
|---|---|
| breqtrid.1 | ⊢ 𝐴𝑅𝐵 |
| breqtrid.2 | ⊢ (𝜑 → 𝐵 = 𝐶) |
| Ref | Expression |
|---|---|
| breqtrid | ⊢ (𝜑 → 𝐴𝑅𝐶) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | breqtrid.1 | . . 3 ⊢ 𝐴𝑅𝐵 | |
| 2 | 1 | a1i 11 | . 2 ⊢ (𝜑 → 𝐴𝑅𝐵) |
| 3 | breqtrid.2 | . 2 ⊢ (𝜑 → 𝐵 = 𝐶) | |
| 4 | 2, 3 | breqtrd 5136 | 1 ⊢ (𝜑 → 𝐴𝑅𝐶) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 = wceq 1572 class class class wbr 5107 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1830 ax-4 1844 ax-5 1947 ax-6 2004 ax-7 2045 ax-8 2152 ax-9 2160 ax-ext 2738 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1106 df-tru 1575 df-fal 1585 df-ex 1815 df-sb 2104 df-clab 2745 df-cleq 2758 df-clel 2842 df-rab 3416 df-v 3455 df-ss 3900 df-dif 4049 df-un 4153 df-nul 4281 df-if 4485 df-sn 4588 df-pr 4590 df-op 4840 df-br 5108 |
| This theorem is used by: breqtrrid 5148 xlemul1a 13457 phicl2 16991 sinq12ge0 26896 siilem1 31512 nmbdfnlbi 32710 nmcfnlbi 32713 unierri 32765 leoprf2 32788 leoprf 32789 2sqr3nconstr 34525 cos9thpinconstrlem2 34534 ballotlemic 35251 ballotlem1c 35252 sumnnodd 46975 |
| Copyright terms: Public domain | W3C validator |