| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > fveqprc | Structured version Visualization version GIF version | ||
| Description: Lemma for showing the equality of values for functions like slot extractors 𝐸 at a proper class. Extracted from several former proofs of lemmas like zlmlem 21879. (Contributed by AV, 31-Oct-2024.) |
| Ref | Expression |
|---|---|
| fveqprc.e | ⊢ (𝐸‘∅) = ∅ |
| fveqprc.y | ⊢ 𝑌 = (𝐹‘𝑋) |
| Ref | Expression |
|---|---|
| fveqprc | ⊢ (¬ 𝑋 ∈ V → (𝐸‘𝑋) = (𝐸‘𝑌)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | fveqprc.e | . . 3 ⊢ (𝐸‘∅) = ∅ | |
| 2 | 1 | eqcomi 2775 | . 2 ⊢ ∅ = (𝐸‘∅) |
| 3 | fvprc 6907 | . 2 ⊢ (¬ 𝑋 ∈ V → (𝐸‘𝑋) = ∅) | |
| 4 | fveqprc.y | . . . 4 ⊢ 𝑌 = (𝐹‘𝑋) | |
| 5 | fvprc 6907 | . . . 4 ⊢ (¬ 𝑋 ∈ V → (𝐹‘𝑋) = ∅) | |
| 6 | 4, 5 | eqtrid 2813 | . . 3 ⊢ (¬ 𝑋 ∈ V → 𝑌 = ∅) |
| 7 | 6 | fveq2d 6919 | . 2 ⊢ (¬ 𝑋 ∈ V → (𝐸‘𝑌) = (𝐸‘∅)) |
| 8 | 2, 3, 7 | 3eqtr4a 2827 | 1 ⊢ (¬ 𝑋 ∈ V → (𝐸‘𝑋) = (𝐸‘𝑌)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 → wi 4 = wceq 1572 ∈ wcel 2150 Vcvv 3453 ∅c0 4280 ‘cfv 6565 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1830 ax-4 1844 ax-5 1947 ax-6 2004 ax-7 2045 ax-8 2152 ax-9 2160 ax-ext 2738 ax-nul 5265 ax-pr 5397 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1106 df-tru 1575 df-fal 1585 df-ex 1815 df-sb 2104 df-mo 2570 df-eu 2600 df-clab 2745 df-cleq 2758 df-clel 2842 df-ne 2963 df-rab 3416 df-v 3455 df-ss 3900 df-dif 4049 df-un 4153 df-nul 4281 df-if 4485 df-sn 4588 df-pr 4590 df-op 4840 df-uni 4872 df-br 5108 df-iota 6519 df-fv 6573 |
| This theorem is used by: oppcbas 17944 zlmlem 21879 ttglem 29512 mendsca 44447 |
| Copyright terms: Public domain | W3C validator |