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

Theorem intgru 10735
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 5279 . . 3 (𝐴 ≠ ∅ ↔ 𝐴 ∈ V)
21bilani 505 . 2 ((𝐴 ⊆ Univ ∧ 𝐴 ≠ ∅) → 𝐴 ∈ V)
3 dfss3 3911 . . . . 5 (𝐴 ⊆ Univ ↔ ∀𝑢𝐴 𝑢 ∈ Univ)
4 grutr 10714 . . . . . 6 (𝑢 ∈ Univ → Tr 𝑢)
54ralimi 3077 . . . . 5 (∀𝑢𝐴 𝑢 ∈ Univ → ∀𝑢𝐴 Tr 𝑢)
63, 5sylbi 218 . . . 4 (𝐴 ⊆ Univ → ∀𝑢𝐴 Tr 𝑢)
7 trint 5204 . . . 4 (∀𝑢𝐴 Tr 𝑢 → Tr 𝐴)
86, 7syl 17 . . 3 (𝐴 ⊆ Univ → Tr 𝐴)
98adantr 481 . 2 ((𝐴 ⊆ Univ ∧ 𝐴 ≠ ∅) → Tr 𝐴)
10 grupw 10716 . . . . . . . . . 10 ((𝑢 ∈ Univ ∧ 𝑥𝑢) → 𝒫 𝑥𝑢)
1110ex 413 . . . . . . . . 9 (𝑢 ∈ Univ → (𝑥𝑢 → 𝒫 𝑥𝑢))
1211ral2imi 3079 . . . . . . . 8 (∀𝑢𝐴 𝑢 ∈ Univ → (∀𝑢𝐴 𝑥𝑢 → ∀𝑢𝐴 𝒫 𝑥𝑢))
13 vex 3436 . . . . . . . . 9 𝑥 ∈ V
1413elint2 4891 . . . . . . . 8 (𝑥 𝐴 ↔ ∀𝑢𝐴 𝑥𝑢)
15 vpwex 5313 . . . . . . . . 9 𝒫 𝑥 ∈ V
1615elint2 4891 . . . . . . . 8 (𝒫 𝑥 𝐴 ↔ ∀𝑢𝐴 𝒫 𝑥𝑢)
1712, 14, 163imtr4g 297 . . . . . . 7 (∀𝑢𝐴 𝑢 ∈ Univ → (𝑥 𝐴 → 𝒫 𝑥 𝐴))
1817imp 407 . . . . . 6 ((∀𝑢𝐴 𝑢 ∈ Univ ∧ 𝑥 𝐴) → 𝒫 𝑥 𝐴)
1918adantlr 721 . . . . 5 (((∀𝑢𝐴 𝑢 ∈ Univ ∧ 𝐴 ≠ ∅) ∧ 𝑥 𝐴) → 𝒫 𝑥 𝐴)
20 r19.26 3100 . . . . . . . . . 10 (∀𝑢𝐴 (𝑢 ∈ Univ ∧ 𝑥𝑢) ↔ (∀𝑢𝐴 𝑢 ∈ Univ ∧ ∀𝑢𝐴 𝑥𝑢))
21 grupr 10718 . . . . . . . . . . . 12 ((𝑢 ∈ Univ ∧ 𝑥𝑢𝑦𝑢) → {𝑥, 𝑦} ∈ 𝑢)
22213expia 1127 . . . . . . . . . . 11 ((𝑢 ∈ Univ ∧ 𝑥𝑢) → (𝑦𝑢 → {𝑥, 𝑦} ∈ 𝑢))
2322ral2imi 3079 . . . . . . . . . 10 (∀𝑢𝐴 (𝑢 ∈ Univ ∧ 𝑥𝑢) → (∀𝑢𝐴 𝑦𝑢 → ∀𝑢𝐴 {𝑥, 𝑦} ∈ 𝑢))
2420, 23sylbir 236 . . . . . . . . 9 ((∀𝑢𝐴 𝑢 ∈ Univ ∧ ∀𝑢𝐴 𝑥𝑢) → (∀𝑢𝐴 𝑦𝑢 → ∀𝑢𝐴 {𝑥, 𝑦} ∈ 𝑢))
25 vex 3436 . . . . . . . . . 10 𝑦 ∈ V
2625elint2 4891 . . . . . . . . 9 (𝑦 𝐴 ↔ ∀𝑢𝐴 𝑦𝑢)
27 prex 5374 . . . . . . . . . 10 {𝑥, 𝑦} ∈ V
2827elint2 4891 . . . . . . . . 9 ({𝑥, 𝑦} ∈ 𝐴 ↔ ∀𝑢𝐴 {𝑥, 𝑦} ∈ 𝑢)
2924, 26, 283imtr4g 297 . . . . . . . 8 ((∀𝑢𝐴 𝑢 ∈ Univ ∧ ∀𝑢𝐴 𝑥𝑢) → (𝑦 𝐴 → {𝑥, 𝑦} ∈ 𝐴))
3014, 29sylan2b 600 . . . . . . 7 ((∀𝑢𝐴 𝑢 ∈ Univ ∧ 𝑥 𝐴) → (𝑦 𝐴 → {𝑥, 𝑦} ∈ 𝐴))
3130ralrimiv 3131 . . . . . 6 ((∀𝑢𝐴 𝑢 ∈ Univ ∧ 𝑥 𝐴) → ∀𝑦 𝐴{𝑥, 𝑦} ∈ 𝐴)
3231adantlr 721 . . . . 5 (((∀𝑢𝐴 𝑢 ∈ Univ ∧ 𝐴 ≠ ∅) ∧ 𝑥 𝐴) → ∀𝑦 𝐴{𝑥, 𝑦} ∈ 𝐴)
33 elmapg 8783 . . . . . . . . . 10 (( 𝐴 ∈ V ∧ 𝑥 ∈ V) → (𝑦 ∈ ( 𝐴m 𝑥) ↔ 𝑦:𝑥 𝐴))
3433elvd 3438 . . . . . . . . 9 ( 𝐴 ∈ V → (𝑦 ∈ ( 𝐴m 𝑥) ↔ 𝑦:𝑥 𝐴))
351, 34sylbi 218 . . . . . . . 8 (𝐴 ≠ ∅ → (𝑦 ∈ ( 𝐴m 𝑥) ↔ 𝑦:𝑥 𝐴))
3635ad2antlr 733 . . . . . . 7 (((∀𝑢𝐴 𝑢 ∈ Univ ∧ 𝐴 ≠ ∅) ∧ 𝑥 𝐴) → (𝑦 ∈ ( 𝐴m 𝑥) ↔ 𝑦:𝑥 𝐴))
37 intss1 4900 . . . . . . . . . . . 12 (𝑢𝐴 𝐴𝑢)
38 fss 6678 . . . . . . . . . . . 12 ((𝑦:𝑥 𝐴 𝐴𝑢) → 𝑦:𝑥𝑢)
3937, 38sylan2 599 . . . . . . . . . . 11 ((𝑦:𝑥 𝐴𝑢𝐴) → 𝑦:𝑥𝑢)
4039ralrimiva 3132 . . . . . . . . . 10 (𝑦:𝑥 𝐴 → ∀𝑢𝐴 𝑦:𝑥𝑢)
41 gruurn 10719 . . . . . . . . . . . . . 14 ((𝑢 ∈ Univ ∧ 𝑥𝑢𝑦:𝑥𝑢) → ran 𝑦𝑢)
42413expia 1127 . . . . . . . . . . . . 13 ((𝑢 ∈ Univ ∧ 𝑥𝑢) → (𝑦:𝑥𝑢 ran 𝑦𝑢))
4342ral2imi 3079 . . . . . . . . . . . 12 (∀𝑢𝐴 (𝑢 ∈ Univ ∧ 𝑥𝑢) → (∀𝑢𝐴 𝑦:𝑥𝑢 → ∀𝑢𝐴 ran 𝑦𝑢))
4420, 43sylbir 236 . . . . . . . . . . 11 ((∀𝑢𝐴 𝑢 ∈ Univ ∧ ∀𝑢𝐴 𝑥𝑢) → (∀𝑢𝐴 𝑦:𝑥𝑢 → ∀𝑢𝐴 ran 𝑦𝑢))
4514, 44sylan2b 600 . . . . . . . . . 10 ((∀𝑢𝐴 𝑢 ∈ Univ ∧ 𝑥 𝐴) → (∀𝑢𝐴 𝑦:𝑥𝑢 → ∀𝑢𝐴 ran 𝑦𝑢))
4640, 45syl5 34 . . . . . . . . 9 ((∀𝑢𝐴 𝑢 ∈ Univ ∧ 𝑥 𝐴) → (𝑦:𝑥 𝐴 → ∀𝑢𝐴 ran 𝑦𝑢))
4725rnex 7857 . . . . . . . . . . 11 ran 𝑦 ∈ V
4847uniex 7691 . . . . . . . . . 10 ran 𝑦 ∈ V
4948elint2 4891 . . . . . . . . 9 ( ran 𝑦 𝐴 ↔ ∀𝑢𝐴 ran 𝑦𝑢)
5046, 49imbitrrdi 253 . . . . . . . 8 ((∀𝑢𝐴 𝑢 ∈ Univ ∧ 𝑥 𝐴) → (𝑦:𝑥 𝐴 ran 𝑦 𝐴))
5150adantlr 721 . . . . . . 7 (((∀𝑢𝐴 𝑢 ∈ Univ ∧ 𝐴 ≠ ∅) ∧ 𝑥 𝐴) → (𝑦:𝑥 𝐴 ran 𝑦 𝐴))
5236, 51sylbid 241 . . . . . 6 (((∀𝑢𝐴 𝑢 ∈ Univ ∧ 𝐴 ≠ ∅) ∧ 𝑥 𝐴) → (𝑦 ∈ ( 𝐴m 𝑥) → ran 𝑦 𝐴))
5352ralrimiv 3131 . . . . 5 (((∀𝑢𝐴 𝑢 ∈ Univ ∧ 𝐴 ≠ ∅) ∧ 𝑥 𝐴) → ∀𝑦 ∈ ( 𝐴m 𝑥) ran 𝑦 𝐴)
5419, 32, 533jca 1134 . . . 4 (((∀𝑢𝐴 𝑢 ∈ Univ ∧ 𝐴 ≠ ∅) ∧ 𝑥 𝐴) → (𝒫 𝑥 𝐴 ∧ ∀𝑦 𝐴{𝑥, 𝑦} ∈ 𝐴 ∧ ∀𝑦 ∈ ( 𝐴m 𝑥) ran 𝑦 𝐴))
5554ralrimiva 3132 . . 3 ((∀𝑢𝐴 𝑢 ∈ Univ ∧ 𝐴 ≠ ∅) → ∀𝑥 𝐴(𝒫 𝑥 𝐴 ∧ ∀𝑦 𝐴{𝑥, 𝑦} ∈ 𝐴 ∧ ∀𝑦 ∈ ( 𝐴m 𝑥) ran 𝑦 𝐴))
563, 55sylanb 587 . 2 ((𝐴 ⊆ Univ ∧ 𝐴 ≠ ∅) → ∀𝑥 𝐴(𝒫 𝑥 𝐴 ∧ ∀𝑦 𝐴{𝑥, 𝑦} ∈ 𝐴 ∧ ∀𝑦 ∈ ( 𝐴m 𝑥) ran 𝑦 𝐴))
57 elgrug 10713 . . 3 ( 𝐴 ∈ V → ( 𝐴 ∈ Univ ↔ (Tr 𝐴 ∧ ∀𝑥 𝐴(𝒫 𝑥 𝐴 ∧ ∀𝑦 𝐴{𝑥, 𝑦} ∈ 𝐴 ∧ ∀𝑦 ∈ ( 𝐴m 𝑥) ran 𝑦 𝐴))))
5857biimpar 478 . 2 (( 𝐴 ∈ V ∧ (Tr 𝐴 ∧ ∀𝑥 𝐴(𝒫 𝑥 𝐴 ∧ ∀𝑦 𝐴{𝑥, 𝑦} ∈ 𝐴 ∧ ∀𝑦 ∈ ( 𝐴m 𝑥) ran 𝑦 𝐴))) → 𝐴 ∈ Univ)
592, 9, 56, 58syl12anc 842 1 ((𝐴 ⊆ Univ ∧ 𝐴 ≠ ∅) → 𝐴 ∈ Univ)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 207  wa 396  w3a 1092  wcel 2119  wne 2935  wral 3054  Vcvv 3432  wss 3890  c0 4268  𝒫 cpw 4536  {cpr 4564   cuni 4845   cint 4884  Tr wtr 5186  ran crn 5626  wf 6488  (class class class)co 7363  m cmap 8770  Univcgru 10711
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1802  ax-4 1816  ax-5 1917  ax-6 1974  ax-7 2015  ax-8 2121  ax-9 2129  ax-10 2152  ax-11 2168  ax-12 2189  ax-ext 2712  ax-sep 5225  ax-pow 5301  ax-pr 5369  ax-un 7685
This theorem depends on definitions:  df-bi 208  df-an 397  df-or 854  df-3an 1094  df-tru 1550  df-fal 1560  df-ex 1787  df-nf 1791  df-sb 2074  df-mo 2543  df-eu 2573  df-clab 2719  df-cleq 2732  df-clel 2815  df-nfc 2889  df-ne 2936  df-ral 3055  df-rex 3065  df-rab 3393  df-v 3434  df-sbc 3731  df-dif 3893  df-un 3895  df-in 3897  df-ss 3907  df-nul 4269  df-if 4462  df-pw 4538  df-sn 4563  df-pr 4565  df-op 4569  df-uni 4846  df-int 4885  df-iin 4931  df-br 5080  df-opab 5142  df-tr 5187  df-id 5520  df-xp 5631  df-rel 5632  df-cnv 5633  df-co 5634  df-dm 5635  df-rn 5636  df-iota 6448  df-fun 6494  df-fn 6495  df-f 6496  df-fv 6500  df-ov 7366  df-oprab 7367  df-mpo 7368  df-map 8772  df-gru 10712
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator