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

Theorem untangtr 30845
 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 4681 . . . 4 (Tr 𝐴 𝐴𝐴)
2 ssralv 3629 . . . 4 ( 𝐴𝐴 → (∀𝑥𝐴 ¬ 𝑥𝑥 → ∀𝑥 𝐴 ¬ 𝑥𝑥))
31, 2sylbi 206 . . 3 (Tr 𝐴 → (∀𝑥𝐴 ¬ 𝑥𝑥 → ∀𝑥 𝐴 ¬ 𝑥𝑥))
4 elequ1 1984 . . . . . . 7 (𝑥 = 𝑦 → (𝑥𝑥𝑦𝑥))
5 elequ2 1991 . . . . . . 7 (𝑥 = 𝑦 → (𝑦𝑥𝑦𝑦))
64, 5bitrd 267 . . . . . 6 (𝑥 = 𝑦 → (𝑥𝑥𝑦𝑦))
76notbid 307 . . . . 5 (𝑥 = 𝑦 → (¬ 𝑥𝑥 ↔ ¬ 𝑦𝑦))
87cbvralv 3147 . . . 4 (∀𝑥 𝐴 ¬ 𝑥𝑥 ↔ ∀𝑦 𝐴 ¬ 𝑦𝑦)
9 untuni 30840 . . . 4 (∀𝑦 𝐴 ¬ 𝑦𝑦 ↔ ∀𝑥𝐴𝑦𝑥 ¬ 𝑦𝑦)
108, 9bitri 263 . . 3 (∀𝑥 𝐴 ¬ 𝑥𝑥 ↔ ∀𝑥𝐴𝑦𝑥 ¬ 𝑦𝑦)
113, 10syl6ib 240 . 2 (Tr 𝐴 → (∀𝑥𝐴 ¬ 𝑥𝑥 → ∀𝑥𝐴𝑦𝑥 ¬ 𝑦𝑦))
12 untelirr 30839 . . 3 (∀𝑦𝑥 ¬ 𝑦𝑦 → ¬ 𝑥𝑥)
1312ralimi 2936 . 2 (∀𝑥𝐴𝑦𝑥 ¬ 𝑦𝑦 → ∀𝑥𝐴 ¬ 𝑥𝑥)
1411, 13impbid1 214 1 (Tr 𝐴 → (∀𝑥𝐴 ¬ 𝑥𝑥 ↔ ∀𝑥𝐴𝑦𝑥 ¬ 𝑦𝑦))
 Colors of variables: wff setvar class Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 195  ∀wral 2896   ⊆ wss 3540  ∪ cuni 4372  Tr wtr 4680 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1713  ax-4 1728  ax-5 1827  ax-6 1875  ax-7 1922  ax-8 1979  ax-9 1986  ax-10 2006  ax-11 2021  ax-12 2034  ax-13 2234  ax-ext 2590 This theorem depends on definitions:  df-bi 196  df-or 384  df-an 385  df-tru 1478  df-ex 1696  df-nf 1701  df-sb 1868  df-clab 2597  df-cleq 2603  df-clel 2606  df-nfc 2740  df-ral 2901  df-rex 2902  df-v 3175  df-in 3547  df-ss 3554  df-uni 4373  df-tr 4681 This theorem is referenced by: (None)
 Copyright terms: Public domain W3C validator