| 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 4787 | . 2 ⊢ ((𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐷) → (𝐴 × 𝐵) ∈ V) | |
| 2 | pwexg 4223 | . 2 ⊢ ((𝐴 × 𝐵) ∈ V → 𝒫 (𝐴 × 𝐵) ∈ V) | |
| 3 | fabexg.1 | . . . . 5 ⊢ 𝐹 = {𝑥 ∣ (𝑥:𝐴⟶𝐵 ∧ 𝜑)} | |
| 4 | fssxp 5437 | . . . . . . . 8 ⊢ (𝑥:𝐴⟶𝐵 → 𝑥 ⊆ (𝐴 × 𝐵)) | |
| 5 | velpw 3622 | . . . . . . . 8 ⊢ (𝑥 ∈ 𝒫 (𝐴 × 𝐵) ↔ 𝑥 ⊆ (𝐴 × 𝐵)) | |
| 6 | 4, 5 | sylibr 134 | . . . . . . 7 ⊢ (𝑥:𝐴⟶𝐵 → 𝑥 ∈ 𝒫 (𝐴 × 𝐵)) |
| 7 | 6 | anim1i 340 | . . . . . 6 ⊢ ((𝑥:𝐴⟶𝐵 ∧ 𝜑) → (𝑥 ∈ 𝒫 (𝐴 × 𝐵) ∧ 𝜑)) |
| 8 | 7 | ss2abi 3264 | . . . . 5 ⊢ {𝑥 ∣ (𝑥:𝐴⟶𝐵 ∧ 𝜑)} ⊆ {𝑥 ∣ (𝑥 ∈ 𝒫 (𝐴 × 𝐵) ∧ 𝜑)} |
| 9 | 3, 8 | eqsstri 3224 | . . . 4 ⊢ 𝐹 ⊆ {𝑥 ∣ (𝑥 ∈ 𝒫 (𝐴 × 𝐵) ∧ 𝜑)} |
| 10 | ssab2 3276 | . . . 4 ⊢ {𝑥 ∣ (𝑥 ∈ 𝒫 (𝐴 × 𝐵) ∧ 𝜑)} ⊆ 𝒫 (𝐴 × 𝐵) | |
| 11 | 9, 10 | sstri 3201 | . . 3 ⊢ 𝐹 ⊆ 𝒫 (𝐴 × 𝐵) |
| 12 | ssexg 4182 | . . 3 ⊢ ((𝐹 ⊆ 𝒫 (𝐴 × 𝐵) ∧ 𝒫 (𝐴 × 𝐵) ∈ V) → 𝐹 ∈ V) | |
| 13 | 11, 12 | mpan 424 | . 2 ⊢ (𝒫 (𝐴 × 𝐵) ∈ V → 𝐹 ∈ V) |
| 14 | 1, 2, 13 | 3syl 17 | 1 ⊢ ((𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐷) → 𝐹 ∈ V) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 = wceq 1372 ∈ wcel 2175 {cab 2190 Vcvv 2771 ⊆ wss 3165 𝒫 cpw 3615 × cxp 4671 ⟶wf 5264 |
| 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 710 ax-5 1469 ax-7 1470 ax-gen 1471 ax-ie1 1515 ax-ie2 1516 ax-8 1526 ax-10 1527 ax-11 1528 ax-i12 1529 ax-bndl 1531 ax-4 1532 ax-17 1548 ax-i9 1552 ax-ial 1556 ax-i5r 1557 ax-13 2177 ax-14 2178 ax-ext 2186 ax-sep 4161 ax-pow 4217 ax-pr 4252 ax-un 4478 |
| This theorem depends on definitions: df-bi 117 df-3an 982 df-tru 1375 df-nf 1483 df-sb 1785 df-eu 2056 df-mo 2057 df-clab 2191 df-cleq 2197 df-clel 2200 df-nfc 2336 df-ral 2488 df-rex 2489 df-v 2773 df-un 3169 df-in 3171 df-ss 3178 df-pw 3617 df-sn 3638 df-pr 3639 df-op 3641 df-uni 3850 df-br 4044 df-opab 4105 df-xp 4679 df-rel 4680 df-cnv 4681 df-dm 4683 df-rn 4684 df-fun 5270 df-fn 5271 df-f 5272 |
| This theorem is referenced by: fabex 5458 f1oabexg 5528 |
| Copyright terms: Public domain | W3C validator |