| 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 1935 | . . 3 ⊢ Ⅎ𝑥 𝑈 ∈ Univ | |
| 2 | nfii1 4987 | . . . 4 ⊢ Ⅎ𝑥∩ 𝑥 ∈ 𝐴 𝐵 | |
| 3 | 2 | nfel1 2941 | . . 3 ⊢ Ⅎ𝑥∩ 𝑥 ∈ 𝐴 𝐵 ∈ 𝑈 |
| 4 | iinss2 5016 | . . . . . 6 ⊢ (𝑥 ∈ 𝐴 → ∩ 𝑥 ∈ 𝐴 𝐵 ⊆ 𝐵) | |
| 5 | gruss 10755 | . . . . . 6 ⊢ ((𝑈 ∈ Univ ∧ 𝐵 ∈ 𝑈 ∧ ∩ 𝑥 ∈ 𝐴 𝐵 ⊆ 𝐵) → ∩ 𝑥 ∈ 𝐴 𝐵 ∈ 𝑈) | |
| 6 | 4, 5 | syl3an3 1179 | . . . . 5 ⊢ ((𝑈 ∈ Univ ∧ 𝐵 ∈ 𝑈 ∧ 𝑥 ∈ 𝐴) → ∩ 𝑥 ∈ 𝐴 𝐵 ∈ 𝑈) |
| 7 | 6 | 3exp 1133 | . . . 4 ⊢ (𝑈 ∈ Univ → (𝐵 ∈ 𝑈 → (𝑥 ∈ 𝐴 → ∩ 𝑥 ∈ 𝐴 𝐵 ∈ 𝑈))) |
| 8 | 7 | com23 86 | . . 3 ⊢ (𝑈 ∈ Univ → (𝑥 ∈ 𝐴 → (𝐵 ∈ 𝑈 → ∩ 𝑥 ∈ 𝐴 𝐵 ∈ 𝑈))) |
| 9 | 1, 3, 8 | rexlimd 3270 | . 2 ⊢ (𝑈 ∈ Univ → (∃𝑥 ∈ 𝐴 𝐵 ∈ 𝑈 → ∩ 𝑥 ∈ 𝐴 𝐵 ∈ 𝑈)) |
| 10 | 9 | imp 410 | 1 ⊢ ((𝑈 ∈ Univ ∧ ∃𝑥 ∈ 𝐴 𝐵 ∈ 𝑈) → ∩ 𝑥 ∈ 𝐴 𝐵 ∈ 𝑈) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 399 ∈ wcel 2143 ∃wrex 3087 ⊆ wss 3905 ∩ ciin 4951 Univcgru 10749 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1816 ax-4 1830 ax-5 1931 ax-6 1988 ax-7 2029 ax-8 2145 ax-9 2153 ax-10 2176 ax-11 2192 ax-12 2213 ax-ext 2735 ax-sep 5247 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3an 1101 df-tru 1564 df-fal 1574 df-ex 1801 df-nf 1805 df-sb 2092 df-clab 2742 df-cleq 2755 df-clel 2838 df-nfc 2912 df-ral 3078 df-rex 3088 df-rab 3416 df-v 3457 df-dif 3908 df-un 3910 df-in 3912 df-ss 3922 df-nul 4287 df-if 4482 df-pw 4558 df-sn 4584 df-pr 4586 df-op 4590 df-uni 4867 df-iin 4953 df-br 5102 df-tr 5209 df-iota 6478 df-fv 6530 df-ov 7400 df-gru 10750 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |