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

Theorem intgru 10892
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.
StepHypRef Expression
1 intex 5305 . . 3 (𝐴 ≠ ∅ ↔ ∩ 𝐴 ∈ V)
21bilani 510 . 2 ((𝐴 ⊆ Univ ∧ 𝐴 ≠ ∅) → ∩ 𝐴 ∈ V)
3 dfss3 3920 . . . . 5 (𝐴 ⊆ Univ ↔ ∀𝑢 ∈ 𝐴 𝑢 ∈ Univ)
4 grutr 10871 . . . . . 6 (𝑢 ∈ Univ → Tr 𝑢)
54ralimi 3100 . . . . 5 (∀𝑢 ∈ 𝐴 𝑢 ∈ Univ → ∀𝑢 ∈ 𝐴 Tr 𝑢)
63, 5sylbi 220 . . . 4 (𝐴 ⊆ Univ → ∀𝑢 ∈ 𝐴 Tr 𝑢)
7 trint 5230 . . . 4 (∀𝑢 ∈ 𝐴 Tr 𝑢 → Tr ∩ 𝐴)
86, 7syl 18 . . 3 (𝐴 ⊆ Univ → Tr ∩ 𝐴)
98adantr 486 . 2 ((𝐴 ⊆ Univ ∧ 𝐴 ≠ ∅) → Tr ∩ 𝐴)
10 grupw 10873 . . . . . . . . . 10 ((𝑢 ∈ Univ ∧ 𝑥 ∈ 𝑢) → 𝒫 𝑥 ∈ 𝑢)
1110ex 418 . . . . . . . . 9 (𝑢 ∈ Univ → (𝑥 ∈ 𝑢 → 𝒫 𝑥 ∈ 𝑢))
1211ral2imi 3102 . . . . . . . 8 (∀𝑢 ∈ 𝐴 𝑢 ∈ Univ → (∀𝑢 ∈ 𝐴 𝑥 ∈ 𝑢 → ∀𝑢 ∈ 𝐴 𝒫 𝑥 ∈ 𝑢))
13 vex 3455 . . . . . . . . 9 𝑥 ∈ V
1413elint2 4914 . . . . . . . 8 (𝑥 ∈ ∩ 𝐴 ↔ ∀𝑢 ∈ 𝐴 𝑥 ∈ 𝑢)
15 vpwex 5339 . . . . . . . . 9 𝒫 𝑥 ∈ V
1615elint2 4914 . . . . . . . 8 (𝒫 𝑥 ∈ ∩ 𝐴 ↔ ∀𝑢 ∈ 𝐴 𝒫 𝑥 ∈ 𝑢)
1712, 14, 163imtr4g 299 . . . . . . 7 (∀𝑢 ∈ 𝐴 𝑢 ∈ Univ → (𝑥 ∈ ∩ 𝐴 → 𝒫 𝑥 ∈ ∩ 𝐴))
1817imp 412 . . . . . 6 ((∀𝑢 ∈ 𝐴 𝑢 ∈ Univ ∧ 𝑥 ∈ ∩ 𝐴) → 𝒫 𝑥 ∈ ∩ 𝐴)
1918adantlr 728 . . . . 5 (((∀𝑢 ∈ 𝐴 𝑢 ∈ Univ ∧ 𝐴 ≠ ∅) ∧ 𝑥 ∈ ∩ 𝐴) → 𝒫 𝑥 ∈ ∩ 𝐴)
20 r19.26 3123 . . . . . . . . . 10 (∀𝑢 ∈ 𝐴 (𝑢 ∈ Univ ∧ 𝑥 ∈ 𝑢) ↔ (∀𝑢 ∈ 𝐴 𝑢 ∈ Univ ∧ ∀𝑢 ∈ 𝐴 𝑥 ∈ 𝑢))
21 grupr 10875 . . . . . . . . . . . 12 ((𝑢 ∈ Univ ∧ 𝑥 ∈ 𝑢 ∧ 𝑦 ∈ 𝑢) → {𝑥, 𝑦} ∈ 𝑢)
22213expia 1139 . . . . . . . . . . 11 ((𝑢 ∈ Univ ∧ 𝑥 ∈ 𝑢) → (𝑦 ∈ 𝑢 → {𝑥, 𝑦} ∈ 𝑢))
2322ral2imi 3102 . . . . . . . . . 10 (∀𝑢 ∈ 𝐴 (𝑢 ∈ Univ ∧ 𝑥 ∈ 𝑢) → (∀𝑢 ∈ 𝐴 𝑦 ∈ 𝑢 → ∀𝑢 ∈ 𝐴 {𝑥, 𝑦} ∈ 𝑢))
2420, 23sylbir 238 . . . . . . . . 9 ((∀𝑢 ∈ 𝐴 𝑢 ∈ Univ ∧ ∀𝑢 ∈ 𝐴 𝑥 ∈ 𝑢) → (∀𝑢 ∈ 𝐴 𝑦 ∈ 𝑢 → ∀𝑢 ∈ 𝐴 {𝑥, 𝑦} ∈ 𝑢))
25 vex 3455 . . . . . . . . . 10 𝑦 ∈ V
2625elint2 4914 . . . . . . . . 9 (𝑦 ∈ ∩ 𝐴 ↔ ∀𝑢 ∈ 𝐴 𝑦 ∈ 𝑢)
27 prex 5396 . . . . . . . . . 10 {𝑥, 𝑦} ∈ V
2827elint2 4914 . . . . . . . . 9 ({𝑥, 𝑦} ∈ ∩ 𝐴 ↔ ∀𝑢 ∈ 𝐴 {𝑥, 𝑦} ∈ 𝑢)
2924, 26, 283imtr4g 299 . . . . . . . 8 ((∀𝑢 ∈ 𝐴 𝑢 ∈ Univ ∧ ∀𝑢 ∈ 𝐴 𝑥 ∈ 𝑢) → (𝑦 ∈ ∩ 𝐴 → {𝑥, 𝑦} ∈ ∩ 𝐴))
3014, 29sylan2b 606 . . . . . . 7 ((∀𝑢 ∈ 𝐴 𝑢 ∈ Univ ∧ 𝑥 ∈ ∩ 𝐴) → (𝑦 ∈ ∩ 𝐴 → {𝑥, 𝑦} ∈ ∩ 𝐴))
3130ralrimiv 3154 . . . . . 6 ((∀𝑢 ∈ 𝐴 𝑢 ∈ Univ ∧ 𝑥 ∈ ∩ 𝐴) → ∀𝑦 ∈ ∩ 𝐴{𝑥, 𝑦} ∈ ∩ 𝐴)
3231adantlr 728 . . . . 5 (((∀𝑢 ∈ 𝐴 𝑢 ∈ Univ ∧ 𝐴 ≠ ∅) ∧ 𝑥 ∈ ∩ 𝐴) → ∀𝑦 ∈ ∩ 𝐴{𝑥, 𝑦} ∈ ∩ 𝐴)
33 elmapg 8852 . . . . . . . . . 10 ((∩ 𝐴 ∈ V ∧ 𝑥 ∈ V) → (𝑦 ∈ (∩ 𝐴 ↑m 𝑥) ↔ 𝑦:𝑥⟶∩ 𝐴))
3433elvd 3457 . . . . . . . . 9 (∩ 𝐴 ∈ V → (𝑦 ∈ (∩ 𝐴 ↑m 𝑥) ↔ 𝑦:𝑥⟶∩ 𝐴))
351, 34sylbi 220 . . . . . . . 8 (𝐴 ≠ ∅ → (𝑦 ∈ (∩ 𝐴 ↑m 𝑥) ↔ 𝑦:𝑥⟶∩ 𝐴))
3635ad2antlr 740 . . . . . . 7 (((∀𝑢 ∈ 𝐴 𝑢 ∈ Univ ∧ 𝐴 ≠ ∅) ∧ 𝑥 ∈ ∩ 𝐴) → (𝑦 ∈ (∩ 𝐴 ↑m 𝑥) ↔ 𝑦:𝑥⟶∩ 𝐴))
37 intss1 4923 . . . . . . . . . . . 12 (𝑢 ∈ 𝐴 → ∩ 𝐴 ⊆ 𝑢)
38 fss 6724 . . . . . . . . . . . 12 ((𝑦:𝑥⟶∩ 𝐴 ∧ ∩ 𝐴 ⊆ 𝑢) → 𝑦:𝑥⟶𝑢)
3937, 38sylan2 605 . . . . . . . . . . 11 ((𝑦:𝑥⟶∩ 𝐴 ∧ 𝑢 ∈ 𝐴) → 𝑦:𝑥⟶𝑢)
4039ralrimiva 3155 . . . . . . . . . 10 (𝑦:𝑥⟶∩ 𝐴 → ∀𝑢 ∈ 𝐴 𝑦:𝑥⟶𝑢)
41 gruurn 10876 . . . . . . . . . . . . . 14 ((𝑢 ∈ Univ ∧ 𝑥 ∈ 𝑢 ∧ 𝑦:𝑥⟶𝑢) → ∪ ran 𝑦 ∈ 𝑢)
42413expia 1139 . . . . . . . . . . . . 13 ((𝑢 ∈ Univ ∧ 𝑥 ∈ 𝑢) → (𝑦:𝑥⟶𝑢 → ∪ ran 𝑦 ∈ 𝑢))
4342ral2imi 3102 . . . . . . . . . . . 12 (∀𝑢 ∈ 𝐴 (𝑢 ∈ Univ ∧ 𝑥 ∈ 𝑢) → (∀𝑢 ∈ 𝐴 𝑦:𝑥⟶𝑢 → ∀𝑢 ∈ 𝐴 ∪ ran 𝑦 ∈ 𝑢))
4420, 43sylbir 238 . . . . . . . . . . 11 ((∀𝑢 ∈ 𝐴 𝑢 ∈ Univ ∧ ∀𝑢 ∈ 𝐴 𝑥 ∈ 𝑢) → (∀𝑢 ∈ 𝐴 𝑦:𝑥⟶𝑢 → ∀𝑢 ∈ 𝐴 ∪ ran 𝑦 ∈ 𝑢))
4514, 44sylan2b 606 . . . . . . . . . 10 ((∀𝑢 ∈ 𝐴 𝑢 ∈ Univ ∧ 𝑥 ∈ ∩ 𝐴) → (∀𝑢 ∈ 𝐴 𝑦:𝑥⟶𝑢 → ∀𝑢 ∈ 𝐴 ∪ ran 𝑦 ∈ 𝑢))
4640, 45syl5 35 . . . . . . . . 9 ((∀𝑢 ∈ 𝐴 𝑢 ∈ Univ ∧ 𝑥 ∈ ∩ 𝐴) → (𝑦:𝑥⟶∩ 𝐴 → ∀𝑢 ∈ 𝐴 ∪ ran 𝑦 ∈ 𝑢))
4725rnex 7920 . . . . . . . . . . 11 ran 𝑦 ∈ V
4847uniex 7756 . . . . . . . . . 10 ∪ ran 𝑦 ∈ V
4948elint2 4914 . . . . . . . . 9 (∪ ran 𝑦 ∈ ∩ 𝐴 ↔ ∀𝑢 ∈ 𝐴 ∪ ran 𝑦 ∈ 𝑢)
5046, 49imbitrrdi 255 . . . . . . . 8 ((∀𝑢 ∈ 𝐴 𝑢 ∈ Univ ∧ 𝑥 ∈ ∩ 𝐴) → (𝑦:𝑥⟶∩ 𝐴 → ∪ ran 𝑦 ∈ ∩ 𝐴))
5150adantlr 728 . . . . . . 7 (((∀𝑢 ∈ 𝐴 𝑢 ∈ Univ ∧ 𝐴 ≠ ∅) ∧ 𝑥 ∈ ∩ 𝐴) → (𝑦:𝑥⟶∩ 𝐴 → ∪ ran 𝑦 ∈ ∩ 𝐴))
5236, 51sylbid 243 . . . . . 6 (((∀𝑢 ∈ 𝐴 𝑢 ∈ Univ ∧ 𝐴 ≠ ∅) ∧ 𝑥 ∈ ∩ 𝐴) → (𝑦 ∈ (∩ 𝐴 ↑m 𝑥) → ∪ ran 𝑦 ∈ ∩ 𝐴))
5352ralrimiv 3154 . . . . 5 (((∀𝑢 ∈ 𝐴 𝑢 ∈ Univ ∧ 𝐴 ≠ ∅) ∧ 𝑥 ∈ ∩ 𝐴) → ∀𝑦 ∈ (∩ 𝐴 ↑m 𝑥)∪ ran 𝑦 ∈ ∩ 𝐴)
5419, 32, 533jca 1146 . . . 4 (((∀𝑢 ∈ 𝐴 𝑢 ∈ Univ ∧ 𝐴 ≠ ∅) ∧ 𝑥 ∈ ∩ 𝐴) → (𝒫 𝑥 ∈ ∩ 𝐴 ∧ ∀𝑦 ∈ ∩ 𝐴{𝑥, 𝑦} ∈ ∩ 𝐴 ∧ ∀𝑦 ∈ (∩ 𝐴 ↑m 𝑥)∪ ran 𝑦 ∈ ∩ 𝐴))
5554ralrimiva 3155 . . 3 ((∀𝑢 ∈ 𝐴 𝑢 ∈ Univ ∧ 𝐴 ≠ ∅) → ∀𝑥 ∈ ∩ 𝐴(𝒫 𝑥 ∈ ∩ 𝐴 ∧ ∀𝑦 ∈ ∩ 𝐴{𝑥, 𝑦} ∈ ∩ 𝐴 ∧ ∀𝑦 ∈ (∩ 𝐴 ↑m 𝑥)∪ ran 𝑦 ∈ ∩ 𝐴))
563, 55sylanb 593 . 2 ((𝐴 ⊆ Univ ∧ 𝐴 ≠ ∅) → ∀𝑥 ∈ ∩ 𝐴(𝒫 𝑥 ∈ ∩ 𝐴 ∧ ∀𝑦 ∈ ∩ 𝐴{𝑥, 𝑦} ∈ ∩ 𝐴 ∧ ∀𝑦 ∈ (∩ 𝐴 ↑m 𝑥)∪ ran 𝑦 ∈ ∩ 𝐴))
57 elgrug 10870 . . 3 (∩ 𝐴 ∈ V → (∩ 𝐴 ∈ Univ ↔ (Tr ∩ 𝐴 ∧ ∀𝑥 ∈ ∩ 𝐴(𝒫 𝑥 ∈ ∩ 𝐴 ∧ ∀𝑦 ∈ ∩ 𝐴{𝑥, 𝑦} ∈ ∩ 𝐴 ∧ ∀𝑦 ∈ (∩ 𝐴 ↑m 𝑥)∪ ran 𝑦 ∈ ∩ 𝐴))))
5857biimpar 483 . 2 ((∩ 𝐴 ∈ V ∧ (Tr ∩ 𝐴 ∧ ∀𝑥 ∈ ∩ 𝐴(𝒫 𝑥 ∈ ∩ 𝐴 ∧ ∀𝑦 ∈ ∩ 𝐴{𝑥, 𝑦} ∈ ∩ 𝐴 ∧ ∀𝑦 ∈ (∩ 𝐴 ↑m 𝑥)∪ ran 𝑦 ∈ ∩ 𝐴))) → ∩ 𝐴 ∈ Univ)
592, 9, 56, 58syl12anc 850 1 ((𝐴 ⊆ Univ ∧ 𝐴 ≠ ∅) → ∩ 𝐴 ∈ Univ)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   ∈ wcel 2145   ≠ wne 2956  ∀wral 3077  Vcvv 3451   ⊆ wss 3899  ∅c0 4279  𝒫 cpw 4557  {cpr 4586  ∪ cuni 4867  ∩ cint 4907  Tr wtr 5212  ran crn 5652  ⟶wf 6533  (class class class)co 7418   ↑m cmap 8840  Univcgru 10868
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2733  ax-sep 5249  ax-pow 5327  ax-pr 5391  ax-un 7749
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-rab 3414  df-v 3453  df-sbc 3740  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-int 4908  df-iin 4954  df-br 5104  df-opab 5168  df-tr 5213  df-id 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-fv 6545  df-ov 7421  df-oprab 7422  df-mpo 7423  df-map 8842  df-gru 10869
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator