ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  triun GIF version

Theorem triun 4093
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 3870 . . . 4 (𝑦 𝑥𝐴 𝐵 ↔ ∃𝑥𝐴 𝑦𝐵)
2 r19.29 2603 . . . . 5 ((∀𝑥𝐴 Tr 𝐵 ∧ ∃𝑥𝐴 𝑦𝐵) → ∃𝑥𝐴 (Tr 𝐵𝑦𝐵))
3 nfcv 2308 . . . . . . 7 𝑥𝑦
4 nfiu1 3896 . . . . . . 7 𝑥 𝑥𝐴 𝐵
53, 4nfss 3135 . . . . . 6 𝑥 𝑦 𝑥𝐴 𝐵
6 trss 4089 . . . . . . . 8 (Tr 𝐵 → (𝑦𝐵𝑦𝐵))
76imp 123 . . . . . . 7 ((Tr 𝐵𝑦𝐵) → 𝑦𝐵)
8 ssiun2 3909 . . . . . . . 8 (𝑥𝐴𝐵 𝑥𝐴 𝐵)
9 sstr2 3149 . . . . . . . 8 (𝑦𝐵 → (𝐵 𝑥𝐴 𝐵𝑦 𝑥𝐴 𝐵))
108, 9syl5com 29 . . . . . . 7 (𝑥𝐴 → (𝑦𝐵𝑦 𝑥𝐴 𝐵))
117, 10syl5 32 . . . . . 6 (𝑥𝐴 → ((Tr 𝐵𝑦𝐵) → 𝑦 𝑥𝐴 𝐵))
125, 11rexlimi 2576 . . . . 5 (∃𝑥𝐴 (Tr 𝐵𝑦𝐵) → 𝑦 𝑥𝐴 𝐵)
132, 12syl 14 . . . 4 ((∀𝑥𝐴 Tr 𝐵 ∧ ∃𝑥𝐴 𝑦𝐵) → 𝑦 𝑥𝐴 𝐵)
141, 13sylan2b 285 . . 3 ((∀𝑥𝐴 Tr 𝐵𝑦 𝑥𝐴 𝐵) → 𝑦 𝑥𝐴 𝐵)
1514ralrimiva 2539 . 2 (∀𝑥𝐴 Tr 𝐵 → ∀𝑦 𝑥𝐴 𝐵𝑦 𝑥𝐴 𝐵)
16 dftr3 4084 . 2 (Tr 𝑥𝐴 𝐵 ↔ ∀𝑦 𝑥𝐴 𝐵𝑦 𝑥𝐴 𝐵)
1715, 16sylibr 133 1 (∀𝑥𝐴 Tr 𝐵 → Tr 𝑥𝐴 𝐵)
Colors of variables: wff set class
Syntax hints:  wi 4  wa 103  wcel 2136  wral 2444  wrex 2445  wss 3116   ciun 3866  Tr wtr 4080
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-io 699  ax-5 1435  ax-7 1436  ax-gen 1437  ax-ie1 1481  ax-ie2 1482  ax-8 1492  ax-10 1493  ax-11 1494  ax-i12 1495  ax-bndl 1497  ax-4 1498  ax-17 1514  ax-i9 1518  ax-ial 1522  ax-i5r 1523  ax-ext 2147
This theorem depends on definitions:  df-bi 116  df-tru 1346  df-nf 1449  df-sb 1751  df-clab 2152  df-cleq 2158  df-clel 2161  df-nfc 2297  df-ral 2449  df-rex 2450  df-v 2728  df-in 3122  df-ss 3129  df-uni 3790  df-iun 3868  df-tr 4081
This theorem is referenced by:  truni  4094
  Copyright terms: Public domain W3C validator