Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > fabexg | Structured version Visualization version 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 7578 | . 2 ⊢ ((𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐷) → (𝐴 × 𝐵) ∈ V) | |
2 | pwexg 5296 | . 2 ⊢ ((𝐴 × 𝐵) ∈ V → 𝒫 (𝐴 × 𝐵) ∈ V) | |
3 | fabexg.1 | . . . . 5 ⊢ 𝐹 = {𝑥 ∣ (𝑥:𝐴⟶𝐵 ∧ 𝜑)} | |
4 | fssxp 6612 | . . . . . . . 8 ⊢ (𝑥:𝐴⟶𝐵 → 𝑥 ⊆ (𝐴 × 𝐵)) | |
5 | velpw 4535 | . . . . . . . 8 ⊢ (𝑥 ∈ 𝒫 (𝐴 × 𝐵) ↔ 𝑥 ⊆ (𝐴 × 𝐵)) | |
6 | 4, 5 | sylibr 233 | . . . . . . 7 ⊢ (𝑥:𝐴⟶𝐵 → 𝑥 ∈ 𝒫 (𝐴 × 𝐵)) |
7 | 6 | anim1i 614 | . . . . . 6 ⊢ ((𝑥:𝐴⟶𝐵 ∧ 𝜑) → (𝑥 ∈ 𝒫 (𝐴 × 𝐵) ∧ 𝜑)) |
8 | 7 | ss2abi 3996 | . . . . 5 ⊢ {𝑥 ∣ (𝑥:𝐴⟶𝐵 ∧ 𝜑)} ⊆ {𝑥 ∣ (𝑥 ∈ 𝒫 (𝐴 × 𝐵) ∧ 𝜑)} |
9 | 3, 8 | eqsstri 3951 | . . . 4 ⊢ 𝐹 ⊆ {𝑥 ∣ (𝑥 ∈ 𝒫 (𝐴 × 𝐵) ∧ 𝜑)} |
10 | ssab2 4008 | . . . 4 ⊢ {𝑥 ∣ (𝑥 ∈ 𝒫 (𝐴 × 𝐵) ∧ 𝜑)} ⊆ 𝒫 (𝐴 × 𝐵) | |
11 | 9, 10 | sstri 3926 | . . 3 ⊢ 𝐹 ⊆ 𝒫 (𝐴 × 𝐵) |
12 | ssexg 5242 | . . 3 ⊢ ((𝐹 ⊆ 𝒫 (𝐴 × 𝐵) ∧ 𝒫 (𝐴 × 𝐵) ∈ V) → 𝐹 ∈ V) | |
13 | 11, 12 | mpan 686 | . 2 ⊢ (𝒫 (𝐴 × 𝐵) ∈ V → 𝐹 ∈ V) |
14 | 1, 2, 13 | 3syl 18 | 1 ⊢ ((𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐷) → 𝐹 ∈ V) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 395 = wceq 1539 ∈ wcel 2108 {cab 2715 Vcvv 3422 ⊆ wss 3883 𝒫 cpw 4530 × cxp 5578 ⟶wf 6414 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1799 ax-4 1813 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2110 ax-9 2118 ax-12 2173 ax-ext 2709 ax-sep 5218 ax-nul 5225 ax-pow 5283 ax-pr 5347 ax-un 7566 |
This theorem depends on definitions: df-bi 206 df-an 396 df-or 844 df-3an 1087 df-tru 1542 df-fal 1552 df-ex 1784 df-sb 2069 df-clab 2716 df-cleq 2730 df-clel 2817 df-ral 3068 df-rex 3069 df-rab 3072 df-v 3424 df-dif 3886 df-un 3888 df-in 3890 df-ss 3900 df-nul 4254 df-if 4457 df-pw 4532 df-sn 4559 df-pr 4561 df-op 4565 df-uni 4837 df-br 5071 df-opab 5133 df-xp 5586 df-rel 5587 df-cnv 5588 df-dm 5590 df-rn 5591 df-fun 6420 df-fn 6421 df-f 6422 |
This theorem is referenced by: fabex 7756 f1oabexg 7757 elghomlem1OLD 35970 |
Copyright terms: Public domain | W3C validator |