MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  triun Structured version   Visualization version   GIF version

Theorem triun 4766
Description: The indexed union of a class of transitive sets is transitive. (Contributed by Mario Carneiro, 16-Nov-2014.)
Assertion
Ref Expression
triun (∀𝑥𝐴 Tr 𝐵 → Tr 𝑥𝐴 𝐵)
Distinct variable group:   𝑥,𝐴
Allowed substitution hint:   𝐵(𝑥)

Proof of Theorem triun
Dummy variable 𝑦 is distinct from all other variables.
StepHypRef Expression
1 eliun 4524 . . . 4 (𝑦 𝑥𝐴 𝐵 ↔ ∃𝑥𝐴 𝑦𝐵)
2 r19.29 3072 . . . . 5 ((∀𝑥𝐴 Tr 𝐵 ∧ ∃𝑥𝐴 𝑦𝐵) → ∃𝑥𝐴 (Tr 𝐵𝑦𝐵))
3 nfcv 2764 . . . . . . 7 𝑥𝑦
4 nfiu1 4550 . . . . . . 7 𝑥 𝑥𝐴 𝐵
53, 4nfss 3596 . . . . . 6 𝑥 𝑦 𝑥𝐴 𝐵
6 trss 4761 . . . . . . . 8 (Tr 𝐵 → (𝑦𝐵𝑦𝐵))
76imp 445 . . . . . . 7 ((Tr 𝐵𝑦𝐵) → 𝑦𝐵)
8 ssiun2 4563 . . . . . . 7 (𝑥𝐴𝐵 𝑥𝐴 𝐵)
9 sstr2 3610 . . . . . . 7 (𝑦𝐵 → (𝐵 𝑥𝐴 𝐵𝑦 𝑥𝐴 𝐵))
107, 8, 9syl2imc 41 . . . . . 6 (𝑥𝐴 → ((Tr 𝐵𝑦𝐵) → 𝑦 𝑥𝐴 𝐵))
115, 10rexlimi 3024 . . . . 5 (∃𝑥𝐴 (Tr 𝐵𝑦𝐵) → 𝑦 𝑥𝐴 𝐵)
122, 11syl 17 . . . 4 ((∀𝑥𝐴 Tr 𝐵 ∧ ∃𝑥𝐴 𝑦𝐵) → 𝑦 𝑥𝐴 𝐵)
131, 12sylan2b 492 . . 3 ((∀𝑥𝐴 Tr 𝐵𝑦 𝑥𝐴 𝐵) → 𝑦 𝑥𝐴 𝐵)
1413ralrimiva 2966 . 2 (∀𝑥𝐴 Tr 𝐵 → ∀𝑦 𝑥𝐴 𝐵𝑦 𝑥𝐴 𝐵)
15 dftr3 4756 . 2 (Tr 𝑥𝐴 𝐵 ↔ ∀𝑦 𝑥𝐴 𝐵𝑦 𝑥𝐴 𝐵)
1614, 15sylibr 224 1 (∀𝑥𝐴 Tr 𝐵 → Tr 𝑥𝐴 𝐵)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 384  wcel 1990  wral 2912  wrex 2913  wss 3574   ciun 4520  Tr wtr 4752
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-9 1999  ax-10 2019  ax-11 2034  ax-12 2047  ax-13 2246  ax-ext 2602
This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-tru 1486  df-ex 1705  df-nf 1710  df-sb 1881  df-clab 2609  df-cleq 2615  df-clel 2618  df-nfc 2753  df-ral 2917  df-rex 2918  df-v 3202  df-in 3581  df-ss 3588  df-uni 4437  df-iun 4522  df-tr 4753
This theorem is referenced by:  truni  4767  r1tr  8639  r1elssi  8668  iunord  42422
  Copyright terms: Public domain W3C validator