Metamath Proof Explorer


Theorem sylcycbii

Description: An implication cycle yields an equivalence between its first and third formulas. Proof supplied by Owen Orger. AI assistance from OpenAI Codex in preparation and verification. (Contributed by Owen Orger, 11-Nov-2026)

Ref Expression
Hypotheses sylcycbii.1
|- ( ph -> ps )
sylcycbii.2
|- ( ps -> ch )
sylcycbii.3
|- ( ch -> ph )
Assertion sylcycbii
|- ( ph <-> ch )

Proof

Step Hyp Ref Expression
1 sylcycbii.1
 |-  ( ph -> ps )
2 sylcycbii.2
 |-  ( ps -> ch )
3 sylcycbii.3
 |-  ( ch -> ph )
4 1 2 syl
 |-  ( ph -> ch )
5 4 3 impbii
 |-  ( ph <-> ch )