Users' Mathboxes Mathbox for Matthew House < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  ttc0elw Structured version   Visualization version   GIF version

Theorem ttc0elw 36892
Description: If a transitive closure is a set, then it contains as an element iff it is nonempty, assuming Regularity. If we also assume Transitive Containment, then we can remove the TC+ 𝐴𝑉 hypothesis, see ttc0el 36900. (Contributed by Matthew House, 6-Apr-2026.)
Assertion
Ref Expression
ttc0elw (TC+ 𝐴𝑉 → (𝐴 ≠ ∅ ↔ ∅ ∈ TC+ 𝐴))

Proof of Theorem ttc0elw
StepHypRef Expression
1 ttc00 36873 . . 3 (𝐴 = ∅ ↔ TC+ 𝐴 = ∅)
21necon3bii 3010 . 2 (𝐴 ≠ ∅ ↔ TC+ 𝐴 ≠ ∅)
3 ttctr 36858 . . . 4 Tr TC+ 𝐴
4 tr0elw 36849 . . . 4 ((TC+ 𝐴𝑉 ∧ TC+ 𝐴 ≠ ∅ ∧ Tr TC+ 𝐴) → ∅ ∈ TC+ 𝐴)
53, 4mp3an3 1472 . . 3 ((TC+ 𝐴𝑉 ∧ TC+ 𝐴 ≠ ∅) → ∅ ∈ TC+ 𝐴)
6 ne0i 4294 . . . 4 (∅ ∈ TC+ 𝐴 → TC+ 𝐴 ≠ ∅)
76adantl 485 . . 3 ((TC+ 𝐴𝑉 ∧ ∅ ∈ TC+ 𝐴) → TC+ 𝐴 ≠ ∅)
85, 7impbida 810 . 2 (TC+ 𝐴𝑉 → (TC+ 𝐴 ≠ ∅ ↔ ∅ ∈ TC+ 𝐴))
92, 8bitrid 285 1 (TC+ 𝐴𝑉 → (𝐴 ≠ ∅ ↔ ∅ ∈ TC+ 𝐴))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 208  wcel 2143  wne 2958  c0 4286  Tr wtr 5208  TC+ cttc 36851
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1816  ax-4 1830  ax-5 1931  ax-6 1988  ax-7 2029  ax-8 2145  ax-9 2153  ax-10 2176  ax-11 2192  ax-12 2213  ax-ext 2735  ax-rep 5228  ax-sep 5247  ax-nul 5257  ax-pr 5391  ax-un 7718  ax-reg 9538
This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-3or 1100  df-3an 1101  df-tru 1564  df-fal 1574  df-ex 1801  df-nf 1805  df-sb 2092  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2838  df-nfc 2912  df-ne 2959  df-ral 3078  df-rex 3088  df-reu 3369  df-rab 3416  df-v 3457  df-sbc 3746  df-csb 3854  df-dif 3908  df-un 3910  df-in 3912  df-ss 3922  df-pss 3925  df-nul 4287  df-if 4482  df-pw 4558  df-sn 4584  df-pr 4586  df-op 4590  df-uni 4867  df-iun 4952  df-br 5102  df-opab 5164  df-mpt 5183  df-tr 5209  df-id 5543  df-eprel 5548  df-po 5556  df-so 5557  df-fr 5601  df-we 5603  df-xp 5654  df-rel 5655  df-cnv 5656  df-co 5657  df-dm 5658  df-rn 5659  df-res 5660  df-ima 5661  df-pred 6288  df-ord 6349  df-on 6350  df-lim 6351  df-suc 6352  df-iota 6477  df-fun 6523  df-fn 6524  df-f 6525  df-f1 6526  df-fo 6527  df-f1o 6528  df-fv 6529  df-ov 7399  df-om 7847  df-2nd 7971  df-frecs 8262  df-wrecs 8293  df-recs 8342  df-rdg 8381  df-ttc 36852
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator