Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > fvpr1g | GIF version |
Description: The value of a function with a domain of (at most) two elements. (Contributed by Alexander van der Vekens, 3-Dec-2017.) |
Ref | Expression |
---|---|
fvpr1g | ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐶 ∈ 𝑊 ∧ 𝐴 ≠ 𝐵) → ({〈𝐴, 𝐶〉, 〈𝐵, 𝐷〉}‘𝐴) = 𝐶) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | df-pr 3578 | . . . . 5 ⊢ {〈𝐴, 𝐶〉, 〈𝐵, 𝐷〉} = ({〈𝐴, 𝐶〉} ∪ {〈𝐵, 𝐷〉}) | |
2 | 1 | fveq1i 5482 | . . . 4 ⊢ ({〈𝐴, 𝐶〉, 〈𝐵, 𝐷〉}‘𝐴) = (({〈𝐴, 𝐶〉} ∪ {〈𝐵, 𝐷〉})‘𝐴) |
3 | necom 2418 | . . . . 5 ⊢ (𝐴 ≠ 𝐵 ↔ 𝐵 ≠ 𝐴) | |
4 | fvunsng 5674 | . . . . 5 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ≠ 𝐴) → (({〈𝐴, 𝐶〉} ∪ {〈𝐵, 𝐷〉})‘𝐴) = ({〈𝐴, 𝐶〉}‘𝐴)) | |
5 | 3, 4 | sylan2b 285 | . . . 4 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐴 ≠ 𝐵) → (({〈𝐴, 𝐶〉} ∪ {〈𝐵, 𝐷〉})‘𝐴) = ({〈𝐴, 𝐶〉}‘𝐴)) |
6 | 2, 5 | syl5eq 2209 | . . 3 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐴 ≠ 𝐵) → ({〈𝐴, 𝐶〉, 〈𝐵, 𝐷〉}‘𝐴) = ({〈𝐴, 𝐶〉}‘𝐴)) |
7 | 6 | 3adant2 1005 | . 2 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐶 ∈ 𝑊 ∧ 𝐴 ≠ 𝐵) → ({〈𝐴, 𝐶〉, 〈𝐵, 𝐷〉}‘𝐴) = ({〈𝐴, 𝐶〉}‘𝐴)) |
8 | fvsng 5676 | . . 3 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐶 ∈ 𝑊) → ({〈𝐴, 𝐶〉}‘𝐴) = 𝐶) | |
9 | 8 | 3adant3 1006 | . 2 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐶 ∈ 𝑊 ∧ 𝐴 ≠ 𝐵) → ({〈𝐴, 𝐶〉}‘𝐴) = 𝐶) |
10 | 7, 9 | eqtrd 2197 | 1 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐶 ∈ 𝑊 ∧ 𝐴 ≠ 𝐵) → ({〈𝐴, 𝐶〉, 〈𝐵, 𝐷〉}‘𝐴) = 𝐶) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 103 ∧ w3a 967 = wceq 1342 ∈ wcel 2135 ≠ wne 2334 ∪ cun 3110 {csn 3571 {cpr 3572 〈cop 3574 ‘cfv 5183 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 105 ax-ia2 106 ax-ia3 107 ax-in1 604 ax-in2 605 ax-io 699 ax-5 1434 ax-7 1435 ax-gen 1436 ax-ie1 1480 ax-ie2 1481 ax-8 1491 ax-10 1492 ax-11 1493 ax-i12 1494 ax-bndl 1496 ax-4 1497 ax-17 1513 ax-i9 1517 ax-ial 1521 ax-i5r 1522 ax-14 2138 ax-ext 2146 ax-sep 4095 ax-pow 4148 ax-pr 4182 |
This theorem depends on definitions: df-bi 116 df-3an 969 df-tru 1345 df-fal 1348 df-nf 1448 df-sb 1750 df-eu 2016 df-mo 2017 df-clab 2151 df-cleq 2157 df-clel 2160 df-nfc 2295 df-ne 2335 df-ral 2447 df-rex 2448 df-v 2724 df-sbc 2948 df-dif 3114 df-un 3116 df-in 3118 df-ss 3125 df-nul 3406 df-pw 3556 df-sn 3577 df-pr 3578 df-op 3580 df-uni 3785 df-br 3978 df-opab 4039 df-id 4266 df-xp 4605 df-rel 4606 df-cnv 4607 df-co 4608 df-dm 4609 df-res 4611 df-iota 5148 df-fun 5185 df-fv 5191 |
This theorem is referenced by: fvtp1g 5688 |
Copyright terms: Public domain | W3C validator |