| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > fabexd | Structured version Visualization version GIF version | ||
| Description: Existence of a set of functions. In contrast to fabex 7985 or fabexg 7984, the condition in the class abstraction does not contain the function explicitly, but the function can be derived from it. Therefore, this theorem is also applicable for more special functions like one-to-one, onto or one-to-one onto functions. (Contributed by AV, 20-May-2025.) |
| Ref | Expression |
|---|---|
| fabexd.f | ⊢ ((𝜑 ∧ 𝜓) → 𝑓:𝑋⟶𝑌) |
| fabexd.x | ⊢ (𝜑 → 𝑋 ∈ 𝑉) |
| fabexd.y | ⊢ (𝜑 → 𝑌 ∈ 𝑊) |
| Ref | Expression |
|---|---|
| fabexd | ⊢ (𝜑 → {𝑓 ∣ 𝜓} ∈ V) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | fabexd.x | . . . 4 ⊢ (𝜑 → 𝑋 ∈ 𝑉) | |
| 2 | fabexd.y | . . . 4 ⊢ (𝜑 → 𝑌 ∈ 𝑊) | |
| 3 | 1, 2 | xpexd 7797 | . . 3 ⊢ (𝜑 → (𝑋 × 𝑌) ∈ V) |
| 4 | 3 | pwexd 5348 | . 2 ⊢ (𝜑 → 𝒫 (𝑋 × 𝑌) ∈ V) |
| 5 | fabexd.f | . . . . 5 ⊢ ((𝜑 ∧ 𝜓) → 𝑓:𝑋⟶𝑌) | |
| 6 | fssxp 6767 | . . . . . 6 ⊢ (𝑓:𝑋⟶𝑌 → 𝑓 ⊆ (𝑋 × 𝑌)) | |
| 7 | velpw 4565 | . . . . . 6 ⊢ (𝑓 ∈ 𝒫 (𝑋 × 𝑌) ↔ 𝑓 ⊆ (𝑋 × 𝑌)) | |
| 8 | 6, 7 | sylibr 237 | . . . . 5 ⊢ (𝑓:𝑋⟶𝑌 → 𝑓 ∈ 𝒫 (𝑋 × 𝑌)) |
| 9 | 5, 8 | syl 18 | . . . 4 ⊢ ((𝜑 ∧ 𝜓) → 𝑓 ∈ 𝒫 (𝑋 × 𝑌)) |
| 10 | 9 | ex 418 | . . 3 ⊢ (𝜑 → (𝜓 → 𝑓 ∈ 𝒫 (𝑋 × 𝑌))) |
| 11 | 10 | abssdv 3995 | . 2 ⊢ (𝜑 → {𝑓 ∣ 𝜓} ⊆ 𝒫 (𝑋 × 𝑌)) |
| 12 | 4, 11 | ssexd 5293 | 1 ⊢ (𝜑 → {𝑓 ∣ 𝜓} ∈ V) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 ∈ wcel 2147 {cab 2741 Vcvv 3454 ⊆ wss 3900 𝒫 cpw 4560 × cxp 5656 ⟶wf 6562 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-ext 2735 ax-sep 5255 ax-pow 5334 ax-pr 5398 ax-un 7783 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-sb 2102 df-clab 2742 df-cleq 2755 df-clel 2839 df-ral 3081 df-rex 3091 df-rab 3417 df-v 3456 df-ss 3901 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-op 4841 df-uni 4873 df-br 5109 df-opab 5174 df-xp 5664 df-rel 5665 df-cnv 5666 df-dm 5668 df-rn 5669 df-fun 6568 df-fn 6569 df-f 6570 |
| This theorem is used by: fabexg 7984 f1oabexg 7987 grlimfn 49350 isgrlim 49353 |
| Copyright terms: Public domain | W3C validator |