Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > fvtp3g | Structured version Visualization version GIF version |
Description: The value of a function with a domain of (at most) three elements. (Contributed by Alexander van der Vekens, 4-Dec-2017.) |
Ref | Expression |
---|---|
fvtp3g | ⊢ (((𝐶 ∈ 𝑉 ∧ 𝐹 ∈ 𝑊) ∧ (𝐴 ≠ 𝐶 ∧ 𝐵 ≠ 𝐶)) → ({〈𝐴, 𝐷〉, 〈𝐵, 𝐸〉, 〈𝐶, 𝐹〉}‘𝐶) = 𝐹) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | tprot 4228 | . . 3 ⊢ {〈𝐴, 𝐷〉, 〈𝐵, 𝐸〉, 〈𝐶, 𝐹〉} = {〈𝐵, 𝐸〉, 〈𝐶, 𝐹〉, 〈𝐴, 𝐷〉} | |
2 | 1 | fveq1i 6104 | . 2 ⊢ ({〈𝐴, 𝐷〉, 〈𝐵, 𝐸〉, 〈𝐶, 𝐹〉}‘𝐶) = ({〈𝐵, 𝐸〉, 〈𝐶, 𝐹〉, 〈𝐴, 𝐷〉}‘𝐶) |
3 | necom 2835 | . . . . 5 ⊢ (𝐴 ≠ 𝐶 ↔ 𝐶 ≠ 𝐴) | |
4 | fvtp2g 6369 | . . . . . 6 ⊢ (((𝐶 ∈ 𝑉 ∧ 𝐹 ∈ 𝑊) ∧ (𝐵 ≠ 𝐶 ∧ 𝐶 ≠ 𝐴)) → ({〈𝐵, 𝐸〉, 〈𝐶, 𝐹〉, 〈𝐴, 𝐷〉}‘𝐶) = 𝐹) | |
5 | 4 | expcom 450 | . . . . 5 ⊢ ((𝐵 ≠ 𝐶 ∧ 𝐶 ≠ 𝐴) → ((𝐶 ∈ 𝑉 ∧ 𝐹 ∈ 𝑊) → ({〈𝐵, 𝐸〉, 〈𝐶, 𝐹〉, 〈𝐴, 𝐷〉}‘𝐶) = 𝐹)) |
6 | 3, 5 | sylan2b 491 | . . . 4 ⊢ ((𝐵 ≠ 𝐶 ∧ 𝐴 ≠ 𝐶) → ((𝐶 ∈ 𝑉 ∧ 𝐹 ∈ 𝑊) → ({〈𝐵, 𝐸〉, 〈𝐶, 𝐹〉, 〈𝐴, 𝐷〉}‘𝐶) = 𝐹)) |
7 | 6 | ancoms 468 | . . 3 ⊢ ((𝐴 ≠ 𝐶 ∧ 𝐵 ≠ 𝐶) → ((𝐶 ∈ 𝑉 ∧ 𝐹 ∈ 𝑊) → ({〈𝐵, 𝐸〉, 〈𝐶, 𝐹〉, 〈𝐴, 𝐷〉}‘𝐶) = 𝐹)) |
8 | 7 | impcom 445 | . 2 ⊢ (((𝐶 ∈ 𝑉 ∧ 𝐹 ∈ 𝑊) ∧ (𝐴 ≠ 𝐶 ∧ 𝐵 ≠ 𝐶)) → ({〈𝐵, 𝐸〉, 〈𝐶, 𝐹〉, 〈𝐴, 𝐷〉}‘𝐶) = 𝐹) |
9 | 2, 8 | syl5eq 2656 | 1 ⊢ (((𝐶 ∈ 𝑉 ∧ 𝐹 ∈ 𝑊) ∧ (𝐴 ≠ 𝐶 ∧ 𝐵 ≠ 𝐶)) → ({〈𝐴, 𝐷〉, 〈𝐵, 𝐸〉, 〈𝐶, 𝐹〉}‘𝐶) = 𝐹) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 383 = wceq 1475 ∈ wcel 1977 ≠ wne 2780 {ctp 4129 〈cop 4131 ‘cfv 5804 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1713 ax-4 1728 ax-5 1827 ax-6 1875 ax-7 1922 ax-8 1979 ax-9 1986 ax-10 2006 ax-11 2021 ax-12 2034 ax-13 2234 ax-ext 2590 ax-sep 4709 ax-nul 4717 ax-pow 4769 ax-pr 4833 |
This theorem depends on definitions: df-bi 196 df-or 384 df-an 385 df-3or 1032 df-3an 1033 df-tru 1478 df-ex 1696 df-nf 1701 df-sb 1868 df-eu 2462 df-mo 2463 df-clab 2597 df-cleq 2603 df-clel 2606 df-nfc 2740 df-ne 2782 df-ral 2901 df-rex 2902 df-rab 2905 df-v 3175 df-sbc 3403 df-dif 3543 df-un 3545 df-in 3547 df-ss 3554 df-nul 3875 df-if 4037 df-sn 4126 df-pr 4128 df-tp 4130 df-op 4132 df-uni 4373 df-br 4584 df-opab 4644 df-id 4953 df-xp 5044 df-rel 5045 df-cnv 5046 df-co 5047 df-dm 5048 df-res 5050 df-iota 5768 df-fun 5806 df-fv 5812 |
This theorem is referenced by: 2wlklemC 26086 2pthon 26132 |
Copyright terms: Public domain | W3C validator |