Theorem intgru 9951

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 479	. . 3 ⊢ ((𝐴 ⊆ Univ ∧ 𝐴 ≠ ∅) → 𝐴 ≠ ∅)
2		intex 5042	. . 3 ⊢ (𝐴 ≠ ∅ ↔ ∩ 𝐴 ∈ V)
3	1, 2	sylib 210	. 2 ⊢ ((𝐴 ⊆ Univ ∧ 𝐴 ≠ ∅) → ∩ 𝐴 ∈ V)
4		dfss3 3816	. . . . 5 ⊢ (𝐴 ⊆ Univ ↔ ∀𝑢 ∈ 𝐴 𝑢 ∈ Univ)
5		grutr 9930	. . . . . 6 ⊢ (𝑢 ∈ Univ → Tr 𝑢)
6	5	ralimi 3161	. . . . 5 ⊢ (∀𝑢 ∈ 𝐴 𝑢 ∈ Univ → ∀𝑢 ∈ 𝐴 Tr 𝑢)
7	4, 6	sylbi 209	. . . 4 ⊢ (𝐴 ⊆ Univ → ∀𝑢 ∈ 𝐴 Tr 𝑢)
8		trint 4991	. . . 4 ⊢ (∀𝑢 ∈ 𝐴 Tr 𝑢 → Tr ∩ 𝐴)
9	7, 8	syl 17	. . 3 ⊢ (𝐴 ⊆ Univ → Tr ∩ 𝐴)
10	9	adantr 474	. 2 ⊢ ((𝐴 ⊆ Univ ∧ 𝐴 ≠ ∅) → Tr ∩ 𝐴)
11		grupw 9932	. . . . . . . . . 10 ⊢ ((𝑢 ∈ Univ ∧ 𝑥 ∈ 𝑢) → 𝒫 𝑥 ∈ 𝑢)
12	11	ex 403	. . . . . . . . 9 ⊢ (𝑢 ∈ Univ → (𝑥 ∈ 𝑢 → 𝒫 𝑥 ∈ 𝑢))
13	12	ral2imi 3156	. . . . . . . 8 ⊢ (∀𝑢 ∈ 𝐴 𝑢 ∈ Univ → (∀𝑢 ∈ 𝐴 𝑥 ∈ 𝑢 → ∀𝑢 ∈ 𝐴 𝒫 𝑥 ∈ 𝑢))
14		vex 3417	. . . . . . . . 9 ⊢ 𝑥 ∈ V
15	14	elint2 4704	. . . . . . . 8 ⊢ (𝑥 ∈ ∩ 𝐴 ↔ ∀𝑢 ∈ 𝐴 𝑥 ∈ 𝑢)
16		vpwex 5077	. . . . . . . . 9 ⊢ 𝒫 𝑥 ∈ V
17	16	elint2 4704	. . . . . . . 8 ⊢ (𝒫 𝑥 ∈ ∩ 𝐴 ↔ ∀𝑢 ∈ 𝐴 𝒫 𝑥 ∈ 𝑢)
18	13, 15, 17	3imtr4g 288	. . . . . . 7 ⊢ (∀𝑢 ∈ 𝐴 𝑢 ∈ Univ → (𝑥 ∈ ∩ 𝐴 → 𝒫 𝑥 ∈ ∩ 𝐴))
19	18	imp 397	. . . . . 6 ⊢ ((∀𝑢 ∈ 𝐴 𝑢 ∈ Univ ∧ 𝑥 ∈ ∩ 𝐴) → 𝒫 𝑥 ∈ ∩ 𝐴)
20	19	adantlr 708	. . . . 5 ⊢ (((∀𝑢 ∈ 𝐴 𝑢 ∈ Univ ∧ 𝐴 ≠ ∅) ∧ 𝑥 ∈ ∩ 𝐴) → 𝒫 𝑥 ∈ ∩ 𝐴)
21		r19.26 3274	. . . . . . . . . 10 ⊢ (∀𝑢 ∈ 𝐴 (𝑢 ∈ Univ ∧ 𝑥 ∈ 𝑢) ↔ (∀𝑢 ∈ 𝐴 𝑢 ∈ Univ ∧ ∀𝑢 ∈ 𝐴 𝑥 ∈ 𝑢))
22		grupr 9934	. . . . . . . . . . . 12 ⊢ ((𝑢 ∈ Univ ∧ 𝑥 ∈ 𝑢 ∧ 𝑦 ∈ 𝑢) → {𝑥, 𝑦} ∈ 𝑢)
23	22	3expia 1156	. . . . . . . . . . 11 ⊢ ((𝑢 ∈ Univ ∧ 𝑥 ∈ 𝑢) → (𝑦 ∈ 𝑢 → {𝑥, 𝑦} ∈ 𝑢))
24	23	ral2imi 3156	. . . . . . . . . 10 ⊢ (∀𝑢 ∈ 𝐴 (𝑢 ∈ Univ ∧ 𝑥 ∈ 𝑢) → (∀𝑢 ∈ 𝐴 𝑦 ∈ 𝑢 → ∀𝑢 ∈ 𝐴 {𝑥, 𝑦} ∈ 𝑢))
25	21, 24	sylbir 227	. . . . . . . . 9 ⊢ ((∀𝑢 ∈ 𝐴 𝑢 ∈ Univ ∧ ∀𝑢 ∈ 𝐴 𝑥 ∈ 𝑢) → (∀𝑢 ∈ 𝐴 𝑦 ∈ 𝑢 → ∀𝑢 ∈ 𝐴 {𝑥, 𝑦} ∈ 𝑢))
26		vex 3417	. . . . . . . . . 10 ⊢ 𝑦 ∈ V
27	26	elint2 4704	. . . . . . . . 9 ⊢ (𝑦 ∈ ∩ 𝐴 ↔ ∀𝑢 ∈ 𝐴 𝑦 ∈ 𝑢)
28		prex 5130	. . . . . . . . . 10 ⊢ {𝑥, 𝑦} ∈ V
29	28	elint2 4704	. . . . . . . . 9 ⊢ ({𝑥, 𝑦} ∈ ∩ 𝐴 ↔ ∀𝑢 ∈ 𝐴 {𝑥, 𝑦} ∈ 𝑢)
30	25, 27, 29	3imtr4g 288	. . . . . . . 8 ⊢ ((∀𝑢 ∈ 𝐴 𝑢 ∈ Univ ∧ ∀𝑢 ∈ 𝐴 𝑥 ∈ 𝑢) → (𝑦 ∈ ∩ 𝐴 → {𝑥, 𝑦} ∈ ∩ 𝐴))
31	15, 30	sylan2b 589	. . . . . . 7 ⊢ ((∀𝑢 ∈ 𝐴 𝑢 ∈ Univ ∧ 𝑥 ∈ ∩ 𝐴) → (𝑦 ∈ ∩ 𝐴 → {𝑥, 𝑦} ∈ ∩ 𝐴))
32	31	ralrimiv 3174	. . . . . 6 ⊢ ((∀𝑢 ∈ 𝐴 𝑢 ∈ Univ ∧ 𝑥 ∈ ∩ 𝐴) → ∀𝑦 ∈ ∩ 𝐴{𝑥, 𝑦} ∈ ∩ 𝐴)
33	32	adantlr 708	. . . . 5 ⊢ (((∀𝑢 ∈ 𝐴 𝑢 ∈ Univ ∧ 𝐴 ≠ ∅) ∧ 𝑥 ∈ ∩ 𝐴) → ∀𝑦 ∈ ∩ 𝐴{𝑥, 𝑦} ∈ ∩ 𝐴)
34		elmapg 8135	. . . . . . . . . 10 ⊢ ((∩ 𝐴 ∈ V ∧ 𝑥 ∈ V) → (𝑦 ∈ (∩ 𝐴 ↑𝑚 𝑥) ↔ 𝑦:𝑥⟶∩ 𝐴))
35	34	elvd 3419	. . . . . . . . 9 ⊢ (∩ 𝐴 ∈ V → (𝑦 ∈ (∩ 𝐴 ↑𝑚 𝑥) ↔ 𝑦:𝑥⟶∩ 𝐴))
36	2, 35	sylbi 209	. . . . . . . 8 ⊢ (𝐴 ≠ ∅ → (𝑦 ∈ (∩ 𝐴 ↑𝑚 𝑥) ↔ 𝑦:𝑥⟶∩ 𝐴))
37	36	ad2antlr 720	. . . . . . 7 ⊢ (((∀𝑢 ∈ 𝐴 𝑢 ∈ Univ ∧ 𝐴 ≠ ∅) ∧ 𝑥 ∈ ∩ 𝐴) → (𝑦 ∈ (∩ 𝐴 ↑𝑚 𝑥) ↔ 𝑦:𝑥⟶∩ 𝐴))
38		intss1 4712	. . . . . . . . . . . 12 ⊢ (𝑢 ∈ 𝐴 → ∩ 𝐴 ⊆ 𝑢)
39		fss 6291	. . . . . . . . . . . 12 ⊢ ((𝑦:𝑥⟶∩ 𝐴 ∧ ∩ 𝐴 ⊆ 𝑢) → 𝑦:𝑥⟶𝑢)
40	38, 39	sylan2 588	. . . . . . . . . . 11 ⊢ ((𝑦:𝑥⟶∩ 𝐴 ∧ 𝑢 ∈ 𝐴) → 𝑦:𝑥⟶𝑢)
41	40	ralrimiva 3175	. . . . . . . . . 10 ⊢ (𝑦:𝑥⟶∩ 𝐴 → ∀𝑢 ∈ 𝐴 𝑦:𝑥⟶𝑢)
42		gruurn 9935	. . . . . . . . . . . . . 14 ⊢ ((𝑢 ∈ Univ ∧ 𝑥 ∈ 𝑢 ∧ 𝑦:𝑥⟶𝑢) → ∪ ran 𝑦 ∈ 𝑢)
43	42	3expia 1156	. . . . . . . . . . . . 13 ⊢ ((𝑢 ∈ Univ ∧ 𝑥 ∈ 𝑢) → (𝑦:𝑥⟶𝑢 → ∪ ran 𝑦 ∈ 𝑢))
44	43	ral2imi 3156	. . . . . . . . . . . 12 ⊢ (∀𝑢 ∈ 𝐴 (𝑢 ∈ Univ ∧ 𝑥 ∈ 𝑢) → (∀𝑢 ∈ 𝐴 𝑦:𝑥⟶𝑢 → ∀𝑢 ∈ 𝐴 ∪ ran 𝑦 ∈ 𝑢))
45	21, 44	sylbir 227	. . . . . . . . . . 11 ⊢ ((∀𝑢 ∈ 𝐴 𝑢 ∈ Univ ∧ ∀𝑢 ∈ 𝐴 𝑥 ∈ 𝑢) → (∀𝑢 ∈ 𝐴 𝑦:𝑥⟶𝑢 → ∀𝑢 ∈ 𝐴 ∪ ran 𝑦 ∈ 𝑢))
46	15, 45	sylan2b 589	. . . . . . . . . 10 ⊢ ((∀𝑢 ∈ 𝐴 𝑢 ∈ Univ ∧ 𝑥 ∈ ∩ 𝐴) → (∀𝑢 ∈ 𝐴 𝑦:𝑥⟶𝑢 → ∀𝑢 ∈ 𝐴 ∪ ran 𝑦 ∈ 𝑢))
47	41, 46	syl5 34	. . . . . . . . 9 ⊢ ((∀𝑢 ∈ 𝐴 𝑢 ∈ Univ ∧ 𝑥 ∈ ∩ 𝐴) → (𝑦:𝑥⟶∩ 𝐴 → ∀𝑢 ∈ 𝐴 ∪ ran 𝑦 ∈ 𝑢))
48	26	rnex 7362	. . . . . . . . . . 11 ⊢ ran 𝑦 ∈ V
49	48	uniex 7213	. . . . . . . . . 10 ⊢ ∪ ran 𝑦 ∈ V
50	49	elint2 4704	. . . . . . . . 9 ⊢ (∪ ran 𝑦 ∈ ∩ 𝐴 ↔ ∀𝑢 ∈ 𝐴 ∪ ran 𝑦 ∈ 𝑢)
51	47, 50	syl6ibr 244	. . . . . . . 8 ⊢ ((∀𝑢 ∈ 𝐴 𝑢 ∈ Univ ∧ 𝑥 ∈ ∩ 𝐴) → (𝑦:𝑥⟶∩ 𝐴 → ∪ ran 𝑦 ∈ ∩ 𝐴))
52	51	adantlr 708	. . . . . . 7 ⊢ (((∀𝑢 ∈ 𝐴 𝑢 ∈ Univ ∧ 𝐴 ≠ ∅) ∧ 𝑥 ∈ ∩ 𝐴) → (𝑦:𝑥⟶∩ 𝐴 → ∪ ran 𝑦 ∈ ∩ 𝐴))
53	37, 52	sylbid 232	. . . . . 6 ⊢ (((∀𝑢 ∈ 𝐴 𝑢 ∈ Univ ∧ 𝐴 ≠ ∅) ∧ 𝑥 ∈ ∩ 𝐴) → (𝑦 ∈ (∩ 𝐴 ↑𝑚 𝑥) → ∪ ran 𝑦 ∈ ∩ 𝐴))
54	53	ralrimiv 3174	. . . . 5 ⊢ (((∀𝑢 ∈ 𝐴 𝑢 ∈ Univ ∧ 𝐴 ≠ ∅) ∧ 𝑥 ∈ ∩ 𝐴) → ∀𝑦 ∈ (∩ 𝐴 ↑𝑚 𝑥)∪ ran 𝑦 ∈ ∩ 𝐴)
55	20, 33, 54	3jca 1164	. . . 4 ⊢ (((∀𝑢 ∈ 𝐴 𝑢 ∈ Univ ∧ 𝐴 ≠ ∅) ∧ 𝑥 ∈ ∩ 𝐴) → (𝒫 𝑥 ∈ ∩ 𝐴 ∧ ∀𝑦 ∈ ∩ 𝐴{𝑥, 𝑦} ∈ ∩ 𝐴 ∧ ∀𝑦 ∈ (∩ 𝐴 ↑𝑚 𝑥)∪ ran 𝑦 ∈ ∩ 𝐴))
56	55	ralrimiva 3175	. . 3 ⊢ ((∀𝑢 ∈ 𝐴 𝑢 ∈ Univ ∧ 𝐴 ≠ ∅) → ∀𝑥 ∈ ∩ 𝐴(𝒫 𝑥 ∈ ∩ 𝐴 ∧ ∀𝑦 ∈ ∩ 𝐴{𝑥, 𝑦} ∈ ∩ 𝐴 ∧ ∀𝑦 ∈ (∩ 𝐴 ↑𝑚 𝑥)∪ ran 𝑦 ∈ ∩ 𝐴))
57	4, 56	sylanb 578	. 2 ⊢ ((𝐴 ⊆ Univ ∧ 𝐴 ≠ ∅) → ∀𝑥 ∈ ∩ 𝐴(𝒫 𝑥 ∈ ∩ 𝐴 ∧ ∀𝑦 ∈ ∩ 𝐴{𝑥, 𝑦} ∈ ∩ 𝐴 ∧ ∀𝑦 ∈ (∩ 𝐴 ↑𝑚 𝑥)∪ ran 𝑦 ∈ ∩ 𝐴))
58		elgrug 9929	. . 3 ⊢ (∩ 𝐴 ∈ V → (∩ 𝐴 ∈ Univ ↔ (Tr ∩ 𝐴 ∧ ∀𝑥 ∈ ∩ 𝐴(𝒫 𝑥 ∈ ∩ 𝐴 ∧ ∀𝑦 ∈ ∩ 𝐴{𝑥, 𝑦} ∈ ∩ 𝐴 ∧ ∀𝑦 ∈ (∩ 𝐴 ↑𝑚 𝑥)∪ ran 𝑦 ∈ ∩ 𝐴))))
59	58	biimpar 471	. 2 ⊢ ((∩ 𝐴 ∈ V ∧ (Tr ∩ 𝐴 ∧ ∀𝑥 ∈ ∩ 𝐴(𝒫 𝑥 ∈ ∩ 𝐴 ∧ ∀𝑦 ∈ ∩ 𝐴{𝑥, 𝑦} ∈ ∩ 𝐴 ∧ ∀𝑦 ∈ (∩ 𝐴 ↑𝑚 𝑥)∪ ran 𝑦 ∈ ∩ 𝐴))) → ∩ 𝐴 ∈ Univ)
60	3, 10, 57, 59	syl12anc 872	1 ⊢ ((𝐴 ⊆ Univ ∧ 𝐴 ≠ ∅) → ∩ 𝐴 ∈ Univ)

Syntax hints:   → wi 4   ↔ wb 198   ∧ wa 386   ∧ w3a 1113   ∈ wcel 2166   ≠ wne 2999  ∀wral 3117  Vcvv 3414   ⊆ wss 3798  ∅c0 4144  𝒫 cpw 4378  {cpr 4399  ∪ cuni 4658  ∩ cint 4697  Tr wtr 4975  ran crn 5343  ⟶wf 6119  (class class class)co 6905   ↑_𝑚 cmap 8122  Univcgru 9927

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1896  ax-4 1910  ax-5 2011  ax-6 2077  ax-7 2114  ax-8 2168  ax-9 2175  ax-10 2194  ax-11 2209  ax-12 2222  ax-13 2391  ax-ext 2803  ax-sep 5005  ax-nul 5013  ax-pow 5065  ax-pr 5127  ax-un 7209

This theorem depends on definitions:  df-bi 199  df-an 387  df-or 881  df-3an 1115  df-tru 1662  df-ex 1881  df-nf 1885  df-sb 2070  df-mo 2605  df-eu 2640  df-clab 2812  df-cleq 2818  df-clel 2821  df-nfc 2958  df-ne 3000  df-ral 3122  df-rex 3123  df-rab 3126  df-v 3416  df-sbc 3663  df-dif 3801  df-un 3803  df-in 3805  df-ss 3812  df-nul 4145  df-if 4307  df-pw 4380  df-sn 4398  df-pr 4400  df-op 4404  df-uni 4659  df-int 4698  df-iin 4743  df-br 4874  df-opab 4936  df-tr 4976  df-id 5250  df-xp 5348  df-rel 5349  df-cnv 5350  df-co 5351  df-dm 5352  df-rn 5353  df-iota 6086  df-fun 6125  df-fn 6126  df-f 6127  df-fv 6131  df-ov 6908  df-oprab 6909  df-mpt2 6910  df-map 8124  df-gru 9928

This theorem is referenced by: (None)