Metamath Proof Explorer


Theorem tcfr

Description: A set is well-founded if and only if its transitive closure is well-founded by e. . This characterization of well-founded sets is that in Definition I.9.20 of Kunen2 p. 53. (Contributed by Eric Schmidt, 26-Oct-2025)

Ref Expression
Hypothesis tcfr.1 ⊢ A ∈ V
Assertion tcfr ⊢ A ∈ ⋃ R1 On ↔ E Fr TC ⁡ A

Proof

Step Hyp Ref Expression
1 tcfr.1 ⊢ A ∈ V
2 tcwf ⊢ A ∈ ⋃ R1 On → TC ⁡ A ∈ ⋃ R1 On
3 r1elssi ⊢ TC ⁡ A ∈ ⋃ R1 On → TC ⁡ A ⊆ ⋃ R1 On
4 wffr ⊢ E Fr ⋃ R1 On
5 frss ⊢ TC ⁡ A ⊆ ⋃ R1 On → E Fr ⋃ R1 On → E Fr TC ⁡ A
6 4 5 mpi ⊢ TC ⁡ A ⊆ ⋃ R1 On → E Fr TC ⁡ A
7 2 3 6 3syl ⊢ A ∈ ⋃ R1 On → E Fr TC ⁡ A
8 tcid ⊢ A ∈ V → A ⊆ TC ⁡ A
9 1 8 ax-mp ⊢ A ⊆ TC ⁡ A
10 tctr ⊢ Tr ⁡ TC ⁡ A
11 trfr ⊢ Tr ⁡ TC ⁡ A ∧ E Fr TC ⁡ A → TC ⁡ A ⊆ ⋃ R1 On
12 10 11 mpan ⊢ E Fr TC ⁡ A → TC ⁡ A ⊆ ⋃ R1 On
13 9 12 sstrid ⊢ E Fr TC ⁡ A → A ⊆ ⋃ R1 On
14 1 r1elss ⊢ A ∈ ⋃ R1 On ↔ A ⊆ ⋃ R1 On
15 13 14 sylibr ⊢ E Fr TC ⁡ A → A ∈ ⋃ R1 On
16 7 15 impbii ⊢ A ∈ ⋃ R1 On ↔ E Fr TC ⁡ A