| 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 6585 | . . 3 ⊢ (𝐴 ≠ 𝐵 → Fun {〈𝐴, 𝐶〉, 〈𝐵, 𝐷〉}) |
| 6 | 3, 4 | dmprop 6208 | . . 3 ⊢ dom {〈𝐴, 𝐶〉, 〈𝐵, 𝐷〉} = {𝐴, 𝐵} |
| 7 | df-fn 6531 | . . 3 ⊢ ({〈𝐴, 𝐶〉, 〈𝐵, 𝐷〉} Fn {𝐴, 𝐵} ↔ (Fun {〈𝐴, 𝐶〉, 〈𝐵, 𝐷〉} ∧ dom {〈𝐴, 𝐶〉, 〈𝐵, 𝐷〉} = {𝐴, 𝐵})) | |
| 8 | 5, 6, 7 | sylanblrc 602 | . 2 ⊢ (𝐴 ≠ 𝐵 → {〈𝐴, 𝐶〉, 〈𝐵, 𝐷〉} Fn {𝐴, 𝐵}) |
| 9 | df-pr 4587 | . . . . 5 ⊢ {〈𝐴, 𝐶〉, 〈𝐵, 𝐷〉} = ({〈𝐴, 𝐶〉} ∪ {〈𝐵, 𝐷〉}) | |
| 10 | 9 | rneqi 5916 | . . . 4 ⊢ ran {〈𝐴, 𝐶〉, 〈𝐵, 𝐷〉} = ran ({〈𝐴, 𝐶〉} ∪ {〈𝐵, 𝐷〉}) |
| 11 | rnun 6131 | . . . 4 ⊢ ran ({〈𝐴, 𝐶〉} ∪ {〈𝐵, 𝐷〉}) = (ran {〈𝐴, 𝐶〉} ∪ ran {〈𝐵, 𝐷〉}) | |
| 12 | 1 | rnsnop 6215 | . . . . . 6 ⊢ ran {〈𝐴, 𝐶〉} = {𝐶} |
| 13 | 2 | rnsnop 6215 | . . . . . 6 ⊢ ran {〈𝐵, 𝐷〉} = {𝐷} |
| 14 | 12, 13 | uneq12i 4113 | . . . . 5 ⊢ (ran {〈𝐴, 𝐶〉} ∪ ran {〈𝐵, 𝐷〉}) = ({𝐶} ∪ {𝐷}) |
| 15 | df-pr 4587 | . . . . 5 ⊢ {𝐶, 𝐷} = ({𝐶} ∪ {𝐷}) | |
| 16 | 14, 15 | eqtr4i 2786 | . . . 4 ⊢ (ran {〈𝐴, 𝐶〉} ∪ ran {〈𝐵, 𝐷〉}) = {𝐶, 𝐷} |
| 17 | 10, 11, 16 | 3eqtri 2787 | . . 3 ⊢ ran {〈𝐴, 𝐶〉, 〈𝐵, 𝐷〉} = {𝐶, 𝐷} |
| 18 | 17 | eqimssi 3991 | . 2 ⊢ ran {〈𝐴, 𝐶〉, 〈𝐵, 𝐷〉} ⊆ {𝐶, 𝐷} |
| 19 | df-f 6532 | . 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 2145 ≠ wne 2955 Vcvv 3450 ∪ cun 3897 ⊆ wss 3899 {csn 4584 {cpr 4586 〈cop 4590 dom cdm 5648 ran crn 5649 Fun wfun 6522 Fn wfn 6523 ⟶wf 6524 |
| 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 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-12 2213 ax-ext 2732 ax-sep 5249 ax-pr 5391 |
| 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 2100 df-mo 2564 df-clab 2739 df-cleq 2752 df-clel 2835 df-ne 2956 df-ral 3077 df-rex 3087 df-rab 3413 df-v 3452 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-nul 4280 df-if 4483 df-sn 4585 df-pr 4587 df-op 4591 df-br 5104 df-opab 5168 df-id 5543 df-xp 5654 df-rel 5655 df-cnv 5656 df-co 5657 df-dm 5658 df-rn 5659 df-fun 6530 df-fn 6531 df-f 6532 |
| This theorem is used by: fprg 7148 fprb 7188 axlowdimlem4 29442 coinfliprv 35035 poimirlem22 38474 nnsum3primes4 48802 nnsum3primesgbe 48806 |
| Copyright terms: Public domain | W3C validator |