Theorem tcfr 46217

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

Hypothesis

Ref	Expression
tcfr.1	⊢ 𝐴 ∈ V

Assertion

Ref	Expression
tcfr	⊢ (𝐴 ∈ ∪ (𝑅1 “ On) ↔ E Fr (TC‘𝐴))

Proof of Theorem tcfr

Step	Hyp	Ref	Expression
1		tcwf 9937	. . 3 ⊢ (𝐴 ∈ ∪ (𝑅1 “ On) → (TC‘𝐴) ∈ ∪ (𝑅1 “ On))
2		r1elssi 9850	. . 3 ⊢ ((TC‘𝐴) ∈ ∪ (𝑅1 “ On) → (TC‘𝐴) ⊆ ∪ (𝑅1 “ On))
3		wffr 46215	. . . 4 ⊢ E Fr ∪ (𝑅1 “ On)
4		frss 5622	. . . 4 ⊢ ((TC‘𝐴) ⊆ ∪ (𝑅1 “ On) → ( E Fr ∪ (𝑅1 “ On) → E Fr (TC‘𝐴)))
5	3, 4	mpi 21	. . 3 ⊢ ((TC‘𝐴) ⊆ ∪ (𝑅1 “ On) → E Fr (TC‘𝐴))
6	1, 2, 5	3syl 19	. 2 ⊢ (𝐴 ∈ ∪ (𝑅1 “ On) → E Fr (TC‘𝐴))
7		tcfr.1	. . . . 5 ⊢ 𝐴 ∈ V
8		tcid 9775	. . . . 5 ⊢ (𝐴 ∈ V → 𝐴 ⊆ (TC‘𝐴))
9	7, 8	ax-mp 5	. . . 4 ⊢ 𝐴 ⊆ (TC‘𝐴)
10		tctr 9776	. . . . 5 ⊢ Tr (TC‘𝐴)
11		trfr 46216	. . . . 5 ⊢ ((Tr (TC‘𝐴) ∧ E Fr (TC‘𝐴)) → (TC‘𝐴) ⊆ ∪ (𝑅1 “ On))
12	10, 11	mpan 703	. . . 4 ⊢ ( E Fr (TC‘𝐴) → (TC‘𝐴) ⊆ ∪ (𝑅1 “ On))
13	9, 12	sstrid 3924	. . 3 ⊢ ( E Fr (TC‘𝐴) → 𝐴 ⊆ ∪ (𝑅1 “ On))
14	7	r1elss 9851	. . 3 ⊢ (𝐴 ∈ ∪ (𝑅1 “ On) ↔ 𝐴 ⊆ ∪ (𝑅1 “ On))
15	13, 14	sylibr 237	. 2 ⊢ ( E Fr (TC‘𝐴) → 𝐴 ∈ ∪ (𝑅1 “ On))
16	6, 15	impbii 212	1 ⊢ (𝐴 ∈ ∪ (𝑅1 “ On) ↔ E Fr (TC‘𝐴))

This proof depends on syntax axioms:   ↔ wb 209   ∈ wcel 2147  Vcvv 3454   ⊆ wss 3900  ∪ cuni 4872  Tr wtr 5218   E cep 5557   Fr wfr 5608   “ cima 5661  Oncon0 6388  ‘cfv 6566  TCctc 9772  𝑅₁cr1 9803

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-rep 5238  ax-sep 5255  ax-nul 5266  ax-pow 5334  ax-pr 5398  ax-un 7783  ax-inf2 9679

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-rmo 3369  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-pss 4017  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-int 4913  df-iun 4958  df-iin 4959  df-br 5109  df-opab 5174  df-mpt 5193  df-tr 5219  df-id 5553  df-eprel 5558  df-po 5566  df-so 5567  df-fr 5611  df-se 5612  df-we 5613  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-res 5670  df-ima 5671  df-pred 6330  df-ord 6391  df-on 6392  df-lim 6393  df-suc 6394  df-iota 6520  df-fun 6568  df-fn 6569  df-f 6570  df-f1 6571  df-fo 6572  df-f1o 6573  df-fv 6574  df-riota 7408  df-ov 7454  df-oprab 7455  df-mpo 7456  df-om 7912  df-2nd 8036  df-frecs 8337  df-wrecs 8368  df-recs 8417  df-rdg 8456  df-1o 8514  df-oadd 8518  df-ttrcl 9746  df-tc 9773  df-r1 9805  df-rank 9806  df-relp 46197

This theorem is used by: (None)