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 4553 | . . 3 ⊢ (∀𝑥 ∈ 𝐴 𝐵 ∈ 𝐶 → ∩ 𝑥 ∈ 𝐴 𝐵 = ∩ {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = 𝐵}) | |
2 | 1 | adantl 482 | . 2 ⊢ ((𝐴 ≠ ∅ ∧ ∀𝑥 ∈ 𝐴 𝐵 ∈ 𝐶) → ∩ 𝑥 ∈ 𝐴 𝐵 = ∩ {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = 𝐵}) |
3 | elisset 3215 | . . . . . . . . 9 ⊢ (𝐵 ∈ 𝐶 → ∃𝑦 𝑦 = 𝐵) | |
4 | 3 | rgenw 2924 | . . . . . . . 8 ⊢ ∀𝑥 ∈ 𝐴 (𝐵 ∈ 𝐶 → ∃𝑦 𝑦 = 𝐵) |
5 | r19.2z 4060 | . . . . . . . 8 ⊢ ((𝐴 ≠ ∅ ∧ ∀𝑥 ∈ 𝐴 (𝐵 ∈ 𝐶 → ∃𝑦 𝑦 = 𝐵)) → ∃𝑥 ∈ 𝐴 (𝐵 ∈ 𝐶 → ∃𝑦 𝑦 = 𝐵)) | |
6 | 4, 5 | mpan2 707 | . . . . . . 7 ⊢ (𝐴 ≠ ∅ → ∃𝑥 ∈ 𝐴 (𝐵 ∈ 𝐶 → ∃𝑦 𝑦 = 𝐵)) |
7 | r19.35 3084 | . . . . . . 7 ⊢ (∃𝑥 ∈ 𝐴 (𝐵 ∈ 𝐶 → ∃𝑦 𝑦 = 𝐵) ↔ (∀𝑥 ∈ 𝐴 𝐵 ∈ 𝐶 → ∃𝑥 ∈ 𝐴 ∃𝑦 𝑦 = 𝐵)) | |
8 | 6, 7 | sylib 208 | . . . . . 6 ⊢ (𝐴 ≠ ∅ → (∀𝑥 ∈ 𝐴 𝐵 ∈ 𝐶 → ∃𝑥 ∈ 𝐴 ∃𝑦 𝑦 = 𝐵)) |
9 | 8 | imp 445 | . . . . 5 ⊢ ((𝐴 ≠ ∅ ∧ ∀𝑥 ∈ 𝐴 𝐵 ∈ 𝐶) → ∃𝑥 ∈ 𝐴 ∃𝑦 𝑦 = 𝐵) |
10 | rexcom4 3225 | . . . . 5 ⊢ (∃𝑥 ∈ 𝐴 ∃𝑦 𝑦 = 𝐵 ↔ ∃𝑦∃𝑥 ∈ 𝐴 𝑦 = 𝐵) | |
11 | 9, 10 | sylib 208 | . . . 4 ⊢ ((𝐴 ≠ ∅ ∧ ∀𝑥 ∈ 𝐴 𝐵 ∈ 𝐶) → ∃𝑦∃𝑥 ∈ 𝐴 𝑦 = 𝐵) |
12 | abn0 3954 | . . . 4 ⊢ ({𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = 𝐵} ≠ ∅ ↔ ∃𝑦∃𝑥 ∈ 𝐴 𝑦 = 𝐵) | |
13 | 11, 12 | sylibr 224 | . . 3 ⊢ ((𝐴 ≠ ∅ ∧ ∀𝑥 ∈ 𝐴 𝐵 ∈ 𝐶) → {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = 𝐵} ≠ ∅) |
14 | intex 4820 | . . 3 ⊢ ({𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = 𝐵} ≠ ∅ ↔ ∩ {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = 𝐵} ∈ V) | |
15 | 13, 14 | sylib 208 | . 2 ⊢ ((𝐴 ≠ ∅ ∧ ∀𝑥 ∈ 𝐴 𝐵 ∈ 𝐶) → ∩ {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = 𝐵} ∈ V) |
16 | 2, 15 | eqeltrd 2701 | 1 ⊢ ((𝐴 ≠ ∅ ∧ ∀𝑥 ∈ 𝐴 𝐵 ∈ 𝐶) → ∩ 𝑥 ∈ 𝐴 𝐵 ∈ V) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 384 = wceq 1483 ∃wex 1704 ∈ wcel 1990 {cab 2608 ≠ wne 2794 ∀wral 2912 ∃wrex 2913 Vcvv 3200 ∅c0 3915 ∩ cint 4475 ∩ ciin 4521 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1722 ax-4 1737 ax-5 1839 ax-6 1888 ax-7 1935 ax-8 1992 ax-9 1999 ax-10 2019 ax-11 2034 ax-12 2047 ax-13 2246 ax-ext 2602 ax-sep 4781 |
This theorem depends on definitions: df-bi 197 df-or 385 df-an 386 df-tru 1486 df-ex 1705 df-nf 1710 df-sb 1881 df-clab 2609 df-cleq 2615 df-clel 2618 df-nfc 2753 df-ne 2795 df-ral 2917 df-rex 2918 df-v 3202 df-dif 3577 df-in 3581 df-ss 3588 df-nul 3916 df-int 4476 df-iin 4523 |
This theorem is referenced by: fclsval 21812 taylfval 24113 iinexd 39318 smflimlem1 40979 smfliminflem 41036 |
Copyright terms: Public domain | W3C validator |