| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > fpr | Structured version Visualization version GIF version | ||
| Description: A function with a domain of two elements. (Contributed by Jeff Madsen, 20-Jun-2010.) (Proof shortened by Andrew Salmon, 22-Oct-2011.) |
| Ref | Expression |
|---|---|
| fpr.1 | ⊢ 𝐴 ∈ V |
| fpr.2 | ⊢ 𝐵 ∈ V |
| fpr.3 | ⊢ 𝐶 ∈ V |
| fpr.4 | ⊢ 𝐷 ∈ V |
| Ref | Expression |
|---|---|
| fpr | ⊢ (𝐴 ≠ 𝐵 → {〈𝐴, 𝐶〉, 〈𝐵, 𝐷〉}:{𝐴, 𝐵}⟶{𝐶, 𝐷}) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | fpr.1 | . . . 4 ⊢ 𝐴 ∈ V | |
| 2 | fpr.2 | . . . 4 ⊢ 𝐵 ∈ V | |
| 3 | fpr.3 | . . . 4 ⊢ 𝐶 ∈ V | |
| 4 | fpr.4 | . . . 4 ⊢ 𝐷 ∈ V | |
| 5 | 1, 2, 3, 4 | funpr 6592 | . . 3 ⊢ (𝐴 ≠ 𝐵 → Fun {〈𝐴, 𝐶〉, 〈𝐵, 𝐷〉}) |
| 6 | 3, 4 | dmprop 6217 | . . 3 ⊢ dom {〈𝐴, 𝐶〉, 〈𝐵, 𝐷〉} = {𝐴, 𝐵} |
| 7 | df-fn 6539 | . . 3 ⊢ ({〈𝐴, 𝐶〉, 〈𝐵, 𝐷〉} Fn {𝐴, 𝐵} ↔ (Fun {〈𝐴, 𝐶〉, 〈𝐵, 𝐷〉} ∧ dom {〈𝐴, 𝐶〉, 〈𝐵, 𝐷〉} = {𝐴, 𝐵})) | |
| 8 | 5, 6, 7 | sylanblrc 601 | . 2 ⊢ (𝐴 ≠ 𝐵 → {〈𝐴, 𝐶〉, 〈𝐵, 𝐷〉} Fn {𝐴, 𝐵}) |
| 9 | df-pr 4591 | . . . . 5 ⊢ {〈𝐴, 𝐶〉, 〈𝐵, 𝐷〉} = ({〈𝐴, 𝐶〉} ∪ {〈𝐵, 𝐷〉}) | |
| 10 | 9 | rneqi 5926 | . . . 4 ⊢ ran {〈𝐴, 𝐶〉, 〈𝐵, 𝐷〉} = ran ({〈𝐴, 𝐶〉} ∪ {〈𝐵, 𝐷〉}) |
| 11 | rnun 6141 | . . . 4 ⊢ ran ({〈𝐴, 𝐶〉} ∪ {〈𝐵, 𝐷〉}) = (ran {〈𝐴, 𝐶〉} ∪ ran {〈𝐵, 𝐷〉}) | |
| 12 | 1 | rnsnop 6224 | . . . . . 6 ⊢ ran {〈𝐴, 𝐶〉} = {𝐶} |
| 13 | 2 | rnsnop 6224 | . . . . . 6 ⊢ ran {〈𝐵, 𝐷〉} = {𝐷} |
| 14 | 12, 13 | uneq12i 4119 | . . . . 5 ⊢ (ran {〈𝐴, 𝐶〉} ∪ ran {〈𝐵, 𝐷〉}) = ({𝐶} ∪ {𝐷}) |
| 15 | df-pr 4591 | . . . . 5 ⊢ {𝐶, 𝐷} = ({𝐶} ∪ {𝐷}) | |
| 16 | 14, 15 | eqtr4i 2788 | . . . 4 ⊢ (ran {〈𝐴, 𝐶〉} ∪ ran {〈𝐵, 𝐷〉}) = {𝐶, 𝐷} |
| 17 | 10, 11, 16 | 3eqtri 2789 | . . 3 ⊢ ran {〈𝐴, 𝐶〉, 〈𝐵, 𝐷〉} = {𝐶, 𝐷} |
| 18 | 17 | eqimssi 3996 | . 2 ⊢ ran {〈𝐴, 𝐶〉, 〈𝐵, 𝐷〉} ⊆ {𝐶, 𝐷} |
| 19 | df-f 6540 | . 2 ⊢ ({〈𝐴, 𝐶〉, 〈𝐵, 𝐷〉}:{𝐴, 𝐵}⟶{𝐶, 𝐷} ↔ ({〈𝐴, 𝐶〉, 〈𝐵, 𝐷〉} Fn {𝐴, 𝐵} ∧ ran {〈𝐴, 𝐶〉, 〈𝐵, 𝐷〉} ⊆ {𝐶, 𝐷})) | |
| 20 | 8, 18, 19 | sylanblrc 601 | 1 ⊢ (𝐴 ≠ 𝐵 → {〈𝐴, 𝐶〉, 〈𝐵, 𝐷〉}:{𝐴, 𝐵}⟶{𝐶, 𝐷}) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 = wceq 1569 ∈ wcel 2142 ≠ wne 2957 Vcvv 3454 ∪ cun 3902 ⊆ wss 3904 {csn 4588 {cpr 4590 〈cop 4594 dom cdm 5660 ran crn 5661 Fun wfun 6530 Fn wfn 6531 ⟶wf 6532 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1824 ax-4 1838 ax-5 1939 ax-6 1996 ax-7 2037 ax-8 2144 ax-9 2152 ax-12 2212 ax-ext 2734 ax-sep 5256 ax-pr 5403 |
| This proof depends on definitions: df-bi 210 df-an 401 df-or 861 df-3an 1104 df-tru 1572 df-fal 1582 df-ex 1809 df-sb 2096 df-mo 2566 df-clab 2741 df-cleq 2754 df-clel 2837 df-ne 2958 df-ral 3079 df-rex 3089 df-rab 3416 df-v 3456 df-dif 3907 df-un 3909 df-in 3911 df-ss 3921 df-nul 4286 df-if 4487 df-sn 4589 df-pr 4591 df-op 4595 df-br 5109 df-opab 5173 df-id 5555 df-xp 5666 df-rel 5667 df-cnv 5668 df-co 5669 df-dm 5670 df-rn 5671 df-fun 6538 df-fn 6539 df-f 6540 |
| This theorem is used by: fprg 7152 fprb 7192 axlowdimlem4 29306 coinfliprv 34882 poimirlem22 38321 nnsum3primes4 48581 nnsum3primesgbe 48585 |
| Copyright terms: Public domain | W3C validator |