Theorem triun 5232

Description: An indexed union of a class of transitive sets is transitive. (Contributed by Mario Carneiro, 16-Nov-2014.)

Assertion

Ref	Expression
triun	⊢ (∀𝑥 ∈ 𝐴 Tr 𝐵 → Tr ∪ 𝑥 ∈ 𝐴 𝐵)

Proof of Theorem triun

Dummy variable 𝑦 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		eliun 4962	. . . 4 ⊢ (𝑦 ∈ ∪ 𝑥 ∈ 𝐴 𝐵 ↔ ∃𝑥 ∈ 𝐴 𝑦 ∈ 𝐵)
2		r19.29 3095	. . . . 5 ⊢ ((∀𝑥 ∈ 𝐴 Tr 𝐵 ∧ ∃𝑥 ∈ 𝐴 𝑦 ∈ 𝐵) → ∃𝑥 ∈ 𝐴 (Tr 𝐵 ∧ 𝑦 ∈ 𝐵))
3		nfcv 2892	. . . . . . 7 ⊢ Ⅎ𝑥𝑦
4		nfiu1 4994	. . . . . . 7 ⊢ Ⅎ𝑥∪ 𝑥 ∈ 𝐴 𝐵
5	3, 4	nfss 3942	. . . . . 6 ⊢ Ⅎ𝑥 𝑦 ⊆ ∪ 𝑥 ∈ 𝐴 𝐵
6		trss 5228	. . . . . . . 8 ⊢ (Tr 𝐵 → (𝑦 ∈ 𝐵 → 𝑦 ⊆ 𝐵))
7	6	imp 406	. . . . . . 7 ⊢ ((Tr 𝐵 ∧ 𝑦 ∈ 𝐵) → 𝑦 ⊆ 𝐵)
8		ssiun2 5014	. . . . . . 7 ⊢ (𝑥 ∈ 𝐴 → 𝐵 ⊆ ∪ 𝑥 ∈ 𝐴 𝐵)
9		sstr2 3956	. . . . . . 7 ⊢ (𝑦 ⊆ 𝐵 → (𝐵 ⊆ ∪ 𝑥 ∈ 𝐴 𝐵 → 𝑦 ⊆ ∪ 𝑥 ∈ 𝐴 𝐵))
10	7, 8, 9	syl2imc 41	. . . . . 6 ⊢ (𝑥 ∈ 𝐴 → ((Tr 𝐵 ∧ 𝑦 ∈ 𝐵) → 𝑦 ⊆ ∪ 𝑥 ∈ 𝐴 𝐵))
11	5, 10	rexlimi 3238	. . . . 5 ⊢ (∃𝑥 ∈ 𝐴 (Tr 𝐵 ∧ 𝑦 ∈ 𝐵) → 𝑦 ⊆ ∪ 𝑥 ∈ 𝐴 𝐵)
12	2, 11	syl 17	. . . 4 ⊢ ((∀𝑥 ∈ 𝐴 Tr 𝐵 ∧ ∃𝑥 ∈ 𝐴 𝑦 ∈ 𝐵) → 𝑦 ⊆ ∪ 𝑥 ∈ 𝐴 𝐵)
13	1, 12	sylan2b 594	. . 3 ⊢ ((∀𝑥 ∈ 𝐴 Tr 𝐵 ∧ 𝑦 ∈ ∪ 𝑥 ∈ 𝐴 𝐵) → 𝑦 ⊆ ∪ 𝑥 ∈ 𝐴 𝐵)
14	13	ralrimiva 3126	. 2 ⊢ (∀𝑥 ∈ 𝐴 Tr 𝐵 → ∀𝑦 ∈ ∪ 𝑥 ∈ 𝐴 𝐵𝑦 ⊆ ∪ 𝑥 ∈ 𝐴 𝐵)
15		dftr3 5223	. 2 ⊢ (Tr ∪ 𝑥 ∈ 𝐴 𝐵 ↔ ∀𝑦 ∈ ∪ 𝑥 ∈ 𝐴 𝐵𝑦 ⊆ ∪ 𝑥 ∈ 𝐴 𝐵)
16	14, 15	sylibr 234	1 ⊢ (∀𝑥 ∈ 𝐴 Tr 𝐵 → Tr ∪ 𝑥 ∈ 𝐴 𝐵)

Syntax hints:   → wi 4   ∧ wa 395   ∈ wcel 2109  ∀wral 3045  ∃wrex 3054   ⊆ wss 3917  ∪ ciun 4958  Tr wtr 5217

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2702

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-tru 1543  df-ex 1780  df-nf 1784  df-sb 2066  df-clab 2709  df-cleq 2722  df-clel 2804  df-nfc 2879  df-ral 3046  df-rex 3055  df-v 3452  df-ss 3934  df-uni 4875  df-iun 4960  df-tr 5218

This theorem is referenced by:  truni  5233  r1tr  9736  r1elssi  9765  iunord  49669