Users' Mathboxes Mathbox for Alan Sare < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  trintALT Structured version   Visualization version   GIF version

Theorem trintALT 41580
Description: The intersection of a class of transitive sets is transitive. Exercise 5(b) of [Enderton] p. 73. trintALT 41580 is an alternate proof of trint 5155. trintALT 41580 is trintALTVD 41579 without virtual deductions and was automatically derived from trintALTVD 41579 using the tools program translate..without..overwriting.cmd and the Metamath program "MM-PA> MINIMIZE_WITH *" command. (Contributed by Alan Sare, 17-Apr-2012.) (Proof modification is discouraged.) (New usage is discouraged.)
Assertion
Ref Expression
trintALT (∀𝑥𝐴 Tr 𝑥 → Tr 𝐴)
Distinct variable group:   𝑥,𝐴

Proof of Theorem trintALT
Dummy variables 𝑞 𝑦 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 simpl 486 . . . . 5 ((𝑧𝑦𝑦 𝐴) → 𝑧𝑦)
21a1i 11 . . . 4 (∀𝑥𝐴 Tr 𝑥 → ((𝑧𝑦𝑦 𝐴) → 𝑧𝑦))
3 iidn3 41200 . . . . . . 7 (∀𝑥𝐴 Tr 𝑥 → ((𝑧𝑦𝑦 𝐴) → (𝑞𝐴𝑞𝐴)))
4 id 22 . . . . . . . 8 (∀𝑥𝐴 Tr 𝑥 → ∀𝑥𝐴 Tr 𝑥)
5 rspsbc 3811 . . . . . . . 8 (𝑞𝐴 → (∀𝑥𝐴 Tr 𝑥[𝑞 / 𝑥]Tr 𝑥))
63, 4, 5ee31 41451 . . . . . . 7 (∀𝑥𝐴 Tr 𝑥 → ((𝑧𝑦𝑦 𝐴) → (𝑞𝐴[𝑞 / 𝑥]Tr 𝑥)))
7 trsbc 41239 . . . . . . . 8 (𝑞𝐴 → ([𝑞 / 𝑥]Tr 𝑥 ↔ Tr 𝑞))
87biimpd 232 . . . . . . 7 (𝑞𝐴 → ([𝑞 / 𝑥]Tr 𝑥 → Tr 𝑞))
93, 6, 8ee33 41220 . . . . . 6 (∀𝑥𝐴 Tr 𝑥 → ((𝑧𝑦𝑦 𝐴) → (𝑞𝐴 → Tr 𝑞)))
10 simpr 488 . . . . . . . . 9 ((𝑧𝑦𝑦 𝐴) → 𝑦 𝐴)
1110a1i 11 . . . . . . . 8 (∀𝑥𝐴 Tr 𝑥 → ((𝑧𝑦𝑦 𝐴) → 𝑦 𝐴))
12 elintg 4849 . . . . . . . . 9 (𝑦 𝐴 → (𝑦 𝐴 ↔ ∀𝑞𝐴 𝑦𝑞))
1312ibi 270 . . . . . . . 8 (𝑦 𝐴 → ∀𝑞𝐴 𝑦𝑞)
1411, 13syl6 35 . . . . . . 7 (∀𝑥𝐴 Tr 𝑥 → ((𝑧𝑦𝑦 𝐴) → ∀𝑞𝐴 𝑦𝑞))
15 rsp 3173 . . . . . . 7 (∀𝑞𝐴 𝑦𝑞 → (𝑞𝐴𝑦𝑞))
1614, 15syl6 35 . . . . . 6 (∀𝑥𝐴 Tr 𝑥 → ((𝑧𝑦𝑦 𝐴) → (𝑞𝐴𝑦𝑞)))
17 trel 5146 . . . . . . 7 (Tr 𝑞 → ((𝑧𝑦𝑦𝑞) → 𝑧𝑞))
1817expd 419 . . . . . 6 (Tr 𝑞 → (𝑧𝑦 → (𝑦𝑞𝑧𝑞)))
199, 2, 16, 18ee323 41207 . . . . 5 (∀𝑥𝐴 Tr 𝑥 → ((𝑧𝑦𝑦 𝐴) → (𝑞𝐴𝑧𝑞)))
2019ralrimdv 3156 . . . 4 (∀𝑥𝐴 Tr 𝑥 → ((𝑧𝑦𝑦 𝐴) → ∀𝑞𝐴 𝑧𝑞))
21 elintg 4849 . . . . 5 (𝑧𝑦 → (𝑧 𝐴 ↔ ∀𝑞𝐴 𝑧𝑞))
2221biimprd 251 . . . 4 (𝑧𝑦 → (∀𝑞𝐴 𝑧𝑞𝑧 𝐴))
232, 20, 22syl6c 70 . . 3 (∀𝑥𝐴 Tr 𝑥 → ((𝑧𝑦𝑦 𝐴) → 𝑧 𝐴))
2423alrimivv 1929 . 2 (∀𝑥𝐴 Tr 𝑥 → ∀𝑧𝑦((𝑧𝑦𝑦 𝐴) → 𝑧 𝐴))
25 dftr2 5141 . 2 (Tr 𝐴 ↔ ∀𝑧𝑦((𝑧𝑦𝑦 𝐴) → 𝑧 𝐴))
2624, 25sylibr 237 1 (∀𝑥𝐴 Tr 𝑥 → Tr 𝐴)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 399  wal 1536  wcel 2112  wral 3109  [wsbc 3723   cint 4841  Tr wtr 5139
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 1911  ax-6 1970  ax-7 2015  ax-8 2114  ax-9 2122  ax-10 2143  ax-11 2159  ax-12 2176  ax-ext 2773
This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-3an 1086  df-tru 1541  df-ex 1782  df-nf 1786  df-sb 2070  df-clab 2780  df-cleq 2794  df-clel 2873  df-nfc 2941  df-ral 3114  df-v 3446  df-sbc 3724  df-in 3891  df-ss 3901  df-uni 4804  df-int 4842  df-tr 5140
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator