| 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 7935 or fabexg 7934, 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 7749 | . . 3 ⊢ (𝜑 → (𝑋 × 𝑌) ∈ V) |
| 4 | 3 | pwexd 5351 | . 2 ⊢ (𝜑 → 𝒫 (𝑋 × 𝑌) ∈ V) |
| 5 | fabexd.f | . . . . 5 ⊢ ((𝜑 ∧ 𝜓) → 𝑓:𝑋⟶𝑌) | |
| 6 | fssxp 6734 | . . . . . 6 ⊢ (𝑓:𝑋⟶𝑌 → 𝑓 ⊆ (𝑋 × 𝑌)) | |
| 7 | velpw 4572 | . . . . . 6 ⊢ (𝑓 ∈ 𝒫 (𝑋 × 𝑌) ↔ 𝑓 ⊆ (𝑋 × 𝑌)) | |
| 8 | 6, 7 | sylibr 237 | . . . . 5 ⊢ (𝑓:𝑋⟶𝑌 → 𝑓 ∈ 𝒫 (𝑋 × 𝑌)) |
| 9 | 5, 8 | syl 18 | . . . 4 ⊢ ((𝜑 ∧ 𝜓) → 𝑓 ∈ 𝒫 (𝑋 × 𝑌)) |
| 10 | 9 | ex 417 | . . 3 ⊢ (𝜑 → (𝜓 → 𝑓 ∈ 𝒫 (𝑋 × 𝑌))) |
| 11 | 10 | abssdv 4029 | . 2 ⊢ (𝜑 → {𝑓 ∣ 𝜓} ⊆ 𝒫 (𝑋 × 𝑌)) |
| 12 | 4, 11 | ssexd 5295 | 1 ⊢ (𝜑 → {𝑓 ∣ 𝜓} ∈ V) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 400 ∈ wcel 2149 {cab 2747 Vcvv 3463 ⊆ wss 3913 𝒫 cpw 4567 × cxp 5660 ⟶wf 6533 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1822 ax-4 1836 ax-5 1937 ax-6 1994 ax-7 2035 ax-8 2151 ax-9 2159 ax-ext 2741 ax-sep 5261 ax-pow 5337 ax-pr 5405 ax-un 7733 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3an 1103 df-tru 1570 df-fal 1580 df-ex 1807 df-sb 2098 df-clab 2748 df-cleq 2761 df-clel 2844 df-ral 3086 df-rex 3096 df-rab 3424 df-v 3465 df-dif 3916 df-un 3918 df-in 3920 df-ss 3930 df-nul 4295 df-if 4493 df-pw 4569 df-sn 4595 df-pr 4597 df-op 4601 df-uni 4877 df-br 5114 df-opab 5178 df-xp 5668 df-rel 5669 df-cnv 5670 df-dm 5672 df-rn 5673 df-fun 6539 df-fn 6540 df-f 6541 |
| This theorem is referenced by: fabexg 7934 f1oabexg 7937 grlimfn 48632 isgrlim 48635 |
| Copyright terms: Public domain | W3C validator |