| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > dfixp | GIF version | ||
| Description: Eliminate the expression {𝑥 ∣ 𝑥 ∈ 𝐴} in df-ixp 6758, under the assumption that 𝐴 and 𝑥 are disjoint. This way, we can say that 𝑥 is bound in X𝑥 ∈ 𝐴𝐵 even if it appears free in 𝐴. (Contributed by Mario Carneiro, 12-Aug-2016.) |
| Ref | Expression |
|---|---|
| dfixp | ⊢ X𝑥 ∈ 𝐴 𝐵 = {𝑓 ∣ (𝑓 Fn 𝐴 ∧ ∀𝑥 ∈ 𝐴 (𝑓‘𝑥) ∈ 𝐵)} |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | df-ixp 6758 | . 2 ⊢ X𝑥 ∈ 𝐴 𝐵 = {𝑓 ∣ (𝑓 Fn {𝑥 ∣ 𝑥 ∈ 𝐴} ∧ ∀𝑥 ∈ 𝐴 (𝑓‘𝑥) ∈ 𝐵)} | |
| 2 | abid2 2317 | . . . . 5 ⊢ {𝑥 ∣ 𝑥 ∈ 𝐴} = 𝐴 | |
| 3 | 2 | fneq2i 5353 | . . . 4 ⊢ (𝑓 Fn {𝑥 ∣ 𝑥 ∈ 𝐴} ↔ 𝑓 Fn 𝐴) |
| 4 | 3 | anbi1i 458 | . . 3 ⊢ ((𝑓 Fn {𝑥 ∣ 𝑥 ∈ 𝐴} ∧ ∀𝑥 ∈ 𝐴 (𝑓‘𝑥) ∈ 𝐵) ↔ (𝑓 Fn 𝐴 ∧ ∀𝑥 ∈ 𝐴 (𝑓‘𝑥) ∈ 𝐵)) |
| 5 | 4 | abbii 2312 | . 2 ⊢ {𝑓 ∣ (𝑓 Fn {𝑥 ∣ 𝑥 ∈ 𝐴} ∧ ∀𝑥 ∈ 𝐴 (𝑓‘𝑥) ∈ 𝐵)} = {𝑓 ∣ (𝑓 Fn 𝐴 ∧ ∀𝑥 ∈ 𝐴 (𝑓‘𝑥) ∈ 𝐵)} |
| 6 | 1, 5 | eqtri 2217 | 1 ⊢ X𝑥 ∈ 𝐴 𝐵 = {𝑓 ∣ (𝑓 Fn 𝐴 ∧ ∀𝑥 ∈ 𝐴 (𝑓‘𝑥) ∈ 𝐵)} |
| Colors of variables: wff set class |
| Syntax hints: ∧ wa 104 = wceq 1364 ∈ wcel 2167 {cab 2182 ∀wral 2475 Fn wfn 5253 ‘cfv 5258 Xcixp 6757 |
| 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-5 1461 ax-7 1462 ax-gen 1463 ax-ie1 1507 ax-ie2 1508 ax-8 1518 ax-11 1520 ax-4 1524 ax-17 1540 ax-i9 1544 ax-ial 1548 ax-i5r 1549 ax-ext 2178 |
| This theorem depends on definitions: df-bi 117 df-tru 1367 df-nf 1475 df-sb 1777 df-clab 2183 df-cleq 2189 df-clel 2192 df-fn 5261 df-ixp 6758 |
| This theorem is referenced by: ixpsnval 6760 elixp2 6761 ixpeq1 6768 cbvixp 6774 ixp0x 6785 |
| Copyright terms: Public domain | W3C validator |