Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > iinexg | Structured version Visualization version GIF version |
Description: The existence of a class intersection. 𝑥 is normally a free-variable parameter in 𝐵, which should be read 𝐵(𝑥). (Contributed by FL, 19-Sep-2011.) |
Ref | Expression |
---|---|
iinexg | ⊢ ((𝐴 ≠ ∅ ∧ ∀𝑥 ∈ 𝐴 𝐵 ∈ 𝐶) → ∩ 𝑥 ∈ 𝐴 𝐵 ∈ V) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | dfiin2g 4966 | . . 3 ⊢ (∀𝑥 ∈ 𝐴 𝐵 ∈ 𝐶 → ∩ 𝑥 ∈ 𝐴 𝐵 = ∩ {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = 𝐵}) | |
2 | 1 | adantl 481 | . 2 ⊢ ((𝐴 ≠ ∅ ∧ ∀𝑥 ∈ 𝐴 𝐵 ∈ 𝐶) → ∩ 𝑥 ∈ 𝐴 𝐵 = ∩ {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = 𝐵}) |
3 | elisset 2821 | . . . . . . . . 9 ⊢ (𝐵 ∈ 𝐶 → ∃𝑦 𝑦 = 𝐵) | |
4 | 3 | rgenw 3077 | . . . . . . . 8 ⊢ ∀𝑥 ∈ 𝐴 (𝐵 ∈ 𝐶 → ∃𝑦 𝑦 = 𝐵) |
5 | r19.2z 4430 | . . . . . . . 8 ⊢ ((𝐴 ≠ ∅ ∧ ∀𝑥 ∈ 𝐴 (𝐵 ∈ 𝐶 → ∃𝑦 𝑦 = 𝐵)) → ∃𝑥 ∈ 𝐴 (𝐵 ∈ 𝐶 → ∃𝑦 𝑦 = 𝐵)) | |
6 | 4, 5 | mpan2 687 | . . . . . . 7 ⊢ (𝐴 ≠ ∅ → ∃𝑥 ∈ 𝐴 (𝐵 ∈ 𝐶 → ∃𝑦 𝑦 = 𝐵)) |
7 | r19.35 3270 | . . . . . . 7 ⊢ (∃𝑥 ∈ 𝐴 (𝐵 ∈ 𝐶 → ∃𝑦 𝑦 = 𝐵) ↔ (∀𝑥 ∈ 𝐴 𝐵 ∈ 𝐶 → ∃𝑥 ∈ 𝐴 ∃𝑦 𝑦 = 𝐵)) | |
8 | 6, 7 | sylib 217 | . . . . . 6 ⊢ (𝐴 ≠ ∅ → (∀𝑥 ∈ 𝐴 𝐵 ∈ 𝐶 → ∃𝑥 ∈ 𝐴 ∃𝑦 𝑦 = 𝐵)) |
9 | 8 | imp 406 | . . . . 5 ⊢ ((𝐴 ≠ ∅ ∧ ∀𝑥 ∈ 𝐴 𝐵 ∈ 𝐶) → ∃𝑥 ∈ 𝐴 ∃𝑦 𝑦 = 𝐵) |
10 | rexcom4 3181 | . . . . 5 ⊢ (∃𝑥 ∈ 𝐴 ∃𝑦 𝑦 = 𝐵 ↔ ∃𝑦∃𝑥 ∈ 𝐴 𝑦 = 𝐵) | |
11 | 9, 10 | sylib 217 | . . . 4 ⊢ ((𝐴 ≠ ∅ ∧ ∀𝑥 ∈ 𝐴 𝐵 ∈ 𝐶) → ∃𝑦∃𝑥 ∈ 𝐴 𝑦 = 𝐵) |
12 | abn0 4319 | . . . 4 ⊢ ({𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = 𝐵} ≠ ∅ ↔ ∃𝑦∃𝑥 ∈ 𝐴 𝑦 = 𝐵) | |
13 | 11, 12 | sylibr 233 | . . 3 ⊢ ((𝐴 ≠ ∅ ∧ ∀𝑥 ∈ 𝐴 𝐵 ∈ 𝐶) → {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = 𝐵} ≠ ∅) |
14 | intex 5264 | . . 3 ⊢ ({𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = 𝐵} ≠ ∅ ↔ ∩ {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = 𝐵} ∈ V) | |
15 | 13, 14 | sylib 217 | . 2 ⊢ ((𝐴 ≠ ∅ ∧ ∀𝑥 ∈ 𝐴 𝐵 ∈ 𝐶) → ∩ {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = 𝐵} ∈ V) |
16 | 2, 15 | eqeltrd 2840 | 1 ⊢ ((𝐴 ≠ ∅ ∧ ∀𝑥 ∈ 𝐴 𝐵 ∈ 𝐶) → ∩ 𝑥 ∈ 𝐴 𝐵 ∈ V) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 395 = wceq 1541 ∃wex 1785 ∈ wcel 2109 {cab 2716 ≠ wne 2944 ∀wral 3065 ∃wrex 3066 Vcvv 3430 ∅c0 4261 ∩ cint 4884 ∩ ciin 4930 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1801 ax-4 1815 ax-5 1916 ax-6 1974 ax-7 2014 ax-8 2111 ax-9 2119 ax-10 2140 ax-11 2157 ax-12 2174 ax-ext 2710 ax-sep 5226 |
This theorem depends on definitions: df-bi 206 df-an 396 df-or 844 df-tru 1544 df-fal 1554 df-ex 1786 df-nf 1790 df-sb 2071 df-clab 2717 df-cleq 2731 df-clel 2817 df-ne 2945 df-ral 3070 df-rex 3071 df-rab 3074 df-v 3432 df-dif 3894 df-in 3898 df-ss 3908 df-nul 4262 df-int 4885 df-iin 4932 |
This theorem is referenced by: fclsval 23140 taylfval 25499 iinexd 42635 smflimlem1 44257 smfliminflem 44314 |
Copyright terms: Public domain | W3C validator |