1stpreima - Mathbox for Thierry Arnoux

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

Theorem 1stpreima 30941

Description: The preimage by 1^st is a 'vertical band'. (Contributed by Thierry Arnoux, 13-Oct-2017.)

**Assertion**
Ref	Expression
1stpreima	⊢ (𝐴 ⊆ 𝐵 → (^◡(1^st ↾ (𝐵 × 𝐶)) “ 𝐴) = (𝐴 × 𝐶))

Proof of Theorem 1stpreima Dummy variable 𝑤 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		elxp7 7839	. . . . . 6 ⊢ (𝑤 ∈ (𝐵 × 𝐶) ↔ (𝑤 ∈ (V × V) ∧ ((1^st ‘𝑤) ∈ 𝐵 ∧ (2^nd ‘𝑤) ∈ 𝐶)))
2	1	anbi2i 622	. . . . 5 ⊢ (((1^st ‘𝑤) ∈ 𝐴 ∧ 𝑤 ∈ (𝐵 × 𝐶)) ↔ ((1^st ‘𝑤) ∈ 𝐴 ∧ (𝑤 ∈ (V × V) ∧ ((1^st ‘𝑤) ∈ 𝐵 ∧ (2^nd ‘𝑤) ∈ 𝐶))))
3		anass 468	. . . . . . 7 ⊢ ((((1^st ‘𝑤) ∈ 𝐴 ∧ (1^st ‘𝑤) ∈ 𝐵) ∧ (𝑤 ∈ (V × V) ∧ (2^nd ‘𝑤) ∈ 𝐶)) ↔ ((1^st ‘𝑤) ∈ 𝐴 ∧ ((1^st ‘𝑤) ∈ 𝐵 ∧ (𝑤 ∈ (V × V) ∧ (2^nd ‘𝑤) ∈ 𝐶))))
4	3	a1i 11	. . . . . 6 ⊢ (𝐴 ⊆ 𝐵 → ((((1^st ‘𝑤) ∈ 𝐴 ∧ (1^st ‘𝑤) ∈ 𝐵) ∧ (𝑤 ∈ (V × V) ∧ (2^nd ‘𝑤) ∈ 𝐶)) ↔ ((1^st ‘𝑤) ∈ 𝐴 ∧ ((1^st ‘𝑤) ∈ 𝐵 ∧ (𝑤 ∈ (V × V) ∧ (2^nd ‘𝑤) ∈ 𝐶)))))
5		ssel 3910	. . . . . . . 8 ⊢ (𝐴 ⊆ 𝐵 → ((1^st ‘𝑤) ∈ 𝐴 → (1^st ‘𝑤) ∈ 𝐵))
6	5	pm4.71d 561	. . . . . . 7 ⊢ (𝐴 ⊆ 𝐵 → ((1^st ‘𝑤) ∈ 𝐴 ↔ ((1^st ‘𝑤) ∈ 𝐴 ∧ (1^st ‘𝑤) ∈ 𝐵)))
7	6	anbi1d 629	. . . . . 6 ⊢ (𝐴 ⊆ 𝐵 → (((1^st ‘𝑤) ∈ 𝐴 ∧ (𝑤 ∈ (V × V) ∧ (2^nd ‘𝑤) ∈ 𝐶)) ↔ (((1^st ‘𝑤) ∈ 𝐴 ∧ (1^st ‘𝑤) ∈ 𝐵) ∧ (𝑤 ∈ (V × V) ∧ (2^nd ‘𝑤) ∈ 𝐶))))
8		an12 641	. . . . . . . 8 ⊢ ((𝑤 ∈ (V × V) ∧ ((1^st ‘𝑤) ∈ 𝐵 ∧ (2^nd ‘𝑤) ∈ 𝐶)) ↔ ((1^st ‘𝑤) ∈ 𝐵 ∧ (𝑤 ∈ (V × V) ∧ (2^nd ‘𝑤) ∈ 𝐶)))
9	8	anbi2i 622	. . . . . . 7 ⊢ (((1^st ‘𝑤) ∈ 𝐴 ∧ (𝑤 ∈ (V × V) ∧ ((1^st ‘𝑤) ∈ 𝐵 ∧ (2^nd ‘𝑤) ∈ 𝐶))) ↔ ((1^st ‘𝑤) ∈ 𝐴 ∧ ((1^st ‘𝑤) ∈ 𝐵 ∧ (𝑤 ∈ (V × V) ∧ (2^nd ‘𝑤) ∈ 𝐶))))
10	9	a1i 11	. . . . . 6 ⊢ (𝐴 ⊆ 𝐵 → (((1^st ‘𝑤) ∈ 𝐴 ∧ (𝑤 ∈ (V × V) ∧ ((1^st ‘𝑤) ∈ 𝐵 ∧ (2^nd ‘𝑤) ∈ 𝐶))) ↔ ((1^st ‘𝑤) ∈ 𝐴 ∧ ((1^st ‘𝑤) ∈ 𝐵 ∧ (𝑤 ∈ (V × V) ∧ (2^nd ‘𝑤) ∈ 𝐶)))))
11	4, 7, 10	3bitr4d 310	. . . . 5 ⊢ (𝐴 ⊆ 𝐵 → (((1^st ‘𝑤) ∈ 𝐴 ∧ (𝑤 ∈ (V × V) ∧ (2^nd ‘𝑤) ∈ 𝐶)) ↔ ((1^st ‘𝑤) ∈ 𝐴 ∧ (𝑤 ∈ (V × V) ∧ ((1^st ‘𝑤) ∈ 𝐵 ∧ (2^nd ‘𝑤) ∈ 𝐶)))))
12	2, 11	bitr4id 289	. . . 4 ⊢ (𝐴 ⊆ 𝐵 → (((1^st ‘𝑤) ∈ 𝐴 ∧ 𝑤 ∈ (𝐵 × 𝐶)) ↔ ((1^st ‘𝑤) ∈ 𝐴 ∧ (𝑤 ∈ (V × V) ∧ (2^nd ‘𝑤) ∈ 𝐶))))
13		an12 641	. . . 4 ⊢ (((1^st ‘𝑤) ∈ 𝐴 ∧ (𝑤 ∈ (V × V) ∧ (2^nd ‘𝑤) ∈ 𝐶)) ↔ (𝑤 ∈ (V × V) ∧ ((1^st ‘𝑤) ∈ 𝐴 ∧ (2^nd ‘𝑤) ∈ 𝐶)))
14	12, 13	bitrdi 286	. . 3 ⊢ (𝐴 ⊆ 𝐵 → (((1^st ‘𝑤) ∈ 𝐴 ∧ 𝑤 ∈ (𝐵 × 𝐶)) ↔ (𝑤 ∈ (V × V) ∧ ((1^st ‘𝑤) ∈ 𝐴 ∧ (2^nd ‘𝑤) ∈ 𝐶))))
15		cnvresima 6122	. . . . 5 ⊢ (^◡(1^st ↾ (𝐵 × 𝐶)) “ 𝐴) = ((^◡1^st “ 𝐴) ∩ (𝐵 × 𝐶))
16	15	eleq2i 2830	. . . 4 ⊢ (𝑤 ∈ (^◡(1^st ↾ (𝐵 × 𝐶)) “ 𝐴) ↔ 𝑤 ∈ ((^◡1^st “ 𝐴) ∩ (𝐵 × 𝐶)))
17		elin 3899	. . . 4 ⊢ (𝑤 ∈ ((^◡1^st “ 𝐴) ∩ (𝐵 × 𝐶)) ↔ (𝑤 ∈ (^◡1^st “ 𝐴) ∧ 𝑤 ∈ (𝐵 × 𝐶)))
18		vex 3426	. . . . . 6 ⊢ 𝑤 ∈ V
19		fo1st 7824	. . . . . . 7 ⊢ 1^st :V–onto→V
20		fofn 6674	. . . . . . 7 ⊢ (1^st :V–onto→V → 1^st Fn V)
21		elpreima 6917	. . . . . . 7 ⊢ (1^st Fn V → (𝑤 ∈ (^◡1^st “ 𝐴) ↔ (𝑤 ∈ V ∧ (1^st ‘𝑤) ∈ 𝐴)))
22	19, 20, 21	mp2b 10	. . . . . 6 ⊢ (𝑤 ∈ (^◡1^st “ 𝐴) ↔ (𝑤 ∈ V ∧ (1^st ‘𝑤) ∈ 𝐴))
23	18, 22	mpbiran 705	. . . . 5 ⊢ (𝑤 ∈ (^◡1^st “ 𝐴) ↔ (1^st ‘𝑤) ∈ 𝐴)
24	23	anbi1i 623	. . . 4 ⊢ ((𝑤 ∈ (^◡1^st “ 𝐴) ∧ 𝑤 ∈ (𝐵 × 𝐶)) ↔ ((1^st ‘𝑤) ∈ 𝐴 ∧ 𝑤 ∈ (𝐵 × 𝐶)))
25	16, 17, 24	3bitri 296	. . 3 ⊢ (𝑤 ∈ (^◡(1^st ↾ (𝐵 × 𝐶)) “ 𝐴) ↔ ((1^st ‘𝑤) ∈ 𝐴 ∧ 𝑤 ∈ (𝐵 × 𝐶)))
26		elxp7 7839	. . 3 ⊢ (𝑤 ∈ (𝐴 × 𝐶) ↔ (𝑤 ∈ (V × V) ∧ ((1^st ‘𝑤) ∈ 𝐴 ∧ (2^nd ‘𝑤) ∈ 𝐶)))
27	14, 25, 26	3bitr4g 313	. 2 ⊢ (𝐴 ⊆ 𝐵 → (𝑤 ∈ (^◡(1^st ↾ (𝐵 × 𝐶)) “ 𝐴) ↔ 𝑤 ∈ (𝐴 × 𝐶)))
28	27	eqrdv 2736	1 ⊢ (𝐴 ⊆ 𝐵 → (^◡(1^st ↾ (𝐵 × 𝐶)) “ 𝐴) = (𝐴 × 𝐶))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 205 ∧ wa 395 = wceq 1539 ∈ wcel 2108 Vcvv 3422 ∩ cin 3882 ⊆ wss 3883 × cxp 5578 ^◡ccnv 5579 ↾ cres 5582 “ cima 5583 Fn wfn 6413 –onto→wfo 6416 ‘cfv 6418 1^st c1st 7802 2^nd c2nd 7803

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1799 ax-4 1813 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2110 ax-9 2118 ax-10 2139 ax-11 2156 ax-12 2173 ax-ext 2709 ax-sep 5218 ax-nul 5225 ax-pr 5347 ax-un 7566

This theorem depends on definitions: df-bi 206 df-an 396 df-or 844 df-3an 1087 df-tru 1542 df-fal 1552 df-ex 1784 df-nf 1788 df-sb 2069 df-mo 2540 df-eu 2569 df-clab 2716 df-cleq 2730 df-clel 2817 df-nfc 2888 df-ne 2943 df-ral 3068 df-rex 3069 df-rab 3072 df-v 3424 df-dif 3886 df-un 3888 df-in 3890 df-ss 3900 df-nul 4254 df-if 4457 df-sn 4559 df-pr 4561 df-op 4565 df-uni 4837 df-br 5071 df-opab 5133 df-mpt 5154 df-id 5480 df-xp 5586 df-rel 5587 df-cnv 5588 df-co 5589 df-dm 5590 df-rn 5591 df-res 5592 df-ima 5593 df-iota 6376 df-fun 6420 df-fn 6421 df-f 6422 df-fo 6424 df-fv 6426 df-1st 7804 df-2nd 7805

This theorem is referenced by: sxbrsigalem2 32153

W3C validator