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 45531
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 9843 . . 3 (𝐴 (𝑅1 “ On) → (TC‘𝐴) ∈ (𝑅1 “ On))
2 r1elssi 9765 . . 3 ((TC‘𝐴) ∈ (𝑅1 “ On) → (TC‘𝐴) ⊆ (𝑅1 “ On))
3 wffr 45529 . . . 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 9694 . . . . 5 (𝐴 ∈ V → 𝐴 ⊆ (TC‘𝐴))
97, 8ax-mp 5 . . . 4 𝐴 ⊆ (TC‘𝐴)
10 tctr 9695 . . . . 5 Tr (TC‘𝐴)
11 trfr 45530 . . . . 5 ((Tr (TC‘𝐴) ∧ E Fr (TC‘𝐴)) → (TC‘𝐴) ⊆ (𝑅1 “ On))
1210, 11mpan 702 . . . 4 ( E Fr (TC‘𝐴) → (TC‘𝐴) ⊆ (𝑅1 “ On))
139, 12sstrid 3950 . . 3 ( E Fr (TC‘𝐴) → 𝐴 (𝑅1 “ On))
147r1elss 9766 . . 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
Syntax hints:  wb 209  wcel 2145  Vcvv 3457  wss 3907   cuni 4867  Tr wtr 5211   E cep 5550   Fr wfr 5601  cima 5654  Oncon0 6349  cfv 6525  TCctc 9691  𝑅1cr1 9722
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1818  ax-4 1832  ax-5 1933  ax-6 1990  ax-7 2031  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2215  ax-ext 2737  ax-rep 5231  ax-sep 5250  ax-nul 5260  ax-pow 5326  ax-pr 5394  ax-un 7722  ax-inf2 9598
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3or 1102  df-3an 1103  df-tru 1566  df-fal 1576  df-ex 1803  df-nf 1807  df-sb 2094  df-mo 2569  df-eu 2599  df-clab 2744  df-cleq 2757  df-clel 2840  df-nfc 2914  df-ne 2961  df-ral 3080  df-rex 3090  df-rmo 3370  df-reu 3371  df-rab 3418  df-v 3459  df-sbc 3748  df-csb 3856  df-dif 3910  df-un 3912  df-in 3914  df-ss 3924  df-pss 3927  df-nul 4289  df-if 4484  df-pw 4560  df-sn 4586  df-pr 4588  df-op 4592  df-uni 4868  df-int 4908  df-iun 4953  df-iin 4954  df-br 5105  df-opab 5167  df-mpt 5186  df-tr 5212  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 6291  df-ord 6352  df-on 6353  df-lim 6354  df-suc 6355  df-iota 6481  df-fun 6527  df-fn 6528  df-f 6529  df-f1 6530  df-fo 6531  df-f1o 6532  df-fv 6533  df-riota 7357  df-ov 7403  df-oprab 7404  df-mpo 7405  df-om 7851  df-2nd 7975  df-frecs 8266  df-wrecs 8297  df-recs 8346  df-rdg 8385  df-1o 8441  df-oadd 8445  df-ttrcl 9665  df-tc 9692  df-r1 9724  df-rank 9725  df-relp 45511
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator