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 1915 | . . 3 ⊢ Ⅎ𝑥 𝑈 ∈ Univ | |
2 | nfii1 4916 | . . . 4 ⊢ Ⅎ𝑥∩ 𝑥 ∈ 𝐴 𝐵 | |
3 | 2 | nfel1 2971 | . . 3 ⊢ Ⅎ𝑥∩ 𝑥 ∈ 𝐴 𝐵 ∈ 𝑈 |
4 | iinss2 4944 | . . . . . 6 ⊢ (𝑥 ∈ 𝐴 → ∩ 𝑥 ∈ 𝐴 𝐵 ⊆ 𝐵) | |
5 | gruss 10207 | . . . . . 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 3276 | . 2 ⊢ (𝑈 ∈ Univ → (∃𝑥 ∈ 𝐴 𝐵 ∈ 𝑈 → ∩ 𝑥 ∈ 𝐴 𝐵 ∈ 𝑈)) |
10 | 9 | imp 410 | 1 ⊢ ((𝑈 ∈ Univ ∧ ∃𝑥 ∈ 𝐴 𝐵 ∈ 𝑈) → ∩ 𝑥 ∈ 𝐴 𝐵 ∈ 𝑈) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 399 ∈ wcel 2111 ∃wrex 3107 ⊆ wss 3881 ∩ ciin 4882 Univcgru 10201 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2113 ax-9 2121 ax-10 2142 ax-11 2158 ax-12 2175 ax-ext 2770 ax-sep 5167 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 845 df-3an 1086 df-tru 1541 df-ex 1782 df-nf 1786 df-sb 2070 df-clab 2777 df-cleq 2791 df-clel 2870 df-nfc 2938 df-ral 3111 df-rex 3112 df-rab 3115 df-v 3443 df-un 3886 df-in 3888 df-ss 3898 df-pw 4499 df-sn 4526 df-pr 4528 df-op 4532 df-uni 4801 df-iin 4884 df-br 5031 df-tr 5137 df-iota 6283 df-fv 6332 df-ov 7138 df-gru 10202 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |