| 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 7932 or fabexg 7931, 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 7746 | . . 3 ⊢ (𝜑 → (𝑋 × 𝑌) ∈ V) |
| 4 | 3 | pwexd 5350 | . 2 ⊢ (𝜑 → 𝒫 (𝑋 × 𝑌) ∈ V) |
| 5 | fabexd.f | . . . . 5 ⊢ ((𝜑 ∧ 𝜓) → 𝑓:𝑋⟶𝑌) | |
| 6 | fssxp 6733 | . . . . . 6 ⊢ (𝑓:𝑋⟶𝑌 → 𝑓 ⊆ (𝑋 × 𝑌)) | |
| 7 | velpw 4567 | . . . . . 6 ⊢ (𝑓 ∈ 𝒫 (𝑋 × 𝑌) ↔ 𝑓 ⊆ (𝑋 × 𝑌)) | |
| 8 | 6, 7 | sylibr 237 | . . . . 5 ⊢ (𝑓:𝑋⟶𝑌 → 𝑓 ∈ 𝒫 (𝑋 × 𝑌)) |
| 9 | 5, 8 | syl 18 | . . . 4 ⊢ ((𝜑 ∧ 𝜓) → 𝑓 ∈ 𝒫 (𝑋 × 𝑌)) |
| 10 | 9 | ex 417 | . . 3 ⊢ (𝜑 → (𝜓 → 𝑓 ∈ 𝒫 (𝑋 × 𝑌))) |
| 11 | 10 | abssdv 4021 | . 2 ⊢ (𝜑 → {𝑓 ∣ 𝜓} ⊆ 𝒫 (𝑋 × 𝑌)) |
| 12 | 4, 11 | ssexd 5295 | 1 ⊢ (𝜑 → {𝑓 ∣ 𝜓} ∈ V) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 400 ∈ wcel 2143 {cab 2741 Vcvv 3455 ⊆ wss 3905 𝒫 cpw 4562 × cxp 5659 ⟶wf 6532 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1825 ax-4 1839 ax-5 1940 ax-6 1997 ax-7 2038 ax-8 2145 ax-9 2153 ax-ext 2735 ax-sep 5257 ax-pow 5336 ax-pr 5404 ax-un 7732 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1810 df-sb 2097 df-clab 2742 df-cleq 2755 df-clel 2838 df-ral 3080 df-rex 3090 df-rab 3417 df-v 3457 df-dif 3908 df-un 3910 df-in 3912 df-ss 3922 df-nul 4287 df-if 4488 df-pw 4564 df-sn 4590 df-pr 4592 df-op 4596 df-uni 4873 df-br 5110 df-opab 5174 df-xp 5667 df-rel 5668 df-cnv 5669 df-dm 5671 df-rn 5672 df-fun 6538 df-fn 6539 df-f 6540 |
| This theorem is referenced by: fabexg 7931 f1oabexg 7934 grlimfn 48764 isgrlim 48767 |
| Copyright terms: Public domain | W3C validator |