Users' Mathboxes Mathbox for Eric Schmidt < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  tcfr Structured version   Visualization version   GIF version

Theorem tcfr 45931
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
StepHypRef Expression
1 tcwf 9893 . . 3 (𝐴 ∈ ∪ (𝑅1 “ On) → (TC‘𝐴) ∈ ∪ (𝑅1 “ On))
2 r1elssi 9806 . . 3 ((TC‘𝐴) ∈ ∪ (𝑅1 “ On) → (TC‘𝐴) ⊆ ∪ (𝑅1 “ On))
3 wffr 45929 . . . 4 E Fr ∪ (𝑅1 “ On)
4 frss 5615 . . . 4 ((TC‘𝐴) ⊆ ∪ (𝑅1 “ On) → ( E Fr ∪ (𝑅1 “ On) → E Fr (TC‘𝐴)))
53, 4mpi 21 . . 3 ((TC‘𝐴) ⊆ ∪ (𝑅1 “ On) → E Fr (TC‘𝐴))
61, 2, 53syl 19 . 2 (𝐴 ∈ ∪ (𝑅1 “ On) → E Fr (TC‘𝐴))
7 tcfr.1 . . . . 5 𝐴 ∈ V
8 tcid 9731 . . . . 5 (𝐴 ∈ V → 𝐴 ⊆ (TC‘𝐴))
97, 8ax-mp 5 . . . 4 𝐴 ⊆ (TC‘𝐴)
10 tctr 9732 . . . . 5 Tr (TC‘𝐴)
11 trfr 45930 . . . . 5 ((Tr (TC‘𝐴) ∧ E Fr (TC‘𝐴)) → (TC‘𝐴) ⊆ ∪ (𝑅1 “ On))
1210, 11mpan 703 . . . 4 ( E Fr (TC‘𝐴) → (TC‘𝐴) ⊆ ∪ (𝑅1 “ On))
139, 12sstrid 3942 . . 3 ( E Fr (TC‘𝐴) → 𝐴 ⊆ ∪ (𝑅1 “ On))
147r1elss 9807 . . 3 (𝐴 ∈ ∪ (𝑅1 “ On) ↔ 𝐴 ⊆ ∪ (𝑅1 “ On))
1513, 14sylibr 237 . 2 ( E Fr (TC‘𝐴) → 𝐴 ∈ ∪ (𝑅1 “ On))
166, 15impbii 212 1 (𝐴 ∈ ∪ (𝑅1 “ On) ↔ E Fr (TC‘𝐴))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   ↔ wb 209   ∈ wcel 2145  Vcvv 3451   ⊆ wss 3899  ∪ cuni 4867  Tr wtr 5212   E cep 5550   Fr wfr 5601   “ cima 5654  Oncon0 6361  ‘cfv 6537  TCctc 9728  𝑅1cr1 9759
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 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2733  ax-rep 5232  ax-sep 5249  ax-nul 5260  ax-pow 5327  ax-pr 5391  ax-un 7749  ax-inf2 9635
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 2100  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-rmo 3366  df-reu 3367  df-rab 3414  df-v 3453  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-pss 3919  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-int 4908  df-iun 4953  df-iin 4954  df-br 5104  df-opab 5168  df-mpt 5187  df-tr 5213  df-id 5546  df-eprel 5551  df-po 5559  df-so 5560  df-fr 5604  df-se 5605  df-we 5606  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-pred 6303  df-ord 6364  df-on 6365  df-lim 6366  df-suc 6367  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-f1 6542  df-fo 6543  df-f1o 6544  df-fv 6545  df-riota 7375  df-ov 7421  df-oprab 7422  df-mpo 7423  df-om 7876  df-2nd 8000  df-frecs 8292  df-wrecs 8323  df-recs 8372  df-rdg 8411  df-1o 8469  df-oadd 8473  df-ttrcl 9702  df-tc 9729  df-r1 9761  df-rank 9762  df-relp 45911
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator