![]() |
Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > ILE Home > Th. List > iinrabm | GIF version |
Description: Indexed intersection of a restricted class builder. (Contributed by Jim Kingdon, 16-Aug-2018.) |
Ref | Expression |
---|---|
iinrabm | ⊢ (∃𝑥 𝑥 ∈ 𝐴 → ∩ 𝑥 ∈ 𝐴 {𝑦 ∈ 𝐵 ∣ 𝜑} = {𝑦 ∈ 𝐵 ∣ ∀𝑥 ∈ 𝐴 𝜑}) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | r19.28mv 3394 | . . 3 ⊢ (∃𝑥 𝑥 ∈ 𝐴 → (∀𝑥 ∈ 𝐴 (𝑦 ∈ 𝐵 ∧ 𝜑) ↔ (𝑦 ∈ 𝐵 ∧ ∀𝑥 ∈ 𝐴 𝜑))) | |
2 | 1 | abbidv 2212 | . 2 ⊢ (∃𝑥 𝑥 ∈ 𝐴 → {𝑦 ∣ ∀𝑥 ∈ 𝐴 (𝑦 ∈ 𝐵 ∧ 𝜑)} = {𝑦 ∣ (𝑦 ∈ 𝐵 ∧ ∀𝑥 ∈ 𝐴 𝜑)}) |
3 | df-rab 2379 | . . . . 5 ⊢ {𝑦 ∈ 𝐵 ∣ 𝜑} = {𝑦 ∣ (𝑦 ∈ 𝐵 ∧ 𝜑)} | |
4 | 3 | a1i 9 | . . . 4 ⊢ (𝑥 ∈ 𝐴 → {𝑦 ∈ 𝐵 ∣ 𝜑} = {𝑦 ∣ (𝑦 ∈ 𝐵 ∧ 𝜑)}) |
5 | 4 | iineq2i 3771 | . . 3 ⊢ ∩ 𝑥 ∈ 𝐴 {𝑦 ∈ 𝐵 ∣ 𝜑} = ∩ 𝑥 ∈ 𝐴 {𝑦 ∣ (𝑦 ∈ 𝐵 ∧ 𝜑)} |
6 | iinab 3813 | . . 3 ⊢ ∩ 𝑥 ∈ 𝐴 {𝑦 ∣ (𝑦 ∈ 𝐵 ∧ 𝜑)} = {𝑦 ∣ ∀𝑥 ∈ 𝐴 (𝑦 ∈ 𝐵 ∧ 𝜑)} | |
7 | 5, 6 | eqtri 2115 | . 2 ⊢ ∩ 𝑥 ∈ 𝐴 {𝑦 ∈ 𝐵 ∣ 𝜑} = {𝑦 ∣ ∀𝑥 ∈ 𝐴 (𝑦 ∈ 𝐵 ∧ 𝜑)} |
8 | df-rab 2379 | . 2 ⊢ {𝑦 ∈ 𝐵 ∣ ∀𝑥 ∈ 𝐴 𝜑} = {𝑦 ∣ (𝑦 ∈ 𝐵 ∧ ∀𝑥 ∈ 𝐴 𝜑)} | |
9 | 2, 7, 8 | 3eqtr4g 2152 | 1 ⊢ (∃𝑥 𝑥 ∈ 𝐴 → ∩ 𝑥 ∈ 𝐴 {𝑦 ∈ 𝐵 ∣ 𝜑} = {𝑦 ∈ 𝐵 ∣ ∀𝑥 ∈ 𝐴 𝜑}) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 103 = wceq 1296 ∃wex 1433 ∈ wcel 1445 {cab 2081 ∀wral 2370 {crab 2374 ∩ ciin 3753 |
This theorem was proved from axioms: ax-1 5 ax-2 6 ax-mp 7 ax-ia1 105 ax-ia2 106 ax-ia3 107 ax-io 668 ax-5 1388 ax-7 1389 ax-gen 1390 ax-ie1 1434 ax-ie2 1435 ax-8 1447 ax-10 1448 ax-11 1449 ax-i12 1450 ax-bndl 1451 ax-4 1452 ax-17 1471 ax-i9 1475 ax-ial 1479 ax-i5r 1480 ax-ext 2077 |
This theorem depends on definitions: df-bi 116 df-tru 1299 df-nf 1402 df-sb 1700 df-clab 2082 df-cleq 2088 df-clel 2091 df-nfc 2224 df-ral 2375 df-rab 2379 df-v 2635 df-iin 3755 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |