Metamath Proof Explorer


Theorem brgrici

Description: Prove that two graphs are isomorphic by an explicit isomorphism. (Contributed by AV, 28-Apr-2025)

Ref Expression
Assertion brgrici ⊢ F ∈ R GraphIso S → R ≃ 𝑔𝑟 S

Proof

Step Hyp Ref Expression
1 ne0i ⊢ F ∈ R GraphIso S → R GraphIso S ≠ ∅
2 brgric ⊢ R ≃ 𝑔𝑟 S ↔ R GraphIso S ≠ ∅
3 1 2 sylibr ⊢ F ∈ R GraphIso S → R ≃ 𝑔𝑟 S