Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > 3simpc | GIF version |
Description: Simplification of triple conjunction. (Contributed by NM, 21-Apr-1994.) (Proof shortened by Andrew Salmon, 13-May-2011.) |
Ref | Expression |
---|---|
3simpc | ⊢ ((𝜑 ∧ 𝜓 ∧ 𝜒) → (𝜓 ∧ 𝜒)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | 3anrot 967 | . 2 ⊢ ((𝜑 ∧ 𝜓 ∧ 𝜒) ↔ (𝜓 ∧ 𝜒 ∧ 𝜑)) | |
2 | 3simpa 978 | . 2 ⊢ ((𝜓 ∧ 𝜒 ∧ 𝜑) → (𝜓 ∧ 𝜒)) | |
3 | 1, 2 | sylbi 120 | 1 ⊢ ((𝜑 ∧ 𝜓 ∧ 𝜒) → (𝜓 ∧ 𝜒)) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 103 ∧ w3a 962 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 105 ax-ia2 106 ax-ia3 107 |
This theorem depends on definitions: df-bi 116 df-3an 964 |
This theorem is referenced by: simp3 983 3adant1 999 3adantl1 1137 3adantr1 1140 eupickb 2078 find 4508 fisseneq 6813 eqsupti 6876 divcanap2 8433 diveqap0 8435 divrecap 8441 divcanap3 8451 eliooord 9704 fzrev3 9860 sqdivap 10350 muldvds2 11508 dvdscmul 11509 dvdsmulc 11510 dvdstr 11519 cncfmptc 12740 cnplimclemr 12796 |
Copyright terms: Public domain | W3C validator |