| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > an42s | Structured version Visualization version GIF version | ||
| Description: Inference rearranging 4 conjuncts in antecedent. (Contributed by NM, 10-Aug-1995.) |
| Ref | Expression |
|---|---|
| an41r3s.1 | ⊢ (((𝜑 ∧ 𝜓) ∧ (𝜒 ∧ 𝜃)) → 𝜏) |
| Ref | Expression |
|---|---|
| an42s | ⊢ (((𝜑 ∧ 𝜒) ∧ (𝜃 ∧ 𝜓)) → 𝜏) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | an41r3s.1 | . . 3 ⊢ (((𝜑 ∧ 𝜓) ∧ (𝜒 ∧ 𝜃)) → 𝜏) | |
| 2 | 1 | an4s 672 | . 2 ⊢ (((𝜑 ∧ 𝜒) ∧ (𝜓 ∧ 𝜃)) → 𝜏) |
| 3 | 2 | ancom2s 662 | 1 ⊢ (((𝜑 ∧ 𝜒) ∧ (𝜃 ∧ 𝜓)) → 𝜏) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 400 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 |
| This theorem depends on definitions: df-bi 210 df-an 401 |
| This theorem is referenced by: nnmsucr 8610 ecopoveq 8815 sbthlem9 9082 mulclsr 11068 mulasssr 11074 distrsr 11075 ltsosr 11078 axmulf 11130 axmulass 11141 axdistr 11142 subadd4 11501 mulsub 11656 mgmidmo 18717 tgcl 23094 bwth 23535 pntibndlem2 27720 hosubadd4 32106 pibt2 37950 lindsadd 38151 fdc 38283 isdrngo2 38496 unichnidl 38569 acongtr 43596 |
| Copyright terms: Public domain | W3C validator |