1stpreimas - Mathbox for Thierry Arnoux

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

Theorem 1stpreimas 31922

Description: The preimage of a singleton. (Contributed by Thierry Arnoux, 27-Apr-2020.)

**Assertion**
Ref	Expression
1stpreimas	⊢ ((Rel 𝐴 ∧ 𝑋 ∈ 𝑉) → (^◡(1^st ↾ 𝐴) “ {𝑋}) = ({𝑋} × (𝐴 “ {𝑋})))

Proof of Theorem 1stpreimas Dummy variables 𝑥 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		1st2ndb 8014	. . . . . . . . 9 ⊢ (𝑧 ∈ (V × V) ↔ 𝑧 = ⟨(1^st ‘𝑧), (2^nd ‘𝑧)⟩)
2	1	biimpi 215	. . . . . . . 8 ⊢ (𝑧 ∈ (V × V) → 𝑧 = ⟨(1^st ‘𝑧), (2^nd ‘𝑧)⟩)
3	2	ad2antrl 726	. . . . . . 7 ⊢ (((Rel 𝐴 ∧ 𝑋 ∈ 𝑉) ∧ (𝑧 ∈ (V × V) ∧ ((1^st ‘𝑧) ∈ {𝑋} ∧ (2^nd ‘𝑧) ∈ (𝐴 “ {𝑋})))) → 𝑧 = ⟨(1^st ‘𝑧), (2^nd ‘𝑧)⟩)
4		fvex 6904	. . . . . . . . . . . 12 ⊢ (1^st ‘𝑧) ∈ V
5	4	elsn 4643	. . . . . . . . . . 11 ⊢ ((1^st ‘𝑧) ∈ {𝑋} ↔ (1^st ‘𝑧) = 𝑋)
6	5	biimpi 215	. . . . . . . . . 10 ⊢ ((1^st ‘𝑧) ∈ {𝑋} → (1^st ‘𝑧) = 𝑋)
7	6	ad2antrl 726	. . . . . . . . 9 ⊢ ((𝑧 ∈ (V × V) ∧ ((1^st ‘𝑧) ∈ {𝑋} ∧ (2^nd ‘𝑧) ∈ (𝐴 “ {𝑋}))) → (1^st ‘𝑧) = 𝑋)
8	7	adantl 482	. . . . . . . 8 ⊢ (((Rel 𝐴 ∧ 𝑋 ∈ 𝑉) ∧ (𝑧 ∈ (V × V) ∧ ((1^st ‘𝑧) ∈ {𝑋} ∧ (2^nd ‘𝑧) ∈ (𝐴 “ {𝑋})))) → (1^st ‘𝑧) = 𝑋)
9	8	opeq1d 4879	. . . . . . 7 ⊢ (((Rel 𝐴 ∧ 𝑋 ∈ 𝑉) ∧ (𝑧 ∈ (V × V) ∧ ((1^st ‘𝑧) ∈ {𝑋} ∧ (2^nd ‘𝑧) ∈ (𝐴 “ {𝑋})))) → ⟨(1^st ‘𝑧), (2^nd ‘𝑧)⟩ = ⟨𝑋, (2^nd ‘𝑧)⟩)
10	3, 9	eqtrd 2772	. . . . . 6 ⊢ (((Rel 𝐴 ∧ 𝑋 ∈ 𝑉) ∧ (𝑧 ∈ (V × V) ∧ ((1^st ‘𝑧) ∈ {𝑋} ∧ (2^nd ‘𝑧) ∈ (𝐴 “ {𝑋})))) → 𝑧 = ⟨𝑋, (2^nd ‘𝑧)⟩)
11		simplr 767	. . . . . . 7 ⊢ (((Rel 𝐴 ∧ 𝑋 ∈ 𝑉) ∧ (𝑧 ∈ (V × V) ∧ ((1^st ‘𝑧) ∈ {𝑋} ∧ (2^nd ‘𝑧) ∈ (𝐴 “ {𝑋})))) → 𝑋 ∈ 𝑉)
12		simprrr 780	. . . . . . 7 ⊢ (((Rel 𝐴 ∧ 𝑋 ∈ 𝑉) ∧ (𝑧 ∈ (V × V) ∧ ((1^st ‘𝑧) ∈ {𝑋} ∧ (2^nd ‘𝑧) ∈ (𝐴 “ {𝑋})))) → (2^nd ‘𝑧) ∈ (𝐴 “ {𝑋}))
13		elimasng 6087	. . . . . . . 8 ⊢ ((𝑋 ∈ 𝑉 ∧ (2^nd ‘𝑧) ∈ (𝐴 “ {𝑋})) → ((2^nd ‘𝑧) ∈ (𝐴 “ {𝑋}) ↔ ⟨𝑋, (2^nd ‘𝑧)⟩ ∈ 𝐴))
14	13	biimpa 477	. . . . . . 7 ⊢ (((𝑋 ∈ 𝑉 ∧ (2^nd ‘𝑧) ∈ (𝐴 “ {𝑋})) ∧ (2^nd ‘𝑧) ∈ (𝐴 “ {𝑋})) → ⟨𝑋, (2^nd ‘𝑧)⟩ ∈ 𝐴)
15	11, 12, 12, 14	syl21anc 836	. . . . . 6 ⊢ (((Rel 𝐴 ∧ 𝑋 ∈ 𝑉) ∧ (𝑧 ∈ (V × V) ∧ ((1^st ‘𝑧) ∈ {𝑋} ∧ (2^nd ‘𝑧) ∈ (𝐴 “ {𝑋})))) → ⟨𝑋, (2^nd ‘𝑧)⟩ ∈ 𝐴)
16	10, 15	eqeltrd 2833	. . . . 5 ⊢ (((Rel 𝐴 ∧ 𝑋 ∈ 𝑉) ∧ (𝑧 ∈ (V × V) ∧ ((1^st ‘𝑧) ∈ {𝑋} ∧ (2^nd ‘𝑧) ∈ (𝐴 “ {𝑋})))) → 𝑧 ∈ 𝐴)
17		fvres 6910	. . . . . . 7 ⊢ (𝑧 ∈ 𝐴 → ((1^st ↾ 𝐴)‘𝑧) = (1^st ‘𝑧))
18	16, 17	syl 17	. . . . . 6 ⊢ (((Rel 𝐴 ∧ 𝑋 ∈ 𝑉) ∧ (𝑧 ∈ (V × V) ∧ ((1^st ‘𝑧) ∈ {𝑋} ∧ (2^nd ‘𝑧) ∈ (𝐴 “ {𝑋})))) → ((1^st ↾ 𝐴)‘𝑧) = (1^st ‘𝑧))
19	18, 8	eqtrd 2772	. . . . 5 ⊢ (((Rel 𝐴 ∧ 𝑋 ∈ 𝑉) ∧ (𝑧 ∈ (V × V) ∧ ((1^st ‘𝑧) ∈ {𝑋} ∧ (2^nd ‘𝑧) ∈ (𝐴 “ {𝑋})))) → ((1^st ↾ 𝐴)‘𝑧) = 𝑋)
20	16, 19	jca 512	. . . 4 ⊢ (((Rel 𝐴 ∧ 𝑋 ∈ 𝑉) ∧ (𝑧 ∈ (V × V) ∧ ((1^st ‘𝑧) ∈ {𝑋} ∧ (2^nd ‘𝑧) ∈ (𝐴 “ {𝑋})))) → (𝑧 ∈ 𝐴 ∧ ((1^st ↾ 𝐴)‘𝑧) = 𝑋))
21		df-rel 5683	. . . . . . . . 9 ⊢ (Rel 𝐴 ↔ 𝐴 ⊆ (V × V))
22	21	biimpi 215	. . . . . . . 8 ⊢ (Rel 𝐴 → 𝐴 ⊆ (V × V))
23	22	adantr 481	. . . . . . 7 ⊢ ((Rel 𝐴 ∧ 𝑋 ∈ 𝑉) → 𝐴 ⊆ (V × V))
24	23	sselda 3982	. . . . . 6 ⊢ (((Rel 𝐴 ∧ 𝑋 ∈ 𝑉) ∧ 𝑧 ∈ 𝐴) → 𝑧 ∈ (V × V))
25	24	adantrr 715	. . . . 5 ⊢ (((Rel 𝐴 ∧ 𝑋 ∈ 𝑉) ∧ (𝑧 ∈ 𝐴 ∧ ((1^st ↾ 𝐴)‘𝑧) = 𝑋)) → 𝑧 ∈ (V × V))
26	17	ad2antrl 726	. . . . . . . 8 ⊢ (((Rel 𝐴 ∧ 𝑋 ∈ 𝑉) ∧ (𝑧 ∈ 𝐴 ∧ ((1^st ↾ 𝐴)‘𝑧) = 𝑋)) → ((1^st ↾ 𝐴)‘𝑧) = (1^st ‘𝑧))
27		simprr 771	. . . . . . . 8 ⊢ (((Rel 𝐴 ∧ 𝑋 ∈ 𝑉) ∧ (𝑧 ∈ 𝐴 ∧ ((1^st ↾ 𝐴)‘𝑧) = 𝑋)) → ((1^st ↾ 𝐴)‘𝑧) = 𝑋)
28	26, 27	eqtr3d 2774	. . . . . . 7 ⊢ (((Rel 𝐴 ∧ 𝑋 ∈ 𝑉) ∧ (𝑧 ∈ 𝐴 ∧ ((1^st ↾ 𝐴)‘𝑧) = 𝑋)) → (1^st ‘𝑧) = 𝑋)
29	28, 5	sylibr 233	. . . . . 6 ⊢ (((Rel 𝐴 ∧ 𝑋 ∈ 𝑉) ∧ (𝑧 ∈ 𝐴 ∧ ((1^st ↾ 𝐴)‘𝑧) = 𝑋)) → (1^st ‘𝑧) ∈ {𝑋})
30	28, 29	eqeltrrd 2834	. . . . . . . . 9 ⊢ (((Rel 𝐴 ∧ 𝑋 ∈ 𝑉) ∧ (𝑧 ∈ 𝐴 ∧ ((1^st ↾ 𝐴)‘𝑧) = 𝑋)) → 𝑋 ∈ {𝑋})
31		simpr 485	. . . . . . . . . . 11 ⊢ ((((Rel 𝐴 ∧ 𝑋 ∈ 𝑉) ∧ (𝑧 ∈ 𝐴 ∧ ((1^st ↾ 𝐴)‘𝑧) = 𝑋)) ∧ 𝑥 = 𝑋) → 𝑥 = 𝑋)
32	31	opeq1d 4879	. . . . . . . . . 10 ⊢ ((((Rel 𝐴 ∧ 𝑋 ∈ 𝑉) ∧ (𝑧 ∈ 𝐴 ∧ ((1^st ↾ 𝐴)‘𝑧) = 𝑋)) ∧ 𝑥 = 𝑋) → ⟨𝑥, (2^nd ‘𝑧)⟩ = ⟨𝑋, (2^nd ‘𝑧)⟩)
33	32	eleq1d 2818	. . . . . . . . 9 ⊢ ((((Rel 𝐴 ∧ 𝑋 ∈ 𝑉) ∧ (𝑧 ∈ 𝐴 ∧ ((1^st ↾ 𝐴)‘𝑧) = 𝑋)) ∧ 𝑥 = 𝑋) → (⟨𝑥, (2^nd ‘𝑧)⟩ ∈ 𝐴 ↔ ⟨𝑋, (2^nd ‘𝑧)⟩ ∈ 𝐴))
34		1st2nd 8024	. . . . . . . . . . . 12 ⊢ ((Rel 𝐴 ∧ 𝑧 ∈ 𝐴) → 𝑧 = ⟨(1^st ‘𝑧), (2^nd ‘𝑧)⟩)
35	34	ad2ant2r 745	. . . . . . . . . . 11 ⊢ (((Rel 𝐴 ∧ 𝑋 ∈ 𝑉) ∧ (𝑧 ∈ 𝐴 ∧ ((1^st ↾ 𝐴)‘𝑧) = 𝑋)) → 𝑧 = ⟨(1^st ‘𝑧), (2^nd ‘𝑧)⟩)
36	28	opeq1d 4879	. . . . . . . . . . 11 ⊢ (((Rel 𝐴 ∧ 𝑋 ∈ 𝑉) ∧ (𝑧 ∈ 𝐴 ∧ ((1^st ↾ 𝐴)‘𝑧) = 𝑋)) → ⟨(1^st ‘𝑧), (2^nd ‘𝑧)⟩ = ⟨𝑋, (2^nd ‘𝑧)⟩)
37	35, 36	eqtrd 2772	. . . . . . . . . 10 ⊢ (((Rel 𝐴 ∧ 𝑋 ∈ 𝑉) ∧ (𝑧 ∈ 𝐴 ∧ ((1^st ↾ 𝐴)‘𝑧) = 𝑋)) → 𝑧 = ⟨𝑋, (2^nd ‘𝑧)⟩)
38		simprl 769	. . . . . . . . . 10 ⊢ (((Rel 𝐴 ∧ 𝑋 ∈ 𝑉) ∧ (𝑧 ∈ 𝐴 ∧ ((1^st ↾ 𝐴)‘𝑧) = 𝑋)) → 𝑧 ∈ 𝐴)
39	37, 38	eqeltrrd 2834	. . . . . . . . 9 ⊢ (((Rel 𝐴 ∧ 𝑋 ∈ 𝑉) ∧ (𝑧 ∈ 𝐴 ∧ ((1^st ↾ 𝐴)‘𝑧) = 𝑋)) → ⟨𝑋, (2^nd ‘𝑧)⟩ ∈ 𝐴)
40	30, 33, 39	rspcedvd 3614	. . . . . . . 8 ⊢ (((Rel 𝐴 ∧ 𝑋 ∈ 𝑉) ∧ (𝑧 ∈ 𝐴 ∧ ((1^st ↾ 𝐴)‘𝑧) = 𝑋)) → ∃𝑥 ∈ {𝑋}⟨𝑥, (2^nd ‘𝑧)⟩ ∈ 𝐴)
41		df-rex 3071	. . . . . . . 8 ⊢ (∃𝑥 ∈ {𝑋}⟨𝑥, (2^nd ‘𝑧)⟩ ∈ 𝐴 ↔ ∃𝑥(𝑥 ∈ {𝑋} ∧ ⟨𝑥, (2^nd ‘𝑧)⟩ ∈ 𝐴))
42	40, 41	sylib 217	. . . . . . 7 ⊢ (((Rel 𝐴 ∧ 𝑋 ∈ 𝑉) ∧ (𝑧 ∈ 𝐴 ∧ ((1^st ↾ 𝐴)‘𝑧) = 𝑋)) → ∃𝑥(𝑥 ∈ {𝑋} ∧ ⟨𝑥, (2^nd ‘𝑧)⟩ ∈ 𝐴))
43		fvex 6904	. . . . . . . 8 ⊢ (2^nd ‘𝑧) ∈ V
44	43	elima3 6066	. . . . . . 7 ⊢ ((2^nd ‘𝑧) ∈ (𝐴 “ {𝑋}) ↔ ∃𝑥(𝑥 ∈ {𝑋} ∧ ⟨𝑥, (2^nd ‘𝑧)⟩ ∈ 𝐴))
45	42, 44	sylibr 233	. . . . . 6 ⊢ (((Rel 𝐴 ∧ 𝑋 ∈ 𝑉) ∧ (𝑧 ∈ 𝐴 ∧ ((1^st ↾ 𝐴)‘𝑧) = 𝑋)) → (2^nd ‘𝑧) ∈ (𝐴 “ {𝑋}))
46	29, 45	jca 512	. . . . 5 ⊢ (((Rel 𝐴 ∧ 𝑋 ∈ 𝑉) ∧ (𝑧 ∈ 𝐴 ∧ ((1^st ↾ 𝐴)‘𝑧) = 𝑋)) → ((1^st ‘𝑧) ∈ {𝑋} ∧ (2^nd ‘𝑧) ∈ (𝐴 “ {𝑋})))
47	25, 46	jca 512	. . . 4 ⊢ (((Rel 𝐴 ∧ 𝑋 ∈ 𝑉) ∧ (𝑧 ∈ 𝐴 ∧ ((1^st ↾ 𝐴)‘𝑧) = 𝑋)) → (𝑧 ∈ (V × V) ∧ ((1^st ‘𝑧) ∈ {𝑋} ∧ (2^nd ‘𝑧) ∈ (𝐴 “ {𝑋}))))
48	20, 47	impbida 799	. . 3 ⊢ ((Rel 𝐴 ∧ 𝑋 ∈ 𝑉) → ((𝑧 ∈ (V × V) ∧ ((1^st ‘𝑧) ∈ {𝑋} ∧ (2^nd ‘𝑧) ∈ (𝐴 “ {𝑋}))) ↔ (𝑧 ∈ 𝐴 ∧ ((1^st ↾ 𝐴)‘𝑧) = 𝑋)))
49		elxp7 8009	. . . 4 ⊢ (𝑧 ∈ ({𝑋} × (𝐴 “ {𝑋})) ↔ (𝑧 ∈ (V × V) ∧ ((1^st ‘𝑧) ∈ {𝑋} ∧ (2^nd ‘𝑧) ∈ (𝐴 “ {𝑋}))))
50	49	a1i 11	. . 3 ⊢ ((Rel 𝐴 ∧ 𝑋 ∈ 𝑉) → (𝑧 ∈ ({𝑋} × (𝐴 “ {𝑋})) ↔ (𝑧 ∈ (V × V) ∧ ((1^st ‘𝑧) ∈ {𝑋} ∧ (2^nd ‘𝑧) ∈ (𝐴 “ {𝑋})))))
51		fo1st 7994	. . . . . . 7 ⊢ 1^st :V–onto→V
52		fofn 6807	. . . . . . 7 ⊢ (1^st :V–onto→V → 1^st Fn V)
53	51, 52	ax-mp 5	. . . . . 6 ⊢ 1^st Fn V
54		ssv 4006	. . . . . 6 ⊢ 𝐴 ⊆ V
55		fnssres 6673	. . . . . 6 ⊢ ((1^st Fn V ∧ 𝐴 ⊆ V) → (1^st ↾ 𝐴) Fn 𝐴)
56	53, 54, 55	mp2an 690	. . . . 5 ⊢ (1^st ↾ 𝐴) Fn 𝐴
57		fniniseg 7061	. . . . 5 ⊢ ((1^st ↾ 𝐴) Fn 𝐴 → (𝑧 ∈ (^◡(1^st ↾ 𝐴) “ {𝑋}) ↔ (𝑧 ∈ 𝐴 ∧ ((1^st ↾ 𝐴)‘𝑧) = 𝑋)))
58	56, 57	ax-mp 5	. . . 4 ⊢ (𝑧 ∈ (^◡(1^st ↾ 𝐴) “ {𝑋}) ↔ (𝑧 ∈ 𝐴 ∧ ((1^st ↾ 𝐴)‘𝑧) = 𝑋))
59	58	a1i 11	. . 3 ⊢ ((Rel 𝐴 ∧ 𝑋 ∈ 𝑉) → (𝑧 ∈ (^◡(1^st ↾ 𝐴) “ {𝑋}) ↔ (𝑧 ∈ 𝐴 ∧ ((1^st ↾ 𝐴)‘𝑧) = 𝑋)))
60	48, 50, 59	3bitr4rd 311	. 2 ⊢ ((Rel 𝐴 ∧ 𝑋 ∈ 𝑉) → (𝑧 ∈ (^◡(1^st ↾ 𝐴) “ {𝑋}) ↔ 𝑧 ∈ ({𝑋} × (𝐴 “ {𝑋}))))
61	60	eqrdv 2730	1 ⊢ ((Rel 𝐴 ∧ 𝑋 ∈ 𝑉) → (^◡(1^st ↾ 𝐴) “ {𝑋}) = ({𝑋} × (𝐴 “ {𝑋})))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 205 ∧ wa 396 = wceq 1541 ∃wex 1781 ∈ wcel 2106 ∃wrex 3070 Vcvv 3474 ⊆ wss 3948 {csn 4628 ⟨cop 4634 × cxp 5674 ^◡ccnv 5675 ↾ cres 5678 “ cima 5679 Rel wrel 5681 Fn wfn 6538 –onto→wfo 6541 ‘cfv 6543 1^st c1st 7972 2^nd c2nd 7973

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 5299 ax-nul 5306 ax-pr 5427 ax-un 7724

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 3951 df-un 3953 df-in 3955 df-ss 3965 df-nul 4323 df-if 4529 df-sn 4629 df-pr 4631 df-op 4635 df-uni 4909 df-br 5149 df-opab 5211 df-mpt 5232 df-id 5574 df-xp 5682 df-rel 5683 df-cnv 5684 df-co 5685 df-dm 5686 df-rn 5687 df-res 5688 df-ima 5689 df-iota 6495 df-fun 6545 df-fn 6546 df-f 6547 df-fo 6549 df-fv 6551 df-1st 7974 df-2nd 7975

This theorem is referenced by: gsummpt2d 32196

W3C validator