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 ⊢ ( 𝜑 → 𝜓 )
sylcycbii.2 ⊢ ( 𝜓 → 𝜒 )
sylcycbii.3 ⊢ ( 𝜒 → 𝜑 )
Assertion sylcycbii ( 𝜑 ↔ 𝜒 )

Proof

Step Hyp Ref Expression
1 sylcycbii.1 ⊢ ( 𝜑 → 𝜓 )
2 sylcycbii.2 ⊢ ( 𝜓 → 𝜒 )
3 sylcycbii.3 ⊢ ( 𝜒 → 𝜑 )
4 1 2 syl ⊢ ( 𝜑 → 𝜒 )
5 4 3 impbii ⊢ ( 𝜑 ↔ 𝜒 )