Metamath Proof Explorer


Theorem brfvtrcld

Description: If two elements are connected by the transitive closure of a relation, then they are connected via n instances the relation, for some counting number n . (Contributed by RP, 22-Jul-2020)

Ref Expression
Hypothesis brfvtrcld.r ⊢ φ → R ∈ V
Assertion brfvtrcld ⊢ φ → A t+ ⁡ R B ↔ ∃ n ∈ ℕ A R ↑ r n B

Proof

Step Hyp Ref Expression
1 brfvtrcld.r ⊢ φ → R ∈ V
2 dftrcl3 ⊢ t+ = r ∈ V ⟼ ⋃ n ∈ ℕ r ↑ r n
3 nnssnn0 ⊢ ℕ ⊆ ℕ 0
4 3 a1i ⊢ φ → ℕ ⊆ ℕ 0
5 2 1 4 brmptiunrelexpd ⊢ φ → A t+ ⁡ R B ↔ ∃ n ∈ ℕ A R ↑ r n B