![]() |
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 1909 | . . 3 ⊢ Ⅎ𝑥 𝑈 ∈ Univ | |
2 | nfii1 5033 | . . . 4 ⊢ Ⅎ𝑥∩ 𝑥 ∈ 𝐴 𝐵 | |
3 | 2 | nfel1 2908 | . . 3 ⊢ Ⅎ𝑥∩ 𝑥 ∈ 𝐴 𝐵 ∈ 𝑈 |
4 | iinss2 5061 | . . . . . 6 ⊢ (𝑥 ∈ 𝐴 → ∩ 𝑥 ∈ 𝐴 𝐵 ⊆ 𝐵) | |
5 | gruss 10826 | . . . . . 6 ⊢ ((𝑈 ∈ Univ ∧ 𝐵 ∈ 𝑈 ∧ ∩ 𝑥 ∈ 𝐴 𝐵 ⊆ 𝐵) → ∩ 𝑥 ∈ 𝐴 𝐵 ∈ 𝑈) | |
6 | 4, 5 | syl3an3 1162 | . . . . 5 ⊢ ((𝑈 ∈ Univ ∧ 𝐵 ∈ 𝑈 ∧ 𝑥 ∈ 𝐴) → ∩ 𝑥 ∈ 𝐴 𝐵 ∈ 𝑈) |
7 | 6 | 3exp 1116 | . . . 4 ⊢ (𝑈 ∈ Univ → (𝐵 ∈ 𝑈 → (𝑥 ∈ 𝐴 → ∩ 𝑥 ∈ 𝐴 𝐵 ∈ 𝑈))) |
8 | 7 | com23 86 | . . 3 ⊢ (𝑈 ∈ Univ → (𝑥 ∈ 𝐴 → (𝐵 ∈ 𝑈 → ∩ 𝑥 ∈ 𝐴 𝐵 ∈ 𝑈))) |
9 | 1, 3, 8 | rexlimd 3253 | . 2 ⊢ (𝑈 ∈ Univ → (∃𝑥 ∈ 𝐴 𝐵 ∈ 𝑈 → ∩ 𝑥 ∈ 𝐴 𝐵 ∈ 𝑈)) |
10 | 9 | imp 405 | 1 ⊢ ((𝑈 ∈ Univ ∧ ∃𝑥 ∈ 𝐴 𝐵 ∈ 𝑈) → ∩ 𝑥 ∈ 𝐴 𝐵 ∈ 𝑈) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 394 ∈ wcel 2098 ∃wrex 3059 ⊆ wss 3944 ∩ ciin 4998 Univcgru 10820 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1789 ax-4 1803 ax-5 1905 ax-6 1963 ax-7 2003 ax-8 2100 ax-9 2108 ax-10 2129 ax-11 2146 ax-12 2166 ax-ext 2696 ax-sep 5300 |
This theorem depends on definitions: df-bi 206 df-an 395 df-or 846 df-3an 1086 df-tru 1536 df-fal 1546 df-ex 1774 df-nf 1778 df-sb 2060 df-clab 2703 df-cleq 2717 df-clel 2802 df-nfc 2877 df-ral 3051 df-rex 3060 df-rab 3419 df-v 3463 df-dif 3947 df-un 3949 df-in 3951 df-ss 3961 df-nul 4323 df-if 4531 df-pw 4606 df-sn 4631 df-pr 4633 df-op 4637 df-uni 4910 df-iin 5000 df-br 5150 df-tr 5267 df-iota 6501 df-fv 6557 df-ov 7422 df-gru 10821 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |