| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > breq12i | Structured version Visualization version GIF version | ||
| Description: Equality inference for a binary relation. (Contributed by NM, 8-Feb-1996.) (Proof shortened by Eric Schmidt, 4-Apr-2007.) |
| Ref | Expression |
|---|---|
| breq1i.1 | ⊢ 𝐴 = 𝐵 |
| breq12i.2 | ⊢ 𝐶 = 𝐷 |
| Ref | Expression |
|---|---|
| breq12i | ⊢ (𝐴𝑅𝐶 ↔ 𝐵𝑅𝐷) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | breq1i.1 | . 2 ⊢ 𝐴 = 𝐵 | |
| 2 | breq12i.2 | . 2 ⊢ 𝐶 = 𝐷 | |
| 3 | breq12 5112 | . 2 ⊢ ((𝐴 = 𝐵 ∧ 𝐶 = 𝐷) → (𝐴𝑅𝐶 ↔ 𝐵𝑅𝐷)) | |
| 4 | 1, 2, 3 | mp2an 705 | 1 ⊢ (𝐴𝑅𝐶 ↔ 𝐵𝑅𝐷) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ↔ wb 209 = 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: 3brtr3g 5143 3brtr4g 5144 caovord2 7664 domunfican 9350 ltsonq 11092 ltanq 11094 ltmnq 11095 prlem934 11156 prlem936 11170 ltsosr 11217 ltasr 11223 ltneg 11855 leneg 11858 lt2sqi 14371 le2sqi 14372 nn0le2msqi 14451 2sqreuop 27848 2sqreuopnn 27849 2sqreuoplt 27850 2sqreuopltb 27851 2sqreuopnnlt 27852 2sqreuopnnltb 27853 axlowdimlem6 29584 upgrwlkcompim 30282 clwlkcompbp 30428 mdsldmd1i 32992 fldext2chn 34472 constrextdg2lem 34492 divcnvlin 36714 ditgeq123i 37214 cbvditgvw2 37254 relowlpssretop 38557 2ap1caineq 43463 fsumlessf 46922 climlimsupcex 47112 liminfltlimsupex 47124 liminflelimsupcex 47140 sge0xaddlem2 47777 eubrdm 48439 isgrlim2 49414 iscmgmALT 49654 iscsgrpALT 49656 |
| Copyright terms: Public domain | W3C validator |