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

Theorem untangtr 32493
 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 5058 . . . 4 (Tr 𝐴 𝐴𝐴)
2 ssralv 3949 . . . 4 ( 𝐴𝐴 → (∀𝑥𝐴 ¬ 𝑥𝑥 → ∀𝑥 𝐴 ¬ 𝑥𝑥))
31, 2sylbi 218 . . 3 (Tr 𝐴 → (∀𝑥𝐴 ¬ 𝑥𝑥 → ∀𝑥 𝐴 ¬ 𝑥𝑥))
4 elequ1 2086 . . . . . . 7 (𝑥 = 𝑦 → (𝑥𝑥𝑦𝑥))
5 elequ2 2094 . . . . . . 7 (𝑥 = 𝑦 → (𝑦𝑥𝑦𝑦))
64, 5bitrd 280 . . . . . 6 (𝑥 = 𝑦 → (𝑥𝑥𝑦𝑦))
76notbid 319 . . . . 5 (𝑥 = 𝑦 → (¬ 𝑥𝑥 ↔ ¬ 𝑦𝑦))
87cbvralv 3400 . . . 4 (∀𝑥 𝐴 ¬ 𝑥𝑥 ↔ ∀𝑦 𝐴 ¬ 𝑦𝑦)
9 untuni 32488 . . . 4 (∀𝑦 𝐴 ¬ 𝑦𝑦 ↔ ∀𝑥𝐴𝑦𝑥 ¬ 𝑦𝑦)
108, 9bitri 276 . . 3 (∀𝑥 𝐴 ¬ 𝑥𝑥 ↔ ∀𝑥𝐴𝑦𝑥 ¬ 𝑦𝑦)
113, 10syl6ib 252 . 2 (Tr 𝐴 → (∀𝑥𝐴 ¬ 𝑥𝑥 → ∀𝑥𝐴𝑦𝑥 ¬ 𝑦𝑦))
12 untelirr 32487 . . 3 (∀𝑦𝑥 ¬ 𝑦𝑦 → ¬ 𝑥𝑥)
1312ralimi 3125 . 2 (∀𝑥𝐴𝑦𝑥 ¬ 𝑦𝑦 → ∀𝑥𝐴 ¬ 𝑥𝑥)
1411, 13impbid1 226 1 (Tr 𝐴 → (∀𝑥𝐴 ¬ 𝑥𝑥 ↔ ∀𝑥𝐴𝑦𝑥 ¬ 𝑦𝑦))
 Colors of variables: wff setvar class Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 207  ∀wral 3103   ⊆ wss 3854  ∪ cuni 4739  Tr wtr 5057 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1775  ax-4 1789  ax-5 1886  ax-6 1945  ax-7 1990  ax-8 2081  ax-9 2089  ax-10 2110  ax-11 2124  ax-12 2139  ax-13 2342  ax-ext 2767 This theorem depends on definitions:  df-bi 208  df-an 397  df-or 843  df-tru 1523  df-ex 1760  df-nf 1764  df-sb 2041  df-clab 2774  df-cleq 2786  df-clel 2861  df-nfc 2933  df-ral 3108  df-rex 3109  df-v 3434  df-in 3861  df-ss 3869  df-uni 4740  df-tr 5058 This theorem is referenced by: (None)
 Copyright terms: Public domain W3C validator