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 7473 | . 2 ⊢ ((𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐷) → (𝐴 × 𝐵) ∈ V) | |
2 | pwexg 5279 | . 2 ⊢ ((𝐴 × 𝐵) ∈ V → 𝒫 (𝐴 × 𝐵) ∈ V) | |
3 | fabexg.1 | . . . . 5 ⊢ 𝐹 = {𝑥 ∣ (𝑥:𝐴⟶𝐵 ∧ 𝜑)} | |
4 | fssxp 6534 | . . . . . . . 8 ⊢ (𝑥:𝐴⟶𝐵 → 𝑥 ⊆ (𝐴 × 𝐵)) | |
5 | velpw 4544 | . . . . . . . 8 ⊢ (𝑥 ∈ 𝒫 (𝐴 × 𝐵) ↔ 𝑥 ⊆ (𝐴 × 𝐵)) | |
6 | 4, 5 | sylibr 236 | . . . . . . 7 ⊢ (𝑥:𝐴⟶𝐵 → 𝑥 ∈ 𝒫 (𝐴 × 𝐵)) |
7 | 6 | anim1i 616 | . . . . . 6 ⊢ ((𝑥:𝐴⟶𝐵 ∧ 𝜑) → (𝑥 ∈ 𝒫 (𝐴 × 𝐵) ∧ 𝜑)) |
8 | 7 | ss2abi 4043 | . . . . 5 ⊢ {𝑥 ∣ (𝑥:𝐴⟶𝐵 ∧ 𝜑)} ⊆ {𝑥 ∣ (𝑥 ∈ 𝒫 (𝐴 × 𝐵) ∧ 𝜑)} |
9 | 3, 8 | eqsstri 4001 | . . . 4 ⊢ 𝐹 ⊆ {𝑥 ∣ (𝑥 ∈ 𝒫 (𝐴 × 𝐵) ∧ 𝜑)} |
10 | ssab2 4055 | . . . 4 ⊢ {𝑥 ∣ (𝑥 ∈ 𝒫 (𝐴 × 𝐵) ∧ 𝜑)} ⊆ 𝒫 (𝐴 × 𝐵) | |
11 | 9, 10 | sstri 3976 | . . 3 ⊢ 𝐹 ⊆ 𝒫 (𝐴 × 𝐵) |
12 | ssexg 5227 | . . 3 ⊢ ((𝐹 ⊆ 𝒫 (𝐴 × 𝐵) ∧ 𝒫 (𝐴 × 𝐵) ∈ V) → 𝐹 ∈ V) | |
13 | 11, 12 | mpan 688 | . 2 ⊢ (𝒫 (𝐴 × 𝐵) ∈ V → 𝐹 ∈ V) |
14 | 1, 2, 13 | 3syl 18 | 1 ⊢ ((𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐷) → 𝐹 ∈ V) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 398 = wceq 1537 ∈ wcel 2114 {cab 2799 Vcvv 3494 ⊆ wss 3936 𝒫 cpw 4539 × cxp 5553 ⟶wf 6351 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2116 ax-9 2124 ax-10 2145 ax-11 2161 ax-12 2177 ax-ext 2793 ax-sep 5203 ax-nul 5210 ax-pow 5266 ax-pr 5330 ax-un 7461 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3an 1085 df-tru 1540 df-ex 1781 df-nf 1785 df-sb 2070 df-mo 2622 df-eu 2654 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-ral 3143 df-rex 3144 df-rab 3147 df-v 3496 df-dif 3939 df-un 3941 df-in 3943 df-ss 3952 df-nul 4292 df-if 4468 df-pw 4541 df-sn 4568 df-pr 4570 df-op 4574 df-uni 4839 df-br 5067 df-opab 5129 df-xp 5561 df-rel 5562 df-cnv 5563 df-dm 5565 df-rn 5566 df-fun 6357 df-fn 6358 df-f 6359 |
This theorem is referenced by: fabex 7640 f1oabexg 7642 elghomlem1OLD 35178 |
Copyright terms: Public domain | W3C validator |