![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > gruiin | Structured version Visualization version GIF version |
Description: A Grothendieck universe contains indexed intersections of its elements. (Contributed by Mario Carneiro, 9-Jun-2013.) |
Ref | Expression |
---|---|
gruiin | ⊢ ((𝑈 ∈ Univ ∧ ∃𝑥 ∈ 𝐴 𝐵 ∈ 𝑈) → ∩ 𝑥 ∈ 𝐴 𝐵 ∈ 𝑈) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | nfv 1913 | . . 3 ⊢ Ⅎ𝑥 𝑈 ∈ Univ | |
2 | nfii1 5052 | . . . 4 ⊢ Ⅎ𝑥∩ 𝑥 ∈ 𝐴 𝐵 | |
3 | 2 | nfel1 2925 | . . 3 ⊢ Ⅎ𝑥∩ 𝑥 ∈ 𝐴 𝐵 ∈ 𝑈 |
4 | iinss2 5080 | . . . . . 6 ⊢ (𝑥 ∈ 𝐴 → ∩ 𝑥 ∈ 𝐴 𝐵 ⊆ 𝐵) | |
5 | gruss 10865 | . . . . . 6 ⊢ ((𝑈 ∈ Univ ∧ 𝐵 ∈ 𝑈 ∧ ∩ 𝑥 ∈ 𝐴 𝐵 ⊆ 𝐵) → ∩ 𝑥 ∈ 𝐴 𝐵 ∈ 𝑈) | |
6 | 4, 5 | syl3an3 1165 | . . . . 5 ⊢ ((𝑈 ∈ Univ ∧ 𝐵 ∈ 𝑈 ∧ 𝑥 ∈ 𝐴) → ∩ 𝑥 ∈ 𝐴 𝐵 ∈ 𝑈) |
7 | 6 | 3exp 1119 | . . . 4 ⊢ (𝑈 ∈ Univ → (𝐵 ∈ 𝑈 → (𝑥 ∈ 𝐴 → ∩ 𝑥 ∈ 𝐴 𝐵 ∈ 𝑈))) |
8 | 7 | com23 86 | . . 3 ⊢ (𝑈 ∈ Univ → (𝑥 ∈ 𝐴 → (𝐵 ∈ 𝑈 → ∩ 𝑥 ∈ 𝐴 𝐵 ∈ 𝑈))) |
9 | 1, 3, 8 | rexlimd 3272 | . 2 ⊢ (𝑈 ∈ Univ → (∃𝑥 ∈ 𝐴 𝐵 ∈ 𝑈 → ∩ 𝑥 ∈ 𝐴 𝐵 ∈ 𝑈)) |
10 | 9 | imp 406 | 1 ⊢ ((𝑈 ∈ Univ ∧ ∃𝑥 ∈ 𝐴 𝐵 ∈ 𝑈) → ∩ 𝑥 ∈ 𝐴 𝐵 ∈ 𝑈) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 395 ∈ wcel 2108 ∃wrex 3076 ⊆ wss 3976 ∩ ciin 5016 Univcgru 10859 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1793 ax-4 1807 ax-5 1909 ax-6 1967 ax-7 2007 ax-8 2110 ax-9 2118 ax-10 2141 ax-11 2158 ax-12 2178 ax-ext 2711 ax-sep 5317 |
This theorem depends on definitions: df-bi 207 df-an 396 df-or 847 df-3an 1089 df-tru 1540 df-fal 1550 df-ex 1778 df-nf 1782 df-sb 2065 df-clab 2718 df-cleq 2732 df-clel 2819 df-nfc 2895 df-ral 3068 df-rex 3077 df-rab 3444 df-v 3490 df-dif 3979 df-un 3981 df-in 3983 df-ss 3993 df-nul 4353 df-if 4549 df-pw 4624 df-sn 4649 df-pr 4651 df-op 4655 df-uni 4932 df-iin 5018 df-br 5167 df-tr 5284 df-iota 6525 df-fv 6581 df-ov 7451 df-gru 10860 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |