Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > fvpr2OLD | Structured version Visualization version GIF version |
Description: Obsolete version of fvpr2 7046 as of 26-Sep-2024. (Contributed by Jeff Madsen, 20-Jun-2010.) (Proof modification is discouraged.) (New usage is discouraged.) |
Ref | Expression |
---|---|
fvpr2.1 | ⊢ 𝐵 ∈ V |
fvpr2.2 | ⊢ 𝐷 ∈ V |
Ref | Expression |
---|---|
fvpr2OLD | ⊢ (𝐴 ≠ 𝐵 → ({〈𝐴, 𝐶〉, 〈𝐵, 𝐷〉}‘𝐵) = 𝐷) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | prcom 4665 | . . 3 ⊢ {〈𝐴, 𝐶〉, 〈𝐵, 𝐷〉} = {〈𝐵, 𝐷〉, 〈𝐴, 𝐶〉} | |
2 | 1 | fveq1i 6754 | . 2 ⊢ ({〈𝐴, 𝐶〉, 〈𝐵, 𝐷〉}‘𝐵) = ({〈𝐵, 𝐷〉, 〈𝐴, 𝐶〉}‘𝐵) |
3 | necom 2997 | . . 3 ⊢ (𝐴 ≠ 𝐵 ↔ 𝐵 ≠ 𝐴) | |
4 | fvpr2.1 | . . . 4 ⊢ 𝐵 ∈ V | |
5 | fvpr2.2 | . . . 4 ⊢ 𝐷 ∈ V | |
6 | 4, 5 | fvpr1 7044 | . . 3 ⊢ (𝐵 ≠ 𝐴 → ({〈𝐵, 𝐷〉, 〈𝐴, 𝐶〉}‘𝐵) = 𝐷) |
7 | 3, 6 | sylbi 220 | . 2 ⊢ (𝐴 ≠ 𝐵 → ({〈𝐵, 𝐷〉, 〈𝐴, 𝐶〉}‘𝐵) = 𝐷) |
8 | 2, 7 | syl5eq 2792 | 1 ⊢ (𝐴 ≠ 𝐵 → ({〈𝐴, 𝐶〉, 〈𝐵, 𝐷〉}‘𝐵) = 𝐷) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 = wceq 1543 ∈ wcel 2112 ≠ wne 2943 Vcvv 3423 {cpr 4560 〈cop 4564 ‘cfv 6415 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1803 ax-4 1817 ax-5 1918 ax-6 1976 ax-7 2016 ax-8 2114 ax-9 2122 ax-10 2143 ax-11 2160 ax-12 2177 ax-ext 2710 ax-sep 5216 ax-nul 5223 ax-pr 5346 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 848 df-3an 1091 df-tru 1546 df-fal 1556 df-ex 1788 df-nf 1792 df-sb 2073 df-mo 2541 df-eu 2570 df-clab 2717 df-cleq 2731 df-clel 2818 df-nfc 2889 df-ne 2944 df-ral 3069 df-rex 3070 df-rab 3073 df-v 3425 df-dif 3887 df-un 3889 df-in 3891 df-ss 3901 df-nul 4255 df-if 4457 df-sn 4559 df-pr 4561 df-op 4565 df-uni 4837 df-br 5071 df-opab 5133 df-id 5479 df-xp 5585 df-rel 5586 df-cnv 5587 df-co 5588 df-dm 5589 df-res 5591 df-iota 6373 df-fun 6417 df-fv 6423 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |