2ndpreima - Mathbox for Thierry Arnoux

	Mathbox for Thierry Arnoux		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > Mathboxes > 2ndpreima		Structured version Visualization version GIF version

Theorem 2ndpreima 31916

Description: The preimage by 2^nd is an 'horizontal band'. (Contributed by Thierry Arnoux, 13-Oct-2017.)

**Assertion**
Ref	Expression
2ndpreima	⊢ (𝐴 ⊆ 𝐶 → (^◡(2^nd ↾ (𝐵 × 𝐶)) “ 𝐴) = (𝐵 × 𝐴))

Proof of Theorem 2ndpreima Dummy variable 𝑤 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		elxp7 8006	. . . . . 6 ⊢ (𝑤 ∈ (𝐵 × 𝐶) ↔ (𝑤 ∈ (V × V) ∧ ((1^st ‘𝑤) ∈ 𝐵 ∧ (2^nd ‘𝑤) ∈ 𝐶)))
2	1	anbi1i 624	. . . . 5 ⊢ ((𝑤 ∈ (𝐵 × 𝐶) ∧ (2^nd ‘𝑤) ∈ 𝐴) ↔ ((𝑤 ∈ (V × V) ∧ ((1^st ‘𝑤) ∈ 𝐵 ∧ (2^nd ‘𝑤) ∈ 𝐶)) ∧ (2^nd ‘𝑤) ∈ 𝐴))
3		ssel 3974	. . . . . . . 8 ⊢ (𝐴 ⊆ 𝐶 → ((2^nd ‘𝑤) ∈ 𝐴 → (2^nd ‘𝑤) ∈ 𝐶))
4	3	pm4.71rd 563	. . . . . . 7 ⊢ (𝐴 ⊆ 𝐶 → ((2^nd ‘𝑤) ∈ 𝐴 ↔ ((2^nd ‘𝑤) ∈ 𝐶 ∧ (2^nd ‘𝑤) ∈ 𝐴)))
5	4	anbi2d 629	. . . . . 6 ⊢ (𝐴 ⊆ 𝐶 → (((𝑤 ∈ (V × V) ∧ (1^st ‘𝑤) ∈ 𝐵) ∧ (2^nd ‘𝑤) ∈ 𝐴) ↔ ((𝑤 ∈ (V × V) ∧ (1^st ‘𝑤) ∈ 𝐵) ∧ ((2^nd ‘𝑤) ∈ 𝐶 ∧ (2^nd ‘𝑤) ∈ 𝐴))))
6		anass 469	. . . . . . . 8 ⊢ ((((𝑤 ∈ (V × V) ∧ (1^st ‘𝑤) ∈ 𝐵) ∧ (2^nd ‘𝑤) ∈ 𝐶) ∧ (2^nd ‘𝑤) ∈ 𝐴) ↔ ((𝑤 ∈ (V × V) ∧ (1^st ‘𝑤) ∈ 𝐵) ∧ ((2^nd ‘𝑤) ∈ 𝐶 ∧ (2^nd ‘𝑤) ∈ 𝐴)))
7	6	bicomi 223	. . . . . . 7 ⊢ (((𝑤 ∈ (V × V) ∧ (1^st ‘𝑤) ∈ 𝐵) ∧ ((2^nd ‘𝑤) ∈ 𝐶 ∧ (2^nd ‘𝑤) ∈ 𝐴)) ↔ (((𝑤 ∈ (V × V) ∧ (1^st ‘𝑤) ∈ 𝐵) ∧ (2^nd ‘𝑤) ∈ 𝐶) ∧ (2^nd ‘𝑤) ∈ 𝐴))
8	7	a1i 11	. . . . . 6 ⊢ (𝐴 ⊆ 𝐶 → (((𝑤 ∈ (V × V) ∧ (1^st ‘𝑤) ∈ 𝐵) ∧ ((2^nd ‘𝑤) ∈ 𝐶 ∧ (2^nd ‘𝑤) ∈ 𝐴)) ↔ (((𝑤 ∈ (V × V) ∧ (1^st ‘𝑤) ∈ 𝐵) ∧ (2^nd ‘𝑤) ∈ 𝐶) ∧ (2^nd ‘𝑤) ∈ 𝐴)))
9		anass 469	. . . . . . . 8 ⊢ (((𝑤 ∈ (V × V) ∧ (1^st ‘𝑤) ∈ 𝐵) ∧ (2^nd ‘𝑤) ∈ 𝐶) ↔ (𝑤 ∈ (V × V) ∧ ((1^st ‘𝑤) ∈ 𝐵 ∧ (2^nd ‘𝑤) ∈ 𝐶)))
10	9	anbi1i 624	. . . . . . 7 ⊢ ((((𝑤 ∈ (V × V) ∧ (1^st ‘𝑤) ∈ 𝐵) ∧ (2^nd ‘𝑤) ∈ 𝐶) ∧ (2^nd ‘𝑤) ∈ 𝐴) ↔ ((𝑤 ∈ (V × V) ∧ ((1^st ‘𝑤) ∈ 𝐵 ∧ (2^nd ‘𝑤) ∈ 𝐶)) ∧ (2^nd ‘𝑤) ∈ 𝐴))
11	10	a1i 11	. . . . . 6 ⊢ (𝐴 ⊆ 𝐶 → ((((𝑤 ∈ (V × V) ∧ (1^st ‘𝑤) ∈ 𝐵) ∧ (2^nd ‘𝑤) ∈ 𝐶) ∧ (2^nd ‘𝑤) ∈ 𝐴) ↔ ((𝑤 ∈ (V × V) ∧ ((1^st ‘𝑤) ∈ 𝐵 ∧ (2^nd ‘𝑤) ∈ 𝐶)) ∧ (2^nd ‘𝑤) ∈ 𝐴)))
12	5, 8, 11	3bitrd 304	. . . . 5 ⊢ (𝐴 ⊆ 𝐶 → (((𝑤 ∈ (V × V) ∧ (1^st ‘𝑤) ∈ 𝐵) ∧ (2^nd ‘𝑤) ∈ 𝐴) ↔ ((𝑤 ∈ (V × V) ∧ ((1^st ‘𝑤) ∈ 𝐵 ∧ (2^nd ‘𝑤) ∈ 𝐶)) ∧ (2^nd ‘𝑤) ∈ 𝐴)))
13	2, 12	bitr4id 289	. . . 4 ⊢ (𝐴 ⊆ 𝐶 → ((𝑤 ∈ (𝐵 × 𝐶) ∧ (2^nd ‘𝑤) ∈ 𝐴) ↔ ((𝑤 ∈ (V × V) ∧ (1^st ‘𝑤) ∈ 𝐵) ∧ (2^nd ‘𝑤) ∈ 𝐴)))
14		ancom 461	. . . 4 ⊢ ((𝑤 ∈ (𝐵 × 𝐶) ∧ (2^nd ‘𝑤) ∈ 𝐴) ↔ ((2^nd ‘𝑤) ∈ 𝐴 ∧ 𝑤 ∈ (𝐵 × 𝐶)))
15		anass 469	. . . 4 ⊢ (((𝑤 ∈ (V × V) ∧ (1^st ‘𝑤) ∈ 𝐵) ∧ (2^nd ‘𝑤) ∈ 𝐴) ↔ (𝑤 ∈ (V × V) ∧ ((1^st ‘𝑤) ∈ 𝐵 ∧ (2^nd ‘𝑤) ∈ 𝐴)))
16	13, 14, 15	3bitr3g 312	. . 3 ⊢ (𝐴 ⊆ 𝐶 → (((2^nd ‘𝑤) ∈ 𝐴 ∧ 𝑤 ∈ (𝐵 × 𝐶)) ↔ (𝑤 ∈ (V × V) ∧ ((1^st ‘𝑤) ∈ 𝐵 ∧ (2^nd ‘𝑤) ∈ 𝐴))))
17		cnvresima 6226	. . . . 5 ⊢ (^◡(2^nd ↾ (𝐵 × 𝐶)) “ 𝐴) = ((^◡2^nd “ 𝐴) ∩ (𝐵 × 𝐶))
18	17	eleq2i 2825	. . . 4 ⊢ (𝑤 ∈ (^◡(2^nd ↾ (𝐵 × 𝐶)) “ 𝐴) ↔ 𝑤 ∈ ((^◡2^nd “ 𝐴) ∩ (𝐵 × 𝐶)))
19		elin 3963	. . . 4 ⊢ (𝑤 ∈ ((^◡2^nd “ 𝐴) ∩ (𝐵 × 𝐶)) ↔ (𝑤 ∈ (^◡2^nd “ 𝐴) ∧ 𝑤 ∈ (𝐵 × 𝐶)))
20		vex 3478	. . . . . 6 ⊢ 𝑤 ∈ V
21		fo2nd 7992	. . . . . . 7 ⊢ 2^nd :V–onto→V
22		fofn 6804	. . . . . . 7 ⊢ (2^nd :V–onto→V → 2^nd Fn V)
23		elpreima 7056	. . . . . . 7 ⊢ (2^nd Fn V → (𝑤 ∈ (^◡2^nd “ 𝐴) ↔ (𝑤 ∈ V ∧ (2^nd ‘𝑤) ∈ 𝐴)))
24	21, 22, 23	mp2b 10	. . . . . 6 ⊢ (𝑤 ∈ (^◡2^nd “ 𝐴) ↔ (𝑤 ∈ V ∧ (2^nd ‘𝑤) ∈ 𝐴))
25	20, 24	mpbiran 707	. . . . 5 ⊢ (𝑤 ∈ (^◡2^nd “ 𝐴) ↔ (2^nd ‘𝑤) ∈ 𝐴)
26	25	anbi1i 624	. . . 4 ⊢ ((𝑤 ∈ (^◡2^nd “ 𝐴) ∧ 𝑤 ∈ (𝐵 × 𝐶)) ↔ ((2^nd ‘𝑤) ∈ 𝐴 ∧ 𝑤 ∈ (𝐵 × 𝐶)))
27	18, 19, 26	3bitri 296	. . 3 ⊢ (𝑤 ∈ (^◡(2^nd ↾ (𝐵 × 𝐶)) “ 𝐴) ↔ ((2^nd ‘𝑤) ∈ 𝐴 ∧ 𝑤 ∈ (𝐵 × 𝐶)))
28		elxp7 8006	. . 3 ⊢ (𝑤 ∈ (𝐵 × 𝐴) ↔ (𝑤 ∈ (V × V) ∧ ((1^st ‘𝑤) ∈ 𝐵 ∧ (2^nd ‘𝑤) ∈ 𝐴)))
29	16, 27, 28	3bitr4g 313	. 2 ⊢ (𝐴 ⊆ 𝐶 → (𝑤 ∈ (^◡(2^nd ↾ (𝐵 × 𝐶)) “ 𝐴) ↔ 𝑤 ∈ (𝐵 × 𝐴)))
30	29	eqrdv 2730	1 ⊢ (𝐴 ⊆ 𝐶 → (^◡(2^nd ↾ (𝐵 × 𝐶)) “ 𝐴) = (𝐵 × 𝐴))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 205 ∧ wa 396 = wceq 1541 ∈ wcel 2106 Vcvv 3474 ∩ cin 3946 ⊆ wss 3947 × cxp 5673 ^◡ccnv 5674 ↾ cres 5677 “ cima 5678 Fn wfn 6535 –onto→wfo 6538 ‘cfv 6540 1^st c1st 7969 2^nd c2nd 7970

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2703 ax-sep 5298 ax-nul 5305 ax-pr 5426 ax-un 7721

This theorem depends on definitions: df-bi 206 df-an 397 df-or 846 df-3an 1089 df-tru 1544 df-fal 1554 df-ex 1782 df-nf 1786 df-sb 2068 df-mo 2534 df-eu 2563 df-clab 2710 df-cleq 2724 df-clel 2810 df-nfc 2885 df-ne 2941 df-ral 3062 df-rex 3071 df-rab 3433 df-v 3476 df-dif 3950 df-un 3952 df-in 3954 df-ss 3964 df-nul 4322 df-if 4528 df-sn 4628 df-pr 4630 df-op 4634 df-uni 4908 df-br 5148 df-opab 5210 df-mpt 5231 df-id 5573 df-xp 5681 df-rel 5682 df-cnv 5683 df-co 5684 df-dm 5685 df-rn 5686 df-res 5687 df-ima 5688 df-iota 6492 df-fun 6542 df-fn 6543 df-f 6544 df-fo 6546 df-fv 6548 df-1st 7971 df-2nd 7972

This theorem is referenced by: sxbrsigalem2 33273

W3C validator