| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > elfv2ex | Structured version Visualization version GIF version | ||
| Description: If a function value of a function value has a member, then the first argument is a set. (Contributed by AV, 8-Apr-2021.) |
| Ref | Expression |
|---|---|
| elfv2ex | ⊢ (𝐴 ∈ ((𝐹‘𝐵)‘𝐶) → 𝐵 ∈ V) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ax-1 6 | . 2 ⊢ (𝐵 ∈ V → (𝐴 ∈ ((𝐹‘𝐵)‘𝐶) → 𝐵 ∈ V)) | |
| 2 | fv2prc 6924 | . . . 4 ⊢ (¬ 𝐵 ∈ V → ((𝐹‘𝐵)‘𝐶) = ∅) | |
| 3 | 2 | eleq2d 2848 | . . 3 ⊢ (¬ 𝐵 ∈ V → (𝐴 ∈ ((𝐹‘𝐵)‘𝐶) ↔ 𝐴 ∈ ∅)) |
| 4 | noel 4287 | . . . 4 ⊢ ¬ 𝐴 ∈ ∅ | |
| 5 | 4 | pm2.21i 120 | . . 3 ⊢ (𝐴 ∈ ∅ → 𝐵 ∈ V) |
| 6 | 3, 5 | biimtrdi 256 | . 2 ⊢ (¬ 𝐵 ∈ V → (𝐴 ∈ ((𝐹‘𝐵)‘𝐶) → 𝐵 ∈ V)) |
| 7 | 1, 6 | pm2.61i 184 | 1 ⊢ (𝐴 ∈ ((𝐹‘𝐵)‘𝐶) → 𝐵 ∈ V) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 → wi 4 ∈ wcel 2145 Vcvv 3453 ∅c0 4282 ‘cfv 6537 |
| 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 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-ext 2734 ax-nul 5267 ax-pr 5402 |
| 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 2100 df-mo 2566 df-eu 2596 df-clab 2741 df-cleq 2754 df-clel 2837 df-ne 2958 df-rab 3415 df-v 3455 df-dif 3905 df-un 3907 df-ss 3919 df-nul 4283 df-if 4486 df-sn 4588 df-pr 4590 df-op 4594 df-uni 4871 df-br 5108 df-dm 5669 df-iota 6493 df-fv 6545 |
| This theorem is used by: 2arwcat 50534 |
| Copyright terms: Public domain | W3C validator |