Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > rnpropg | GIF version |
Description: The range of a pair of ordered pairs is the pair of second members. (Contributed by Thierry Arnoux, 3-Jan-2017.) |
Ref | Expression |
---|---|
rnpropg | ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → ran {〈𝐴, 𝐶〉, 〈𝐵, 𝐷〉} = {𝐶, 𝐷}) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | df-pr 3534 | . . 3 ⊢ {〈𝐴, 𝐶〉, 〈𝐵, 𝐷〉} = ({〈𝐴, 𝐶〉} ∪ {〈𝐵, 𝐷〉}) | |
2 | 1 | rneqi 4767 | . 2 ⊢ ran {〈𝐴, 𝐶〉, 〈𝐵, 𝐷〉} = ran ({〈𝐴, 𝐶〉} ∪ {〈𝐵, 𝐷〉}) |
3 | rnsnopg 5017 | . . . . 5 ⊢ (𝐴 ∈ 𝑉 → ran {〈𝐴, 𝐶〉} = {𝐶}) | |
4 | 3 | adantr 274 | . . . 4 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → ran {〈𝐴, 𝐶〉} = {𝐶}) |
5 | rnsnopg 5017 | . . . . 5 ⊢ (𝐵 ∈ 𝑊 → ran {〈𝐵, 𝐷〉} = {𝐷}) | |
6 | 5 | adantl 275 | . . . 4 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → ran {〈𝐵, 𝐷〉} = {𝐷}) |
7 | 4, 6 | uneq12d 3231 | . . 3 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (ran {〈𝐴, 𝐶〉} ∪ ran {〈𝐵, 𝐷〉}) = ({𝐶} ∪ {𝐷})) |
8 | rnun 4947 | . . 3 ⊢ ran ({〈𝐴, 𝐶〉} ∪ {〈𝐵, 𝐷〉}) = (ran {〈𝐴, 𝐶〉} ∪ ran {〈𝐵, 𝐷〉}) | |
9 | df-pr 3534 | . . 3 ⊢ {𝐶, 𝐷} = ({𝐶} ∪ {𝐷}) | |
10 | 7, 8, 9 | 3eqtr4g 2197 | . 2 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → ran ({〈𝐴, 𝐶〉} ∪ {〈𝐵, 𝐷〉}) = {𝐶, 𝐷}) |
11 | 2, 10 | syl5eq 2184 | 1 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → ran {〈𝐴, 𝐶〉, 〈𝐵, 𝐷〉} = {𝐶, 𝐷}) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 103 = wceq 1331 ∈ wcel 1480 ∪ cun 3069 {csn 3527 {cpr 3528 〈cop 3530 ran crn 4540 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 105 ax-ia2 106 ax-ia3 107 ax-io 698 ax-5 1423 ax-7 1424 ax-gen 1425 ax-ie1 1469 ax-ie2 1470 ax-8 1482 ax-10 1483 ax-11 1484 ax-i12 1485 ax-bndl 1486 ax-4 1487 ax-14 1492 ax-17 1506 ax-i9 1510 ax-ial 1514 ax-i5r 1515 ax-ext 2121 ax-sep 4046 ax-pow 4098 ax-pr 4131 |
This theorem depends on definitions: df-bi 116 df-3an 964 df-tru 1334 df-nf 1437 df-sb 1736 df-eu 2002 df-mo 2003 df-clab 2126 df-cleq 2132 df-clel 2135 df-nfc 2270 df-ral 2421 df-rex 2422 df-v 2688 df-un 3075 df-in 3077 df-ss 3084 df-pw 3512 df-sn 3533 df-pr 3534 df-op 3536 df-br 3930 df-opab 3990 df-xp 4545 df-rel 4546 df-cnv 4547 df-dm 4549 df-rn 4550 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |