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 45390
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 9807 . . 3 (𝐴 (𝑅1 “ On) → (TC‘𝐴) ∈ (𝑅1 “ On))
2 r1elssi 9729 . . 3 ((TC‘𝐴) ∈ (𝑅1 “ On) → (TC‘𝐴) ⊆ (𝑅1 “ On))
3 wffr 45388 . . . 4 E Fr (𝑅1 “ On)
4 frss 5595 . . . 4 ((TC‘𝐴) ⊆ (𝑅1 “ On) → ( E Fr (𝑅1 “ On) → E Fr (TC‘𝐴)))
53, 4mpi 20 . . 3 ((TC‘𝐴) ⊆ (𝑅1 “ On) → E Fr (TC‘𝐴))
61, 2, 53syl 18 . 2 (𝐴 (𝑅1 “ On) → E Fr (TC‘𝐴))
7 tcfr.1 . . . . 5 𝐴 ∈ V
8 tcid 9658 . . . . 5 (𝐴 ∈ V → 𝐴 ⊆ (TC‘𝐴))
97, 8ax-mp 5 . . . 4 𝐴 ⊆ (TC‘𝐴)
10 tctr 9659 . . . . 5 Tr (TC‘𝐴)
11 trfr 45389 . . . . 5 ((Tr (TC‘𝐴) ∧ E Fr (TC‘𝐴)) → (TC‘𝐴) ⊆ (𝑅1 “ On))
1210, 11mpan 691 . . . 4 ( E Fr (TC‘𝐴) → (TC‘𝐴) ⊆ (𝑅1 “ On))
139, 12sstrid 3933 . . 3 ( E Fr (TC‘𝐴) → 𝐴 (𝑅1 “ On))
147r1elss 9730 . . 3 (𝐴 (𝑅1 “ On) ↔ 𝐴 (𝑅1 “ On))
1513, 14sylibr 234 . 2 ( E Fr (TC‘𝐴) → 𝐴 (𝑅1 “ On))
166, 15impbii 209 1 (𝐴 (𝑅1 “ On) ↔ E Fr (TC‘𝐴))
Colors of variables: wff setvar class
Syntax hints:  wb 206  wcel 2114  Vcvv 3429  wss 3889   cuni 4850  Tr wtr 5192   E cep 5530   Fr wfr 5581  cima 5634  Oncon0 6323  cfv 6498  TCctc 9655  𝑅1cr1 9686
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2708  ax-rep 5212  ax-sep 5231  ax-nul 5241  ax-pow 5307  ax-pr 5375  ax-un 7689  ax-inf2 9562
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3or 1088  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2539  df-eu 2569  df-clab 2715  df-cleq 2728  df-clel 2811  df-nfc 2885  df-ne 2933  df-ral 3052  df-rex 3062  df-rmo 3342  df-reu 3343  df-rab 3390  df-v 3431  df-sbc 3729  df-csb 3838  df-dif 3892  df-un 3894  df-in 3896  df-ss 3906  df-pss 3909  df-nul 4274  df-if 4467  df-pw 4543  df-sn 4568  df-pr 4570  df-op 4574  df-uni 4851  df-int 4890  df-iun 4935  df-iin 4936  df-br 5086  df-opab 5148  df-mpt 5167  df-tr 5193  df-id 5526  df-eprel 5531  df-po 5539  df-so 5540  df-fr 5584  df-se 5585  df-we 5586  df-xp 5637  df-rel 5638  df-cnv 5639  df-co 5640  df-dm 5641  df-rn 5642  df-res 5643  df-ima 5644  df-pred 6265  df-ord 6326  df-on 6327  df-lim 6328  df-suc 6329  df-iota 6454  df-fun 6500  df-fn 6501  df-f 6502  df-f1 6503  df-fo 6504  df-f1o 6505  df-fv 6506  df-riota 7324  df-ov 7370  df-oprab 7371  df-mpo 7372  df-om 7818  df-2nd 7943  df-frecs 8231  df-wrecs 8262  df-recs 8311  df-rdg 8349  df-1o 8405  df-oadd 8409  df-ttrcl 9629  df-tc 9656  df-r1 9688  df-rank 9689  df-relp 45370
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator