Theorem intgru 10225

Description: The intersection of a family of universes is a universe. (Contributed by Mario Carneiro, 9-Jun-2013.)

Assertion

Ref	Expression
intgru	⊢ ((𝐴 ⊆ Univ ∧ 𝐴 ≠ ∅) → ∩ 𝐴 ∈ Univ)

Proof of Theorem intgru

Dummy variables 𝑥 𝑢 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		simpr 488	. . 3 ⊢ ((𝐴 ⊆ Univ ∧ 𝐴 ≠ ∅) → 𝐴 ≠ ∅)
2		intex 5204	. . 3 ⊢ (𝐴 ≠ ∅ ↔ ∩ 𝐴 ∈ V)
3	1, 2	sylib 221	. 2 ⊢ ((𝐴 ⊆ Univ ∧ 𝐴 ≠ ∅) → ∩ 𝐴 ∈ V)
4		dfss3 3903	. . . . 5 ⊢ (𝐴 ⊆ Univ ↔ ∀𝑢 ∈ 𝐴 𝑢 ∈ Univ)
5		grutr 10204	. . . . . 6 ⊢ (𝑢 ∈ Univ → Tr 𝑢)
6	5	ralimi 3128	. . . . 5 ⊢ (∀𝑢 ∈ 𝐴 𝑢 ∈ Univ → ∀𝑢 ∈ 𝐴 Tr 𝑢)
7	4, 6	sylbi 220	. . . 4 ⊢ (𝐴 ⊆ Univ → ∀𝑢 ∈ 𝐴 Tr 𝑢)
8		trint 5152	. . . 4 ⊢ (∀𝑢 ∈ 𝐴 Tr 𝑢 → Tr ∩ 𝐴)
9	7, 8	syl 17	. . 3 ⊢ (𝐴 ⊆ Univ → Tr ∩ 𝐴)
10	9	adantr 484	. 2 ⊢ ((𝐴 ⊆ Univ ∧ 𝐴 ≠ ∅) → Tr ∩ 𝐴)
11		grupw 10206	. . . . . . . . . 10 ⊢ ((𝑢 ∈ Univ ∧ 𝑥 ∈ 𝑢) → 𝒫 𝑥 ∈ 𝑢)
12	11	ex 416	. . . . . . . . 9 ⊢ (𝑢 ∈ Univ → (𝑥 ∈ 𝑢 → 𝒫 𝑥 ∈ 𝑢))
13	12	ral2imi 3124	. . . . . . . 8 ⊢ (∀𝑢 ∈ 𝐴 𝑢 ∈ Univ → (∀𝑢 ∈ 𝐴 𝑥 ∈ 𝑢 → ∀𝑢 ∈ 𝐴 𝒫 𝑥 ∈ 𝑢))
14		vex 3444	. . . . . . . . 9 ⊢ 𝑥 ∈ V
15	14	elint2 4845	. . . . . . . 8 ⊢ (𝑥 ∈ ∩ 𝐴 ↔ ∀𝑢 ∈ 𝐴 𝑥 ∈ 𝑢)
16		vpwex 5243	. . . . . . . . 9 ⊢ 𝒫 𝑥 ∈ V
17	16	elint2 4845	. . . . . . . 8 ⊢ (𝒫 𝑥 ∈ ∩ 𝐴 ↔ ∀𝑢 ∈ 𝐴 𝒫 𝑥 ∈ 𝑢)
18	13, 15, 17	3imtr4g 299	. . . . . . 7 ⊢ (∀𝑢 ∈ 𝐴 𝑢 ∈ Univ → (𝑥 ∈ ∩ 𝐴 → 𝒫 𝑥 ∈ ∩ 𝐴))
19	18	imp 410	. . . . . 6 ⊢ ((∀𝑢 ∈ 𝐴 𝑢 ∈ Univ ∧ 𝑥 ∈ ∩ 𝐴) → 𝒫 𝑥 ∈ ∩ 𝐴)
20	19	adantlr 714	. . . . 5 ⊢ (((∀𝑢 ∈ 𝐴 𝑢 ∈ Univ ∧ 𝐴 ≠ ∅) ∧ 𝑥 ∈ ∩ 𝐴) → 𝒫 𝑥 ∈ ∩ 𝐴)
21		r19.26 3137	. . . . . . . . . 10 ⊢ (∀𝑢 ∈ 𝐴 (𝑢 ∈ Univ ∧ 𝑥 ∈ 𝑢) ↔ (∀𝑢 ∈ 𝐴 𝑢 ∈ Univ ∧ ∀𝑢 ∈ 𝐴 𝑥 ∈ 𝑢))
22		grupr 10208	. . . . . . . . . . . 12 ⊢ ((𝑢 ∈ Univ ∧ 𝑥 ∈ 𝑢 ∧ 𝑦 ∈ 𝑢) → {𝑥, 𝑦} ∈ 𝑢)
23	22	3expia 1118	. . . . . . . . . . 11 ⊢ ((𝑢 ∈ Univ ∧ 𝑥 ∈ 𝑢) → (𝑦 ∈ 𝑢 → {𝑥, 𝑦} ∈ 𝑢))
24	23	ral2imi 3124	. . . . . . . . . 10 ⊢ (∀𝑢 ∈ 𝐴 (𝑢 ∈ Univ ∧ 𝑥 ∈ 𝑢) → (∀𝑢 ∈ 𝐴 𝑦 ∈ 𝑢 → ∀𝑢 ∈ 𝐴 {𝑥, 𝑦} ∈ 𝑢))
25	21, 24	sylbir 238	. . . . . . . . 9 ⊢ ((∀𝑢 ∈ 𝐴 𝑢 ∈ Univ ∧ ∀𝑢 ∈ 𝐴 𝑥 ∈ 𝑢) → (∀𝑢 ∈ 𝐴 𝑦 ∈ 𝑢 → ∀𝑢 ∈ 𝐴 {𝑥, 𝑦} ∈ 𝑢))
26		vex 3444	. . . . . . . . . 10 ⊢ 𝑦 ∈ V
27	26	elint2 4845	. . . . . . . . 9 ⊢ (𝑦 ∈ ∩ 𝐴 ↔ ∀𝑢 ∈ 𝐴 𝑦 ∈ 𝑢)
28		prex 5298	. . . . . . . . . 10 ⊢ {𝑥, 𝑦} ∈ V
29	28	elint2 4845	. . . . . . . . 9 ⊢ ({𝑥, 𝑦} ∈ ∩ 𝐴 ↔ ∀𝑢 ∈ 𝐴 {𝑥, 𝑦} ∈ 𝑢)
30	25, 27, 29	3imtr4g 299	. . . . . . . 8 ⊢ ((∀𝑢 ∈ 𝐴 𝑢 ∈ Univ ∧ ∀𝑢 ∈ 𝐴 𝑥 ∈ 𝑢) → (𝑦 ∈ ∩ 𝐴 → {𝑥, 𝑦} ∈ ∩ 𝐴))
31	15, 30	sylan2b 596	. . . . . . 7 ⊢ ((∀𝑢 ∈ 𝐴 𝑢 ∈ Univ ∧ 𝑥 ∈ ∩ 𝐴) → (𝑦 ∈ ∩ 𝐴 → {𝑥, 𝑦} ∈ ∩ 𝐴))
32	31	ralrimiv 3148	. . . . . 6 ⊢ ((∀𝑢 ∈ 𝐴 𝑢 ∈ Univ ∧ 𝑥 ∈ ∩ 𝐴) → ∀𝑦 ∈ ∩ 𝐴{𝑥, 𝑦} ∈ ∩ 𝐴)
33	32	adantlr 714	. . . . 5 ⊢ (((∀𝑢 ∈ 𝐴 𝑢 ∈ Univ ∧ 𝐴 ≠ ∅) ∧ 𝑥 ∈ ∩ 𝐴) → ∀𝑦 ∈ ∩ 𝐴{𝑥, 𝑦} ∈ ∩ 𝐴)
34		elmapg 8402	. . . . . . . . . 10 ⊢ ((∩ 𝐴 ∈ V ∧ 𝑥 ∈ V) → (𝑦 ∈ (∩ 𝐴 ↑m 𝑥) ↔ 𝑦:𝑥⟶∩ 𝐴))
35	34	elvd 3447	. . . . . . . . 9 ⊢ (∩ 𝐴 ∈ V → (𝑦 ∈ (∩ 𝐴 ↑m 𝑥) ↔ 𝑦:𝑥⟶∩ 𝐴))
36	2, 35	sylbi 220	. . . . . . . 8 ⊢ (𝐴 ≠ ∅ → (𝑦 ∈ (∩ 𝐴 ↑m 𝑥) ↔ 𝑦:𝑥⟶∩ 𝐴))
37	36	ad2antlr 726	. . . . . . 7 ⊢ (((∀𝑢 ∈ 𝐴 𝑢 ∈ Univ ∧ 𝐴 ≠ ∅) ∧ 𝑥 ∈ ∩ 𝐴) → (𝑦 ∈ (∩ 𝐴 ↑m 𝑥) ↔ 𝑦:𝑥⟶∩ 𝐴))
38		intss1 4853	. . . . . . . . . . . 12 ⊢ (𝑢 ∈ 𝐴 → ∩ 𝐴 ⊆ 𝑢)
39		fss 6501	. . . . . . . . . . . 12 ⊢ ((𝑦:𝑥⟶∩ 𝐴 ∧ ∩ 𝐴 ⊆ 𝑢) → 𝑦:𝑥⟶𝑢)
40	38, 39	sylan2 595	. . . . . . . . . . 11 ⊢ ((𝑦:𝑥⟶∩ 𝐴 ∧ 𝑢 ∈ 𝐴) → 𝑦:𝑥⟶𝑢)
41	40	ralrimiva 3149	. . . . . . . . . 10 ⊢ (𝑦:𝑥⟶∩ 𝐴 → ∀𝑢 ∈ 𝐴 𝑦:𝑥⟶𝑢)
42		gruurn 10209	. . . . . . . . . . . . . 14 ⊢ ((𝑢 ∈ Univ ∧ 𝑥 ∈ 𝑢 ∧ 𝑦:𝑥⟶𝑢) → ∪ ran 𝑦 ∈ 𝑢)
43	42	3expia 1118	. . . . . . . . . . . . 13 ⊢ ((𝑢 ∈ Univ ∧ 𝑥 ∈ 𝑢) → (𝑦:𝑥⟶𝑢 → ∪ ran 𝑦 ∈ 𝑢))
44	43	ral2imi 3124	. . . . . . . . . . . 12 ⊢ (∀𝑢 ∈ 𝐴 (𝑢 ∈ Univ ∧ 𝑥 ∈ 𝑢) → (∀𝑢 ∈ 𝐴 𝑦:𝑥⟶𝑢 → ∀𝑢 ∈ 𝐴 ∪ ran 𝑦 ∈ 𝑢))
45	21, 44	sylbir 238	. . . . . . . . . . 11 ⊢ ((∀𝑢 ∈ 𝐴 𝑢 ∈ Univ ∧ ∀𝑢 ∈ 𝐴 𝑥 ∈ 𝑢) → (∀𝑢 ∈ 𝐴 𝑦:𝑥⟶𝑢 → ∀𝑢 ∈ 𝐴 ∪ ran 𝑦 ∈ 𝑢))
46	15, 45	sylan2b 596	. . . . . . . . . 10 ⊢ ((∀𝑢 ∈ 𝐴 𝑢 ∈ Univ ∧ 𝑥 ∈ ∩ 𝐴) → (∀𝑢 ∈ 𝐴 𝑦:𝑥⟶𝑢 → ∀𝑢 ∈ 𝐴 ∪ ran 𝑦 ∈ 𝑢))
47	41, 46	syl5 34	. . . . . . . . 9 ⊢ ((∀𝑢 ∈ 𝐴 𝑢 ∈ Univ ∧ 𝑥 ∈ ∩ 𝐴) → (𝑦:𝑥⟶∩ 𝐴 → ∀𝑢 ∈ 𝐴 ∪ ran 𝑦 ∈ 𝑢))
48	26	rnex 7599	. . . . . . . . . . 11 ⊢ ran 𝑦 ∈ V
49	48	uniex 7447	. . . . . . . . . 10 ⊢ ∪ ran 𝑦 ∈ V
50	49	elint2 4845	. . . . . . . . 9 ⊢ (∪ ran 𝑦 ∈ ∩ 𝐴 ↔ ∀𝑢 ∈ 𝐴 ∪ ran 𝑦 ∈ 𝑢)
51	47, 50	syl6ibr 255	. . . . . . . 8 ⊢ ((∀𝑢 ∈ 𝐴 𝑢 ∈ Univ ∧ 𝑥 ∈ ∩ 𝐴) → (𝑦:𝑥⟶∩ 𝐴 → ∪ ran 𝑦 ∈ ∩ 𝐴))
52	51	adantlr 714	. . . . . . 7 ⊢ (((∀𝑢 ∈ 𝐴 𝑢 ∈ Univ ∧ 𝐴 ≠ ∅) ∧ 𝑥 ∈ ∩ 𝐴) → (𝑦:𝑥⟶∩ 𝐴 → ∪ ran 𝑦 ∈ ∩ 𝐴))
53	37, 52	sylbid 243	. . . . . 6 ⊢ (((∀𝑢 ∈ 𝐴 𝑢 ∈ Univ ∧ 𝐴 ≠ ∅) ∧ 𝑥 ∈ ∩ 𝐴) → (𝑦 ∈ (∩ 𝐴 ↑m 𝑥) → ∪ ran 𝑦 ∈ ∩ 𝐴))
54	53	ralrimiv 3148	. . . . 5 ⊢ (((∀𝑢 ∈ 𝐴 𝑢 ∈ Univ ∧ 𝐴 ≠ ∅) ∧ 𝑥 ∈ ∩ 𝐴) → ∀𝑦 ∈ (∩ 𝐴 ↑m 𝑥)∪ ran 𝑦 ∈ ∩ 𝐴)
55	20, 33, 54	3jca 1125	. . . 4 ⊢ (((∀𝑢 ∈ 𝐴 𝑢 ∈ Univ ∧ 𝐴 ≠ ∅) ∧ 𝑥 ∈ ∩ 𝐴) → (𝒫 𝑥 ∈ ∩ 𝐴 ∧ ∀𝑦 ∈ ∩ 𝐴{𝑥, 𝑦} ∈ ∩ 𝐴 ∧ ∀𝑦 ∈ (∩ 𝐴 ↑m 𝑥)∪ ran 𝑦 ∈ ∩ 𝐴))
56	55	ralrimiva 3149	. . 3 ⊢ ((∀𝑢 ∈ 𝐴 𝑢 ∈ Univ ∧ 𝐴 ≠ ∅) → ∀𝑥 ∈ ∩ 𝐴(𝒫 𝑥 ∈ ∩ 𝐴 ∧ ∀𝑦 ∈ ∩ 𝐴{𝑥, 𝑦} ∈ ∩ 𝐴 ∧ ∀𝑦 ∈ (∩ 𝐴 ↑m 𝑥)∪ ran 𝑦 ∈ ∩ 𝐴))
57	4, 56	sylanb 584	. 2 ⊢ ((𝐴 ⊆ Univ ∧ 𝐴 ≠ ∅) → ∀𝑥 ∈ ∩ 𝐴(𝒫 𝑥 ∈ ∩ 𝐴 ∧ ∀𝑦 ∈ ∩ 𝐴{𝑥, 𝑦} ∈ ∩ 𝐴 ∧ ∀𝑦 ∈ (∩ 𝐴 ↑m 𝑥)∪ ran 𝑦 ∈ ∩ 𝐴))
58		elgrug 10203	. . 3 ⊢ (∩ 𝐴 ∈ V → (∩ 𝐴 ∈ Univ ↔ (Tr ∩ 𝐴 ∧ ∀𝑥 ∈ ∩ 𝐴(𝒫 𝑥 ∈ ∩ 𝐴 ∧ ∀𝑦 ∈ ∩ 𝐴{𝑥, 𝑦} ∈ ∩ 𝐴 ∧ ∀𝑦 ∈ (∩ 𝐴 ↑m 𝑥)∪ ran 𝑦 ∈ ∩ 𝐴))))
59	58	biimpar 481	. 2 ⊢ ((∩ 𝐴 ∈ V ∧ (Tr ∩ 𝐴 ∧ ∀𝑥 ∈ ∩ 𝐴(𝒫 𝑥 ∈ ∩ 𝐴 ∧ ∀𝑦 ∈ ∩ 𝐴{𝑥, 𝑦} ∈ ∩ 𝐴 ∧ ∀𝑦 ∈ (∩ 𝐴 ↑m 𝑥)∪ ran 𝑦 ∈ ∩ 𝐴))) → ∩ 𝐴 ∈ Univ)
60	3, 10, 57, 59	syl12anc 835	1 ⊢ ((𝐴 ⊆ Univ ∧ 𝐴 ≠ ∅) → ∩ 𝐴 ∈ Univ)

Syntax hints:   → wi 4   ↔ wb 209   ∧ wa 399   ∧ w3a 1084   ∈ wcel 2111   ≠ wne 2987  ∀wral 3106  Vcvv 3441   ⊆ wss 3881  ∅c0 4243  𝒫 cpw 4497  {cpr 4527  ∪ cuni 4800  ∩ cint 4838  Tr wtr 5136  ran crn 5520  ⟶wf 6320  (class class class)co 7135   ↑_m cmap 8389  Univcgru 10201

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 2113  ax-9 2121  ax-10 2142  ax-11 2158  ax-12 2175  ax-ext 2770  ax-sep 5167  ax-nul 5174  ax-pow 5231  ax-pr 5295  ax-un 7441

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-mo 2598  df-eu 2629  df-clab 2777  df-cleq 2791  df-clel 2870  df-nfc 2938  df-ne 2988  df-ral 3111  df-rex 3112  df-rab 3115  df-v 3443  df-sbc 3721  df-dif 3884  df-un 3886  df-in 3888  df-ss 3898  df-nul 4244  df-if 4426  df-pw 4499  df-sn 4526  df-pr 4528  df-op 4532  df-uni 4801  df-int 4839  df-iin 4884  df-br 5031  df-opab 5093  df-tr 5137  df-id 5425  df-xp 5525  df-rel 5526  df-cnv 5527  df-co 5528  df-dm 5529  df-rn 5530  df-iota 6283  df-fun 6326  df-fn 6327  df-f 6328  df-fv 6332  df-ov 7138  df-oprab 7139  df-mpo 7140  df-map 8391  df-gru 10202

This theorem is referenced by: (None)