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

Theorem intgru 10903
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 5304 . . 3 (𝐴 ≠ ∅ ↔ ∩ 𝐴 ∈ V)
21bilani 510 . 2 ((𝐴 ⊆ Univ ∧ 𝐴 ≠ ∅) → ∩ 𝐴 ∈ V)
3 dfss3 3897 . . . . 5 (𝐴 ⊆ Univ ↔ ∀𝑢 ∈ 𝐴 𝑢 ∈ Univ)
4 grutr 10882 . . . . . 6 (𝑢 ∈ Univ → Tr 𝑢)
54ralimi 3099 . . . . 5 (∀𝑢 ∈ 𝐴 𝑢 ∈ Univ → ∀𝑢 ∈ 𝐴 Tr 𝑢)
63, 5sylbi 220 . . . 4 (𝐴 ⊆ Univ → ∀𝑢 ∈ 𝐴 Tr 𝑢)
7 trint 5229 . . . 4 (∀𝑢 ∈ 𝐴 Tr 𝑢 → Tr ∩ 𝐴)
86, 7syl 18 . . 3 (𝐴 ⊆ Univ → Tr ∩ 𝐴)
98adantr 486 . 2 ((𝐴 ⊆ Univ ∧ 𝐴 ≠ ∅) → Tr ∩ 𝐴)
10 grupw 10884 . . . . . . . . . 10 ((𝑢 ∈ Univ ∧ 𝑥 ∈ 𝑢) → 𝒫 𝑥 ∈ 𝑢)
1110ex 418 . . . . . . . . 9 (𝑢 ∈ Univ → (𝑥 ∈ 𝑢 → 𝒫 𝑥 ∈ 𝑢))
1211ral2imi 3101 . . . . . . . 8 (∀𝑢 ∈ 𝐴 𝑢 ∈ Univ → (∀𝑢 ∈ 𝐴 𝑥 ∈ 𝑢 → ∀𝑢 ∈ 𝐴 𝒫 𝑥 ∈ 𝑢))
13 vex 3454 . . . . . . . . 9 𝑥 ∈ V
1413elint2 4913 . . . . . . . 8 (𝑥 ∈ ∩ 𝐴 ↔ ∀𝑢 ∈ 𝐴 𝑥 ∈ 𝑢)
15 vpwex 5338 . . . . . . . . 9 𝒫 𝑥 ∈ V
1615elint2 4913 . . . . . . . 8 (𝒫 𝑥 ∈ ∩ 𝐴 ↔ ∀𝑢 ∈ 𝐴 𝒫 𝑥 ∈ 𝑢)
1712, 14, 163imtr4g 299 . . . . . . 7 (∀𝑢 ∈ 𝐴 𝑢 ∈ Univ → (𝑥 ∈ ∩ 𝐴 → 𝒫 𝑥 ∈ ∩ 𝐴))
1817imp 412 . . . . . 6 ((∀𝑢 ∈ 𝐴 𝑢 ∈ Univ ∧ 𝑥 ∈ ∩ 𝐴) → 𝒫 𝑥 ∈ ∩ 𝐴)
1918adantlr 728 . . . . 5 (((∀𝑢 ∈ 𝐴 𝑢 ∈ Univ ∧ 𝐴 ≠ ∅) ∧ 𝑥 ∈ ∩ 𝐴) → 𝒫 𝑥 ∈ ∩ 𝐴)
20 r19.26 3122 . . . . . . . . . 10 (∀𝑢 ∈ 𝐴 (𝑢 ∈ Univ ∧ 𝑥 ∈ 𝑢) ↔ (∀𝑢 ∈ 𝐴 𝑢 ∈ Univ ∧ ∀𝑢 ∈ 𝐴 𝑥 ∈ 𝑢))
21 grupr 10886 . . . . . . . . . . . 12 ((𝑢 ∈ Univ ∧ 𝑥 ∈ 𝑢 ∧ 𝑦 ∈ 𝑢) → {𝑥, 𝑦} ∈ 𝑢)
22213expia 1139 . . . . . . . . . . 11 ((𝑢 ∈ Univ ∧ 𝑥 ∈ 𝑢) → (𝑦 ∈ 𝑢 → {𝑥, 𝑦} ∈ 𝑢))
2322ral2imi 3101 . . . . . . . . . 10 (∀𝑢 ∈ 𝐴 (𝑢 ∈ Univ ∧ 𝑥 ∈ 𝑢) → (∀𝑢 ∈ 𝐴 𝑦 ∈ 𝑢 → ∀𝑢 ∈ 𝐴 {𝑥, 𝑦} ∈ 𝑢))
2420, 23sylbir 238 . . . . . . . . 9 ((∀𝑢 ∈ 𝐴 𝑢 ∈ Univ ∧ ∀𝑢 ∈ 𝐴 𝑥 ∈ 𝑢) → (∀𝑢 ∈ 𝐴 𝑦 ∈ 𝑢 → ∀𝑢 ∈ 𝐴 {𝑥, 𝑦} ∈ 𝑢))
25 vex 3454 . . . . . . . . . 10 𝑦 ∈ V
2625elint2 4913 . . . . . . . . 9 (𝑦 ∈ ∩ 𝐴 ↔ ∀𝑢 ∈ 𝐴 𝑦 ∈ 𝑢)
27 prex 5395 . . . . . . . . . 10 {𝑥, 𝑦} ∈ V
2827elint2 4913 . . . . . . . . 9 ({𝑥, 𝑦} ∈ ∩ 𝐴 ↔ ∀𝑢 ∈ 𝐴 {𝑥, 𝑦} ∈ 𝑢)
2924, 26, 283imtr4g 299 . . . . . . . 8 ((∀𝑢 ∈ 𝐴 𝑢 ∈ Univ ∧ ∀𝑢 ∈ 𝐴 𝑥 ∈ 𝑢) → (𝑦 ∈ ∩ 𝐴 → {𝑥, 𝑦} ∈ ∩ 𝐴))
3014, 29sylan2b 606 . . . . . . 7 ((∀𝑢 ∈ 𝐴 𝑢 ∈ Univ ∧ 𝑥 ∈ ∩ 𝐴) → (𝑦 ∈ ∩ 𝐴 → {𝑥, 𝑦} ∈ ∩ 𝐴))
3130ralrimiv 3153 . . . . . 6 ((∀𝑢 ∈ 𝐴 𝑢 ∈ Univ ∧ 𝑥 ∈ ∩ 𝐴) → ∀𝑦 ∈ ∩ 𝐴{𝑥, 𝑦} ∈ ∩ 𝐴)
3231adantlr 728 . . . . 5 (((∀𝑢 ∈ 𝐴 𝑢 ∈ Univ ∧ 𝐴 ≠ ∅) ∧ 𝑥 ∈ ∩ 𝐴) → ∀𝑦 ∈ ∩ 𝐴{𝑥, 𝑦} ∈ ∩ 𝐴)
33 elmapg 8863 . . . . . . . . . 10 ((∩ 𝐴 ∈ V ∧ 𝑥 ∈ V) → (𝑦 ∈ (∩ 𝐴 ↑m 𝑥) ↔ 𝑦:𝑥⟶∩ 𝐴))
3433elvd 3456 . . . . . . . . 9 (∩ 𝐴 ∈ V → (𝑦 ∈ (∩ 𝐴 ↑m 𝑥) ↔ 𝑦:𝑥⟶∩ 𝐴))
351, 34sylbi 220 . . . . . . . 8 (𝐴 ≠ ∅ → (𝑦 ∈ (∩ 𝐴 ↑m 𝑥) ↔ 𝑦:𝑥⟶∩ 𝐴))
3635ad2antlr 740 . . . . . . 7 (((∀𝑢 ∈ 𝐴 𝑢 ∈ Univ ∧ 𝐴 ≠ ∅) ∧ 𝑥 ∈ ∩ 𝐴) → (𝑦 ∈ (∩ 𝐴 ↑m 𝑥) ↔ 𝑦:𝑥⟶∩ 𝐴))
37 intss1 4922 . . . . . . . . . . . 12 (𝑢 ∈ 𝐴 → ∩ 𝐴 ⊆ 𝑢)
38 fss 6727 . . . . . . . . . . . 12 ((𝑦:𝑥⟶∩ 𝐴 ∧ ∩ 𝐴 ⊆ 𝑢) → 𝑦:𝑥⟶𝑢)
3937, 38sylan2 605 . . . . . . . . . . 11 ((𝑦:𝑥⟶∩ 𝐴 ∧ 𝑢 ∈ 𝐴) → 𝑦:𝑥⟶𝑢)
4039ralrimiva 3154 . . . . . . . . . 10 (𝑦:𝑥⟶∩ 𝐴 → ∀𝑢 ∈ 𝐴 𝑦:𝑥⟶𝑢)
41 gruurn 10887 . . . . . . . . . . . . . 14 ((𝑢 ∈ Univ ∧ 𝑥 ∈ 𝑢 ∧ 𝑦:𝑥⟶𝑢) → ∪ ran 𝑦 ∈ 𝑢)
42413expia 1139 . . . . . . . . . . . . 13 ((𝑢 ∈ Univ ∧ 𝑥 ∈ 𝑢) → (𝑦:𝑥⟶𝑢 → ∪ ran 𝑦 ∈ 𝑢))
4342ral2imi 3101 . . . . . . . . . . . 12 (∀𝑢 ∈ 𝐴 (𝑢 ∈ Univ ∧ 𝑥 ∈ 𝑢) → (∀𝑢 ∈ 𝐴 𝑦:𝑥⟶𝑢 → ∀𝑢 ∈ 𝐴 ∪ ran 𝑦 ∈ 𝑢))
4420, 43sylbir 238 . . . . . . . . . . 11 ((∀𝑢 ∈ 𝐴 𝑢 ∈ Univ ∧ ∀𝑢 ∈ 𝐴 𝑥 ∈ 𝑢) → (∀𝑢 ∈ 𝐴 𝑦:𝑥⟶𝑢 → ∀𝑢 ∈ 𝐴 ∪ ran 𝑦 ∈ 𝑢))
4514, 44sylan2b 606 . . . . . . . . . 10 ((∀𝑢 ∈ 𝐴 𝑢 ∈ Univ ∧ 𝑥 ∈ ∩ 𝐴) → (∀𝑢 ∈ 𝐴 𝑦:𝑥⟶𝑢 → ∀𝑢 ∈ 𝐴 ∪ ran 𝑦 ∈ 𝑢))
4640, 45syl5 35 . . . . . . . . 9 ((∀𝑢 ∈ 𝐴 𝑢 ∈ Univ ∧ 𝑥 ∈ ∩ 𝐴) → (𝑦:𝑥⟶∩ 𝐴 → ∀𝑢 ∈ 𝐴 ∪ ran 𝑦 ∈ 𝑢))
4725rnex 7923 . . . . . . . . . . 11 ran 𝑦 ∈ V
4847uniex 7759 . . . . . . . . . 10 ∪ ran 𝑦 ∈ V
4948elint2 4913 . . . . . . . . 9 (∪ ran 𝑦 ∈ ∩ 𝐴 ↔ ∀𝑢 ∈ 𝐴 ∪ ran 𝑦 ∈ 𝑢)
5046, 49imbitrrdi 255 . . . . . . . 8 ((∀𝑢 ∈ 𝐴 𝑢 ∈ Univ ∧ 𝑥 ∈ ∩ 𝐴) → (𝑦:𝑥⟶∩ 𝐴 → ∪ ran 𝑦 ∈ ∩ 𝐴))
5150adantlr 728 . . . . . . 7 (((∀𝑢 ∈ 𝐴 𝑢 ∈ Univ ∧ 𝐴 ≠ ∅) ∧ 𝑥 ∈ ∩ 𝐴) → (𝑦:𝑥⟶∩ 𝐴 → ∪ ran 𝑦 ∈ ∩ 𝐴))
5236, 51sylbid 243 . . . . . 6 (((∀𝑢 ∈ 𝐴 𝑢 ∈ Univ ∧ 𝐴 ≠ ∅) ∧ 𝑥 ∈ ∩ 𝐴) → (𝑦 ∈ (∩ 𝐴 ↑m 𝑥) → ∪ ran 𝑦 ∈ ∩ 𝐴))
5352ralrimiv 3153 . . . . 5 (((∀𝑢 ∈ 𝐴 𝑢 ∈ Univ ∧ 𝐴 ≠ ∅) ∧ 𝑥 ∈ ∩ 𝐴) → ∀𝑦 ∈ (∩ 𝐴 ↑m 𝑥)∪ ran 𝑦 ∈ ∩ 𝐴)
5419, 32, 533jca 1146 . . . 4 (((∀𝑢 ∈ 𝐴 𝑢 ∈ Univ ∧ 𝐴 ≠ ∅) ∧ 𝑥 ∈ ∩ 𝐴) → (𝒫 𝑥 ∈ ∩ 𝐴 ∧ ∀𝑦 ∈ ∩ 𝐴{𝑥, 𝑦} ∈ ∩ 𝐴 ∧ ∀𝑦 ∈ (∩ 𝐴 ↑m 𝑥)∪ ran 𝑦 ∈ ∩ 𝐴))
5554ralrimiva 3154 . . 3 ((∀𝑢 ∈ 𝐴 𝑢 ∈ Univ ∧ 𝐴 ≠ ∅) → ∀𝑥 ∈ ∩ 𝐴(𝒫 𝑥 ∈ ∩ 𝐴 ∧ ∀𝑦 ∈ ∩ 𝐴{𝑥, 𝑦} ∈ ∩ 𝐴 ∧ ∀𝑦 ∈ (∩ 𝐴 ↑m 𝑥)∪ ran 𝑦 ∈ ∩ 𝐴))
563, 55sylanb 593 . 2 ((𝐴 ⊆ Univ ∧ 𝐴 ≠ ∅) → ∀𝑥 ∈ ∩ 𝐴(𝒫 𝑥 ∈ ∩ 𝐴 ∧ ∀𝑦 ∈ ∩ 𝐴{𝑥, 𝑦} ∈ ∩ 𝐴 ∧ ∀𝑦 ∈ (∩ 𝐴 ↑m 𝑥)∪ ran 𝑦 ∈ ∩ 𝐴))
57 elgrug 10881 . . 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 2144   ≠ wne 2955  ∀wral 3076  Vcvv 3450   ⊆ wss 3895  ∅c0 4278  𝒫 cpw 4556  {cpr 4586  ∪ cuni 4866  ∩ cint 4906  Tr wtr 5211  ran crn 5651  ⟶wf 6535  (class class class)co 7421   ↑m cmap 8851  Univcgru 10879
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-sep 5248  ax-pow 5326  ax-pr 5390  ax-un 7752
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-sbc 3739  df-ss 3896  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-pw 4558  df-sn 4585  df-pr 4587  df-op 4835  df-uni 4867  df-int 4907  df-iin 4953  df-br 5103  df-opab 5167  df-tr 5212  df-id 5545  df-xp 5656  df-rel 5657  df-cnv 5658  df-co 5659  df-dm 5660  df-rn 5661  df-iota 6494  df-fun 6541  df-fn 6542  df-f 6543  df-fv 6547  df-ov 7424  df-oprab 7425  df-mpo 7426  df-map 8853  df-gru 10880
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator