Users' Mathboxes Mathbox for Scott Fenton < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  untangtr Structured version   Visualization version   GIF version

Theorem untangtr 32040
Description: A transitive class is untangled iff its elements are. (Contributed by Scott Fenton, 7-Mar-2011.)
Assertion
Ref Expression
untangtr (Tr 𝐴 → (∀𝑥𝐴 ¬ 𝑥𝑥 ↔ ∀𝑥𝐴𝑦𝑥 ¬ 𝑦𝑦))
Distinct variable group:   𝑥,𝑦,𝐴

Proof of Theorem untangtr
StepHypRef Expression
1 df-tr 4914 . . . 4 (Tr 𝐴 𝐴𝐴)
2 ssralv 3828 . . . 4 ( 𝐴𝐴 → (∀𝑥𝐴 ¬ 𝑥𝑥 → ∀𝑥 𝐴 ¬ 𝑥𝑥))
31, 2sylbi 208 . . 3 (Tr 𝐴 → (∀𝑥𝐴 ¬ 𝑥𝑥 → ∀𝑥 𝐴 ¬ 𝑥𝑥))
4 elequ1 2162 . . . . . . 7 (𝑥 = 𝑦 → (𝑥𝑥𝑦𝑥))
5 elequ2 2169 . . . . . . 7 (𝑥 = 𝑦 → (𝑦𝑥𝑦𝑦))
64, 5bitrd 270 . . . . . 6 (𝑥 = 𝑦 → (𝑥𝑥𝑦𝑦))
76notbid 309 . . . . 5 (𝑥 = 𝑦 → (¬ 𝑥𝑥 ↔ ¬ 𝑦𝑦))
87cbvralv 3319 . . . 4 (∀𝑥 𝐴 ¬ 𝑥𝑥 ↔ ∀𝑦 𝐴 ¬ 𝑦𝑦)
9 untuni 32035 . . . 4 (∀𝑦 𝐴 ¬ 𝑦𝑦 ↔ ∀𝑥𝐴𝑦𝑥 ¬ 𝑦𝑦)
108, 9bitri 266 . . 3 (∀𝑥 𝐴 ¬ 𝑥𝑥 ↔ ∀𝑥𝐴𝑦𝑥 ¬ 𝑦𝑦)
113, 10syl6ib 242 . 2 (Tr 𝐴 → (∀𝑥𝐴 ¬ 𝑥𝑥 → ∀𝑥𝐴𝑦𝑥 ¬ 𝑦𝑦))
12 untelirr 32034 . . 3 (∀𝑦𝑥 ¬ 𝑦𝑦 → ¬ 𝑥𝑥)
1312ralimi 3099 . 2 (∀𝑥𝐴𝑦𝑥 ¬ 𝑦𝑦 → ∀𝑥𝐴 ¬ 𝑥𝑥)
1411, 13impbid1 216 1 (Tr 𝐴 → (∀𝑥𝐴 ¬ 𝑥𝑥 ↔ ∀𝑥𝐴𝑦𝑥 ¬ 𝑦𝑦))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 197  wral 3055  wss 3734   cuni 4596  Tr wtr 4913
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1890  ax-4 1904  ax-5 2005  ax-6 2070  ax-7 2105  ax-8 2157  ax-9 2164  ax-10 2183  ax-11 2198  ax-12 2211  ax-13 2352  ax-ext 2743
This theorem depends on definitions:  df-bi 198  df-an 385  df-or 874  df-tru 1656  df-ex 1875  df-nf 1879  df-sb 2063  df-clab 2752  df-cleq 2758  df-clel 2761  df-nfc 2896  df-ral 3060  df-rex 3061  df-v 3352  df-in 3741  df-ss 3748  df-uni 4597  df-tr 4914
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator