![]() |
Mathbox for Alexander van der Vekens |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > Mathboxes > mapprop | Structured version Visualization version GIF version |
Description: An unordered pair containing two ordered pairs as an element of the mapping operation. (Contributed by AV, 16-Apr-2019.) (Proof shortened by AV, 2-Jun-2024.) |
Ref | Expression |
---|---|
mapprop.f | ⊢ 𝐹 = {〈𝑋, 𝐴〉, 〈𝑌, 𝐵〉} |
Ref | Expression |
---|---|
mapprop | ⊢ (((𝑋 ∈ 𝑉 ∧ 𝐴 ∈ 𝑅) ∧ (𝑌 ∈ 𝑉 ∧ 𝐵 ∈ 𝑅) ∧ (𝑋 ≠ 𝑌 ∧ 𝑅 ∈ 𝑊)) → 𝐹 ∈ (𝑅 ↑m {𝑋, 𝑌})) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | mapprop.f | . 2 ⊢ 𝐹 = {〈𝑋, 𝐴〉, 〈𝑌, 𝐵〉} | |
2 | simp3r 1202 | . . 3 ⊢ (((𝑋 ∈ 𝑉 ∧ 𝐴 ∈ 𝑅) ∧ (𝑌 ∈ 𝑉 ∧ 𝐵 ∈ 𝑅) ∧ (𝑋 ≠ 𝑌 ∧ 𝑅 ∈ 𝑊)) → 𝑅 ∈ 𝑊) | |
3 | simpl 482 | . . . 4 ⊢ ((𝑋 ∈ 𝑉 ∧ 𝐴 ∈ 𝑅) → 𝑋 ∈ 𝑉) | |
4 | simpl 482 | . . . 4 ⊢ ((𝑌 ∈ 𝑉 ∧ 𝐵 ∈ 𝑅) → 𝑌 ∈ 𝑉) | |
5 | simpl 482 | . . . 4 ⊢ ((𝑋 ≠ 𝑌 ∧ 𝑅 ∈ 𝑊) → 𝑋 ≠ 𝑌) | |
6 | 3, 4, 5 | 3anim123i 1151 | . . 3 ⊢ (((𝑋 ∈ 𝑉 ∧ 𝐴 ∈ 𝑅) ∧ (𝑌 ∈ 𝑉 ∧ 𝐵 ∈ 𝑅) ∧ (𝑋 ≠ 𝑌 ∧ 𝑅 ∈ 𝑊)) → (𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉 ∧ 𝑋 ≠ 𝑌)) |
7 | simpr 484 | . . . . 5 ⊢ ((𝑋 ∈ 𝑉 ∧ 𝐴 ∈ 𝑅) → 𝐴 ∈ 𝑅) | |
8 | simpr 484 | . . . . 5 ⊢ ((𝑌 ∈ 𝑉 ∧ 𝐵 ∈ 𝑅) → 𝐵 ∈ 𝑅) | |
9 | 7, 8 | anim12i 612 | . . . 4 ⊢ (((𝑋 ∈ 𝑉 ∧ 𝐴 ∈ 𝑅) ∧ (𝑌 ∈ 𝑉 ∧ 𝐵 ∈ 𝑅)) → (𝐴 ∈ 𝑅 ∧ 𝐵 ∈ 𝑅)) |
10 | 9 | 3adant3 1132 | . . 3 ⊢ (((𝑋 ∈ 𝑉 ∧ 𝐴 ∈ 𝑅) ∧ (𝑌 ∈ 𝑉 ∧ 𝐵 ∈ 𝑅) ∧ (𝑋 ≠ 𝑌 ∧ 𝑅 ∈ 𝑊)) → (𝐴 ∈ 𝑅 ∧ 𝐵 ∈ 𝑅)) |
11 | fprmappr 48070 | . . 3 ⊢ ((𝑅 ∈ 𝑊 ∧ (𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉 ∧ 𝑋 ≠ 𝑌) ∧ (𝐴 ∈ 𝑅 ∧ 𝐵 ∈ 𝑅)) → {〈𝑋, 𝐴〉, 〈𝑌, 𝐵〉} ∈ (𝑅 ↑m {𝑋, 𝑌})) | |
12 | 2, 6, 10, 11 | syl3anc 1371 | . 2 ⊢ (((𝑋 ∈ 𝑉 ∧ 𝐴 ∈ 𝑅) ∧ (𝑌 ∈ 𝑉 ∧ 𝐵 ∈ 𝑅) ∧ (𝑋 ≠ 𝑌 ∧ 𝑅 ∈ 𝑊)) → {〈𝑋, 𝐴〉, 〈𝑌, 𝐵〉} ∈ (𝑅 ↑m {𝑋, 𝑌})) |
13 | 1, 12 | eqeltrid 2848 | 1 ⊢ (((𝑋 ∈ 𝑉 ∧ 𝐴 ∈ 𝑅) ∧ (𝑌 ∈ 𝑉 ∧ 𝐵 ∈ 𝑅) ∧ (𝑋 ≠ 𝑌 ∧ 𝑅 ∈ 𝑊)) → 𝐹 ∈ (𝑅 ↑m {𝑋, 𝑌})) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 395 ∧ w3a 1087 = wceq 1537 ∈ wcel 2108 ≠ wne 2946 {cpr 4650 〈cop 4654 (class class class)co 7448 ↑m cmap 8884 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1793 ax-4 1807 ax-5 1909 ax-6 1967 ax-7 2007 ax-8 2110 ax-9 2118 ax-10 2141 ax-11 2158 ax-12 2178 ax-ext 2711 ax-sep 5317 ax-nul 5324 ax-pow 5383 ax-pr 5447 ax-un 7770 |
This theorem depends on definitions: df-bi 207 df-an 396 df-or 847 df-3an 1089 df-tru 1540 df-fal 1550 df-ex 1778 df-nf 1782 df-sb 2065 df-mo 2543 df-eu 2572 df-clab 2718 df-cleq 2732 df-clel 2819 df-nfc 2895 df-ne 2947 df-ral 3068 df-rex 3077 df-rab 3444 df-v 3490 df-sbc 3805 df-dif 3979 df-un 3981 df-in 3983 df-ss 3993 df-nul 4353 df-if 4549 df-pw 4624 df-sn 4649 df-pr 4651 df-op 4655 df-uni 4932 df-br 5167 df-opab 5229 df-id 5593 df-xp 5706 df-rel 5707 df-cnv 5708 df-co 5709 df-dm 5710 df-rn 5711 df-iota 6525 df-fun 6575 df-fn 6576 df-f 6577 df-fv 6581 df-ov 7451 df-oprab 7452 df-mpo 7453 df-map 8886 |
This theorem is referenced by: lincvalpr 48147 ldepspr 48202 |
Copyright terms: Public domain | W3C validator |