Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > fabexg | GIF version |
Description: Existence of a set of functions. (Contributed by Paul Chapman, 25-Feb-2008.) |
Ref | Expression |
---|---|
fabexg.1 | ⊢ 𝐹 = {𝑥 ∣ (𝑥:𝐴⟶𝐵 ∧ 𝜑)} |
Ref | Expression |
---|---|
fabexg | ⊢ ((𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐷) → 𝐹 ∈ V) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | xpexg 4718 | . 2 ⊢ ((𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐷) → (𝐴 × 𝐵) ∈ V) | |
2 | pwexg 4159 | . 2 ⊢ ((𝐴 × 𝐵) ∈ V → 𝒫 (𝐴 × 𝐵) ∈ V) | |
3 | fabexg.1 | . . . . 5 ⊢ 𝐹 = {𝑥 ∣ (𝑥:𝐴⟶𝐵 ∧ 𝜑)} | |
4 | fssxp 5355 | . . . . . . . 8 ⊢ (𝑥:𝐴⟶𝐵 → 𝑥 ⊆ (𝐴 × 𝐵)) | |
5 | velpw 3566 | . . . . . . . 8 ⊢ (𝑥 ∈ 𝒫 (𝐴 × 𝐵) ↔ 𝑥 ⊆ (𝐴 × 𝐵)) | |
6 | 4, 5 | sylibr 133 | . . . . . . 7 ⊢ (𝑥:𝐴⟶𝐵 → 𝑥 ∈ 𝒫 (𝐴 × 𝐵)) |
7 | 6 | anim1i 338 | . . . . . 6 ⊢ ((𝑥:𝐴⟶𝐵 ∧ 𝜑) → (𝑥 ∈ 𝒫 (𝐴 × 𝐵) ∧ 𝜑)) |
8 | 7 | ss2abi 3214 | . . . . 5 ⊢ {𝑥 ∣ (𝑥:𝐴⟶𝐵 ∧ 𝜑)} ⊆ {𝑥 ∣ (𝑥 ∈ 𝒫 (𝐴 × 𝐵) ∧ 𝜑)} |
9 | 3, 8 | eqsstri 3174 | . . . 4 ⊢ 𝐹 ⊆ {𝑥 ∣ (𝑥 ∈ 𝒫 (𝐴 × 𝐵) ∧ 𝜑)} |
10 | ssab2 3226 | . . . 4 ⊢ {𝑥 ∣ (𝑥 ∈ 𝒫 (𝐴 × 𝐵) ∧ 𝜑)} ⊆ 𝒫 (𝐴 × 𝐵) | |
11 | 9, 10 | sstri 3151 | . . 3 ⊢ 𝐹 ⊆ 𝒫 (𝐴 × 𝐵) |
12 | ssexg 4121 | . . 3 ⊢ ((𝐹 ⊆ 𝒫 (𝐴 × 𝐵) ∧ 𝒫 (𝐴 × 𝐵) ∈ V) → 𝐹 ∈ V) | |
13 | 11, 12 | mpan 421 | . 2 ⊢ (𝒫 (𝐴 × 𝐵) ∈ V → 𝐹 ∈ V) |
14 | 1, 2, 13 | 3syl 17 | 1 ⊢ ((𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐷) → 𝐹 ∈ V) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 103 = wceq 1343 ∈ wcel 2136 {cab 2151 Vcvv 2726 ⊆ wss 3116 𝒫 cpw 3559 × cxp 4602 ⟶wf 5184 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 105 ax-ia2 106 ax-ia3 107 ax-io 699 ax-5 1435 ax-7 1436 ax-gen 1437 ax-ie1 1481 ax-ie2 1482 ax-8 1492 ax-10 1493 ax-11 1494 ax-i12 1495 ax-bndl 1497 ax-4 1498 ax-17 1514 ax-i9 1518 ax-ial 1522 ax-i5r 1523 ax-13 2138 ax-14 2139 ax-ext 2147 ax-sep 4100 ax-pow 4153 ax-pr 4187 ax-un 4411 |
This theorem depends on definitions: df-bi 116 df-3an 970 df-tru 1346 df-nf 1449 df-sb 1751 df-eu 2017 df-mo 2018 df-clab 2152 df-cleq 2158 df-clel 2161 df-nfc 2297 df-ral 2449 df-rex 2450 df-v 2728 df-un 3120 df-in 3122 df-ss 3129 df-pw 3561 df-sn 3582 df-pr 3583 df-op 3585 df-uni 3790 df-br 3983 df-opab 4044 df-xp 4610 df-rel 4611 df-cnv 4612 df-dm 4614 df-rn 4615 df-fun 5190 df-fn 5191 df-f 5192 |
This theorem is referenced by: fabex 5376 f1oabexg 5444 |
Copyright terms: Public domain | W3C validator |