| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > pm2.61da2ne | Structured version Visualization version GIF version | ||
| Description: Deduction eliminating two inequalities in an antecedent. (Contributed by NM, 29-May-2013.) |
| Ref | Expression |
|---|---|
| pm2.61da2ne.1 | ⊢ ((𝜑 ∧ 𝐴 = 𝐵) → 𝜓) |
| pm2.61da2ne.2 | ⊢ ((𝜑 ∧ 𝐶 = 𝐷) → 𝜓) |
| pm2.61da2ne.3 | ⊢ ((𝜑 ∧ (𝐴 ≠ 𝐵 ∧ 𝐶 ≠ 𝐷)) → 𝜓) |
| Ref | Expression |
|---|---|
| pm2.61da2ne | ⊢ (𝜑 → 𝜓) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | pm2.61da2ne.1 | . 2 ⊢ ((𝜑 ∧ 𝐴 = 𝐵) → 𝜓) | |
| 2 | pm2.61da2ne.2 | . . . 4 ⊢ ((𝜑 ∧ 𝐶 = 𝐷) → 𝜓) | |
| 3 | 2 | adantlr 728 | . . 3 ⊢ (((𝜑 ∧ 𝐴 ≠ 𝐵) ∧ 𝐶 = 𝐷) → 𝜓) |
| 4 | pm2.61da2ne.3 | . . . 4 ⊢ ((𝜑 ∧ (𝐴 ≠ 𝐵 ∧ 𝐶 ≠ 𝐷)) → 𝜓) | |
| 5 | 4 | anassrs 473 | . . 3 ⊢ (((𝜑 ∧ 𝐴 ≠ 𝐵) ∧ 𝐶 ≠ 𝐷) → 𝜓) |
| 6 | 3, 5 | pm2.61dane 3046 | . 2 ⊢ ((𝜑 ∧ 𝐴 ≠ 𝐵) → 𝜓) |
| 7 | 1, 6 | pm2.61dane 3046 | 1 ⊢ (𝜑 → 𝜓) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 = wceq 1570 ≠ wne 2959 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 |
| This proof depends on definitions: df-bi 210 df-an 402 df-ne 2960 |
| This theorem is used by: pm2.61da3ne 3048 isabvd 21120 xrsxmet 25184 chordthmlem3 27219 mumul 27565 lgsdirnn0 27728 lgsdinn0 27729 constrrtcc 34478 lfl1dim 40444 lfl1dim2N 40445 pmodlem2 41170 cdlemg29 42028 cdlemg39 42039 cdlemg44b 42055 dia2dimlem9 42395 dihprrn 42749 dvh3dim 42769 lcfl9a 42828 lclkrlem2l 42841 lcfrlem42 42907 mapdh6kN 43069 hdmap1l6k 43143 |
| Copyright terms: Public domain | W3C validator |