![]() |
Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > ILE Home > Th. List > elintrab | GIF version |
Description: Membership in the intersection of a class abstraction. (Contributed by NM, 17-Oct-1999.) |
Ref | Expression |
---|---|
inteqab.1 | ⊢ 𝐴 ∈ V |
Ref | Expression |
---|---|
elintrab | ⊢ (𝐴 ∈ ∩ {𝑥 ∈ 𝐵 ∣ 𝜑} ↔ ∀𝑥 ∈ 𝐵 (𝜑 → 𝐴 ∈ 𝑥)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | inteqab.1 | . . . 4 ⊢ 𝐴 ∈ V | |
2 | 1 | elintab 3857 | . . 3 ⊢ (𝐴 ∈ ∩ {𝑥 ∣ (𝑥 ∈ 𝐵 ∧ 𝜑)} ↔ ∀𝑥((𝑥 ∈ 𝐵 ∧ 𝜑) → 𝐴 ∈ 𝑥)) |
3 | impexp 263 | . . . 4 ⊢ (((𝑥 ∈ 𝐵 ∧ 𝜑) → 𝐴 ∈ 𝑥) ↔ (𝑥 ∈ 𝐵 → (𝜑 → 𝐴 ∈ 𝑥))) | |
4 | 3 | albii 1470 | . . 3 ⊢ (∀𝑥((𝑥 ∈ 𝐵 ∧ 𝜑) → 𝐴 ∈ 𝑥) ↔ ∀𝑥(𝑥 ∈ 𝐵 → (𝜑 → 𝐴 ∈ 𝑥))) |
5 | 2, 4 | bitri 184 | . 2 ⊢ (𝐴 ∈ ∩ {𝑥 ∣ (𝑥 ∈ 𝐵 ∧ 𝜑)} ↔ ∀𝑥(𝑥 ∈ 𝐵 → (𝜑 → 𝐴 ∈ 𝑥))) |
6 | df-rab 2464 | . . . 4 ⊢ {𝑥 ∈ 𝐵 ∣ 𝜑} = {𝑥 ∣ (𝑥 ∈ 𝐵 ∧ 𝜑)} | |
7 | 6 | inteqi 3850 | . . 3 ⊢ ∩ {𝑥 ∈ 𝐵 ∣ 𝜑} = ∩ {𝑥 ∣ (𝑥 ∈ 𝐵 ∧ 𝜑)} |
8 | 7 | eleq2i 2244 | . 2 ⊢ (𝐴 ∈ ∩ {𝑥 ∈ 𝐵 ∣ 𝜑} ↔ 𝐴 ∈ ∩ {𝑥 ∣ (𝑥 ∈ 𝐵 ∧ 𝜑)}) |
9 | df-ral 2460 | . 2 ⊢ (∀𝑥 ∈ 𝐵 (𝜑 → 𝐴 ∈ 𝑥) ↔ ∀𝑥(𝑥 ∈ 𝐵 → (𝜑 → 𝐴 ∈ 𝑥))) | |
10 | 5, 8, 9 | 3bitr4i 212 | 1 ⊢ (𝐴 ∈ ∩ {𝑥 ∈ 𝐵 ∣ 𝜑} ↔ ∀𝑥 ∈ 𝐵 (𝜑 → 𝐴 ∈ 𝑥)) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 104 ↔ wb 105 ∀wal 1351 ∈ wcel 2148 {cab 2163 ∀wral 2455 {crab 2459 Vcvv 2739 ∩ cint 3846 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-io 709 ax-5 1447 ax-7 1448 ax-gen 1449 ax-ie1 1493 ax-ie2 1494 ax-8 1504 ax-10 1505 ax-11 1506 ax-i12 1507 ax-bndl 1509 ax-4 1510 ax-17 1526 ax-i9 1530 ax-ial 1534 ax-i5r 1535 ax-ext 2159 |
This theorem depends on definitions: df-bi 117 df-tru 1356 df-nf 1461 df-sb 1763 df-clab 2164 df-cleq 2170 df-clel 2173 df-nfc 2308 df-ral 2460 df-rab 2464 df-v 2741 df-int 3847 |
This theorem is referenced by: elintrabg 3859 intmin 3866 bj-indint 14768 |
Copyright terms: Public domain | W3C validator |