| 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 6615 | . . 3 ⊢ (𝐴 ≠ 𝐵 → Fun {〈𝐴, 𝐶〉, 〈𝐵, 𝐷〉}) |
| 6 | 3, 4 | dmprop 6230 | . . 3 ⊢ dom {〈𝐴, 𝐶〉, 〈𝐵, 𝐷〉} = {𝐴, 𝐵} |
| 7 | df-fn 6558 | . . 3 ⊢ ({〈𝐴, 𝐶〉, 〈𝐵, 𝐷〉} Fn {𝐴, 𝐵} ↔ (Fun {〈𝐴, 𝐶〉, 〈𝐵, 𝐷〉} ∧ dom {〈𝐴, 𝐶〉, 〈𝐵, 𝐷〉} = {𝐴, 𝐵})) | |
| 8 | 5, 6, 7 | sylanblrc 602 | . 2 ⊢ (𝐴 ≠ 𝐵 → {〈𝐴, 𝐶〉, 〈𝐵, 𝐷〉} Fn {𝐴, 𝐵}) |
| 9 | df-pr 4591 | . . . . 5 ⊢ {〈𝐴, 𝐶〉, 〈𝐵, 𝐷〉} = ({〈𝐴, 𝐶〉} ∪ {〈𝐵, 𝐷〉}) | |
| 10 | 9 | rneqi 5925 | . . . 4 ⊢ ran {〈𝐴, 𝐶〉, 〈𝐵, 𝐷〉} = ran ({〈𝐴, 𝐶〉} ∪ {〈𝐵, 𝐷〉}) |
| 11 | rnun 6147 | . . . 4 ⊢ ran ({〈𝐴, 𝐶〉} ∪ {〈𝐵, 𝐷〉}) = (ran {〈𝐴, 𝐶〉} ∪ ran {〈𝐵, 𝐷〉}) | |
| 12 | 1 | rnsnop 6237 | . . . . . 6 ⊢ ran {〈𝐴, 𝐶〉} = {𝐶} |
| 13 | 2 | rnsnop 6237 | . . . . . 6 ⊢ ran {〈𝐵, 𝐷〉} = {𝐷} |
| 14 | 12, 13 | uneq12i 4168 | . . . . 5 ⊢ (ran {〈𝐴, 𝐶〉} ∪ ran {〈𝐵, 𝐷〉}) = ({𝐶} ∪ {𝐷}) |
| 15 | df-pr 4591 | . . . . 5 ⊢ {𝐶, 𝐷} = ({𝐶} ∪ {𝐷}) | |
| 16 | 14, 15 | eqtr4i 2789 | . . . 4 ⊢ (ran {〈𝐴, 𝐶〉} ∪ ran {〈𝐵, 𝐷〉}) = {𝐶, 𝐷} |
| 17 | 10, 11, 16 | 3eqtri 2790 | . . 3 ⊢ ran {〈𝐴, 𝐶〉, 〈𝐵, 𝐷〉} = {𝐶, 𝐷} |
| 18 | 17 | eqimssi 3973 | . 2 ⊢ ran {〈𝐴, 𝐶〉, 〈𝐵, 𝐷〉} ⊆ {𝐶, 𝐷} |
| 19 | df-f 6559 | . 2 ⊢ ({〈𝐴, 𝐶〉, 〈𝐵, 𝐷〉}:{𝐴, 𝐵}⟶{𝐶, 𝐷} ↔ ({〈𝐴, 𝐶〉, 〈𝐵, 𝐷〉} Fn {𝐴, 𝐵} ∧ ran {〈𝐴, 𝐶〉, 〈𝐵, 𝐷〉} ⊆ {𝐶, 𝐷})) | |
| 20 | 8, 18, 19 | sylanblrc 602 | 1 ⊢ (𝐴 ≠ 𝐵 → {〈𝐴, 𝐶〉, 〈𝐵, 𝐷〉}:{𝐴, 𝐵}⟶{𝐶, 𝐷}) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 = wceq 1570 ∈ wcel 2147 ≠ wne 2959 Vcvv 3454 ⊆ wss 3900 ∪ cun 4152 {csn 4588 {cpr 4590 〈cop 4838 dom cdm 5655 ran crn 5656 Fun wfun 6549 Fn wfn 6550 ⟶wf 6551 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-12 2216 ax-ext 2735 ax-sep 5252 ax-pr 5395 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-sb 2102 df-mo 2567 df-clab 2742 df-cleq 2755 df-clel 2839 df-ne 2960 df-ral 3081 df-rex 3091 df-rab 3417 df-v 3456 df-ss 3901 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-sn 4589 df-pr 4591 df-op 4839 df-br 5107 df-opab 5171 df-id 5550 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-rn 5666 df-fun 6557 df-fn 6558 df-f 6559 |
| This theorem is used by: fprg 7180 fprb 7219 axlowdimlem4 29550 coinfliprv 35182 poimirlem22 38751 nnsum3primes4 49089 nnsum3primesgbe 49093 |
| Copyright terms: Public domain | W3C validator |