![]() |
Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > ILE Home > Th. List > sylan9req | GIF version |
Description: An equality transitivity deduction. (Contributed by NM, 23-Jun-2007.) |
Ref | Expression |
---|---|
sylan9req.1 | ⊢ (𝜑 → 𝐵 = 𝐴) |
sylan9req.2 | ⊢ (𝜓 → 𝐵 = 𝐶) |
Ref | Expression |
---|---|
sylan9req | ⊢ ((𝜑 ∧ 𝜓) → 𝐴 = 𝐶) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | sylan9req.1 | . . 3 ⊢ (𝜑 → 𝐵 = 𝐴) | |
2 | 1 | eqcomd 2146 | . 2 ⊢ (𝜑 → 𝐴 = 𝐵) |
3 | sylan9req.2 | . 2 ⊢ (𝜓 → 𝐵 = 𝐶) | |
4 | 2, 3 | sylan9eq 2193 | 1 ⊢ ((𝜑 ∧ 𝜓) → 𝐴 = 𝐶) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 103 = wceq 1332 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 105 ax-ia2 106 ax-ia3 107 ax-5 1424 ax-gen 1426 ax-4 1488 ax-17 1507 ax-ext 2122 |
This theorem depends on definitions: df-bi 116 df-cleq 2133 |
This theorem is referenced by: fndmu 5232 fodmrnu 5361 funcoeqres 5406 fvunsng 5622 prarloclem5 7332 addlocprlemeq 7365 zdiv 9163 resqrexlemnm 10822 dvdsmulc 11557 cncongrcoprm 11823 |
Copyright terms: Public domain | W3C validator |