| 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 6548 | . . 3 ⊢ (𝐴 ≠ 𝐵 → Fun {〈𝐴, 𝐶〉, 〈𝐵, 𝐷〉}) |
| 6 | 3, 4 | dmprop 6175 | . . 3 ⊢ dom {〈𝐴, 𝐶〉, 〈𝐵, 𝐷〉} = {𝐴, 𝐵} |
| 7 | df-fn 6495 | . . 3 ⊢ ({〈𝐴, 𝐶〉, 〈𝐵, 𝐷〉} Fn {𝐴, 𝐵} ↔ (Fun {〈𝐴, 𝐶〉, 〈𝐵, 𝐷〉} ∧ dom {〈𝐴, 𝐶〉, 〈𝐵, 𝐷〉} = {𝐴, 𝐵})) | |
| 8 | 5, 6, 7 | sylanblrc 590 | . 2 ⊢ (𝐴 ≠ 𝐵 → {〈𝐴, 𝐶〉, 〈𝐵, 𝐷〉} Fn {𝐴, 𝐵}) |
| 9 | df-pr 4583 | . . . . 5 ⊢ {〈𝐴, 𝐶〉, 〈𝐵, 𝐷〉} = ({〈𝐴, 𝐶〉} ∪ {〈𝐵, 𝐷〉}) | |
| 10 | 9 | rneqi 5886 | . . . 4 ⊢ ran {〈𝐴, 𝐶〉, 〈𝐵, 𝐷〉} = ran ({〈𝐴, 𝐶〉} ∪ {〈𝐵, 𝐷〉}) |
| 11 | rnun 6103 | . . . 4 ⊢ ran ({〈𝐴, 𝐶〉} ∪ {〈𝐵, 𝐷〉}) = (ran {〈𝐴, 𝐶〉} ∪ ran {〈𝐵, 𝐷〉}) | |
| 12 | 1 | rnsnop 6182 | . . . . . 6 ⊢ ran {〈𝐴, 𝐶〉} = {𝐶} |
| 13 | 2 | rnsnop 6182 | . . . . . 6 ⊢ ran {〈𝐵, 𝐷〉} = {𝐷} |
| 14 | 12, 13 | uneq12i 4118 | . . . . 5 ⊢ (ran {〈𝐴, 𝐶〉} ∪ ran {〈𝐵, 𝐷〉}) = ({𝐶} ∪ {𝐷}) |
| 15 | df-pr 4583 | . . . . 5 ⊢ {𝐶, 𝐷} = ({𝐶} ∪ {𝐷}) | |
| 16 | 14, 15 | eqtr4i 2762 | . . . 4 ⊢ (ran {〈𝐴, 𝐶〉} ∪ ran {〈𝐵, 𝐷〉}) = {𝐶, 𝐷} |
| 17 | 10, 11, 16 | 3eqtri 2763 | . . 3 ⊢ ran {〈𝐴, 𝐶〉, 〈𝐵, 𝐷〉} = {𝐶, 𝐷} |
| 18 | 17 | eqimssi 3994 | . 2 ⊢ ran {〈𝐴, 𝐶〉, 〈𝐵, 𝐷〉} ⊆ {𝐶, 𝐷} |
| 19 | df-f 6496 | . 2 ⊢ ({〈𝐴, 𝐶〉, 〈𝐵, 𝐷〉}:{𝐴, 𝐵}⟶{𝐶, 𝐷} ↔ ({〈𝐴, 𝐶〉, 〈𝐵, 𝐷〉} Fn {𝐴, 𝐵} ∧ ran {〈𝐴, 𝐶〉, 〈𝐵, 𝐷〉} ⊆ {𝐶, 𝐷})) | |
| 20 | 8, 18, 19 | sylanblrc 590 | 1 ⊢ (𝐴 ≠ 𝐵 → {〈𝐴, 𝐶〉, 〈𝐵, 𝐷〉}:{𝐴, 𝐵}⟶{𝐶, 𝐷}) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1541 ∈ wcel 2113 ≠ wne 2932 Vcvv 3440 ∪ cun 3899 ⊆ wss 3901 {csn 4580 {cpr 4582 〈cop 4586 dom cdm 5624 ran crn 5625 Fun wfun 6486 Fn wfn 6487 ⟶wf 6488 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-12 2184 ax-ext 2708 ax-sep 5241 ax-nul 5251 ax-pr 5377 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-sb 2068 df-mo 2539 df-clab 2715 df-cleq 2728 df-clel 2811 df-ne 2933 df-ral 3052 df-rex 3061 df-rab 3400 df-v 3442 df-dif 3904 df-un 3906 df-in 3908 df-ss 3918 df-nul 4286 df-if 4480 df-sn 4581 df-pr 4583 df-op 4587 df-br 5099 df-opab 5161 df-id 5519 df-xp 5630 df-rel 5631 df-cnv 5632 df-co 5633 df-dm 5634 df-rn 5635 df-fun 6494 df-fn 6495 df-f 6496 |
| This theorem is referenced by: fprg 7100 fprb 7140 axlowdimlem4 29020 coinfliprv 34642 poimirlem22 37845 nnsum3primes4 48055 nnsum3primesgbe 48059 |
| Copyright terms: Public domain | W3C validator |