![]() |
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 3626 | . . . . 5 ⊢ {〈𝐴, 𝐶〉, 〈𝐵, 𝐷〉} = ({〈𝐴, 𝐶〉} ∪ {〈𝐵, 𝐷〉}) | |
2 | 1 | fveq1i 5556 | . . . 4 ⊢ ({〈𝐴, 𝐶〉, 〈𝐵, 𝐷〉}‘𝐴) = (({〈𝐴, 𝐶〉} ∪ {〈𝐵, 𝐷〉})‘𝐴) |
3 | necom 2448 | . . . . 5 ⊢ (𝐴 ≠ 𝐵 ↔ 𝐵 ≠ 𝐴) | |
4 | fvunsng 5753 | . . . . 5 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ≠ 𝐴) → (({〈𝐴, 𝐶〉} ∪ {〈𝐵, 𝐷〉})‘𝐴) = ({〈𝐴, 𝐶〉}‘𝐴)) | |
5 | 3, 4 | sylan2b 287 | . . . 4 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐴 ≠ 𝐵) → (({〈𝐴, 𝐶〉} ∪ {〈𝐵, 𝐷〉})‘𝐴) = ({〈𝐴, 𝐶〉}‘𝐴)) |
6 | 2, 5 | eqtrid 2238 | . . 3 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐴 ≠ 𝐵) → ({〈𝐴, 𝐶〉, 〈𝐵, 𝐷〉}‘𝐴) = ({〈𝐴, 𝐶〉}‘𝐴)) |
7 | 6 | 3adant2 1018 | . 2 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐶 ∈ 𝑊 ∧ 𝐴 ≠ 𝐵) → ({〈𝐴, 𝐶〉, 〈𝐵, 𝐷〉}‘𝐴) = ({〈𝐴, 𝐶〉}‘𝐴)) |
8 | fvsng 5755 | . . 3 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐶 ∈ 𝑊) → ({〈𝐴, 𝐶〉}‘𝐴) = 𝐶) | |
9 | 8 | 3adant3 1019 | . 2 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐶 ∈ 𝑊 ∧ 𝐴 ≠ 𝐵) → ({〈𝐴, 𝐶〉}‘𝐴) = 𝐶) |
10 | 7, 9 | eqtrd 2226 | 1 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐶 ∈ 𝑊 ∧ 𝐴 ≠ 𝐵) → ({〈𝐴, 𝐶〉, 〈𝐵, 𝐷〉}‘𝐴) = 𝐶) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 104 ∧ w3a 980 = wceq 1364 ∈ wcel 2164 ≠ wne 2364 ∪ cun 3152 {csn 3619 {cpr 3620 〈cop 3622 ‘cfv 5255 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 615 ax-in2 616 ax-io 710 ax-5 1458 ax-7 1459 ax-gen 1460 ax-ie1 1504 ax-ie2 1505 ax-8 1515 ax-10 1516 ax-11 1517 ax-i12 1518 ax-bndl 1520 ax-4 1521 ax-17 1537 ax-i9 1541 ax-ial 1545 ax-i5r 1546 ax-14 2167 ax-ext 2175 ax-sep 4148 ax-pow 4204 ax-pr 4239 |
This theorem depends on definitions: df-bi 117 df-3an 982 df-tru 1367 df-fal 1370 df-nf 1472 df-sb 1774 df-eu 2045 df-mo 2046 df-clab 2180 df-cleq 2186 df-clel 2189 df-nfc 2325 df-ne 2365 df-ral 2477 df-rex 2478 df-v 2762 df-sbc 2987 df-dif 3156 df-un 3158 df-in 3160 df-ss 3167 df-nul 3448 df-pw 3604 df-sn 3625 df-pr 3626 df-op 3628 df-uni 3837 df-br 4031 df-opab 4092 df-id 4325 df-xp 4666 df-rel 4667 df-cnv 4668 df-co 4669 df-dm 4670 df-res 4672 df-iota 5216 df-fun 5257 df-fv 5263 |
This theorem is referenced by: fvtp1g 5767 fvpr0o 12927 |
Copyright terms: Public domain | W3C validator |