bj-elid6 - Mathbox for BJ

	Mathbox for BJ		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > Mathboxes > bj-elid6		Structured version Visualization version GIF version

Theorem bj-elid6 37909

Description: Characterization of the elements of the diagonal of a Cartesian square. (Contributed by BJ, 22-Jun-2019.)

**Assertion**
Ref	Expression
bj-elid6	⊢ (𝐵 ∈ ( I ↾ 𝐴) ↔ (𝐵 ∈ (𝐴 × 𝐴) ∧ (1^st ‘𝐵) = (2^nd ‘𝐵)))

**Proof of Theorem bj-elid6**
Step	Hyp	Ref	Expression
1		df-res 5671	. . . 4 ⊢ ( I ↾ 𝐴) = ( I ∩ (𝐴 × V))
2	1	elin2 4152	. . 3 ⊢ (𝐵 ∈ ( I ↾ 𝐴) ↔ (𝐵 ∈ I ∧ 𝐵 ∈ (𝐴 × V)))
3	2	biancomi 468	. 2 ⊢ (𝐵 ∈ ( I ↾ 𝐴) ↔ (𝐵 ∈ (𝐴 × V) ∧ 𝐵 ∈ I ))
4		bj-elid4 37907	. . 3 ⊢ (𝐵 ∈ (𝐴 × V) → (𝐵 ∈ I ↔ (1^st ‘𝐵) = (2^nd ‘𝐵)))
5	4	pm5.32i 585	. 2 ⊢ ((𝐵 ∈ (𝐴 × V) ∧ 𝐵 ∈ I ) ↔ (𝐵 ∈ (𝐴 × V) ∧ (1^st ‘𝐵) = (2^nd ‘𝐵)))
6		1st2nd2 8028	. . . . 5 ⊢ (𝐵 ∈ (𝐴 × V) → 𝐵 = ⟨(1^st ‘𝐵), (2^nd ‘𝐵)⟩)
7	6	pm4.71ri 570	. . . 4 ⊢ (𝐵 ∈ (𝐴 × V) ↔ (𝐵 = ⟨(1^st ‘𝐵), (2^nd ‘𝐵)⟩ ∧ 𝐵 ∈ (𝐴 × V)))
8		eleq1 2850	. . . . . . . 8 ⊢ (𝐵 = ⟨(1^st ‘𝐵), (2^nd ‘𝐵)⟩ → (𝐵 ∈ (𝐴 × V) ↔ ⟨(1^st ‘𝐵), (2^nd ‘𝐵)⟩ ∈ (𝐴 × V)))
9	8	adantl 487	. . . . . . 7 ⊢ (((1^st ‘𝐵) = (2^nd ‘𝐵) ∧ 𝐵 = ⟨(1^st ‘𝐵), (2^nd ‘𝐵)⟩) → (𝐵 ∈ (𝐴 × V) ↔ ⟨(1^st ‘𝐵), (2^nd ‘𝐵)⟩ ∈ (𝐴 × V)))
10		simpl 488	. . . . . . . . . . . 12 ⊢ (((1^st ‘𝐵) ∈ 𝐴 ∧ (2^nd ‘𝐵) ∈ V) → (1^st ‘𝐵) ∈ 𝐴)
11	10	a1i 11	. . . . . . . . . . 11 ⊢ ((1^st ‘𝐵) = (2^nd ‘𝐵) → (((1^st ‘𝐵) ∈ 𝐴 ∧ (2^nd ‘𝐵) ∈ V) → (1^st ‘𝐵) ∈ 𝐴))
12		eleq1 2850	. . . . . . . . . . . 12 ⊢ ((1^st ‘𝐵) = (2^nd ‘𝐵) → ((1^st ‘𝐵) ∈ 𝐴 ↔ (2^nd ‘𝐵) ∈ 𝐴))
13	10, 12	imbitrid 247	. . . . . . . . . . 11 ⊢ ((1^st ‘𝐵) = (2^nd ‘𝐵) → (((1^st ‘𝐵) ∈ 𝐴 ∧ (2^nd ‘𝐵) ∈ V) → (2^nd ‘𝐵) ∈ 𝐴))
14	11, 13	jcad 522	. . . . . . . . . 10 ⊢ ((1^st ‘𝐵) = (2^nd ‘𝐵) → (((1^st ‘𝐵) ∈ 𝐴 ∧ (2^nd ‘𝐵) ∈ V) → ((1^st ‘𝐵) ∈ 𝐴 ∧ (2^nd ‘𝐵) ∈ 𝐴)))
15		elex 3474	. . . . . . . . . . 11 ⊢ ((2^nd ‘𝐵) ∈ 𝐴 → (2^nd ‘𝐵) ∈ V)
16	15	anim2i 629	. . . . . . . . . 10 ⊢ (((1^st ‘𝐵) ∈ 𝐴 ∧ (2^nd ‘𝐵) ∈ 𝐴) → ((1^st ‘𝐵) ∈ 𝐴 ∧ (2^nd ‘𝐵) ∈ V))
17	14, 16	impbid1 228	. . . . . . . . 9 ⊢ ((1^st ‘𝐵) = (2^nd ‘𝐵) → (((1^st ‘𝐵) ∈ 𝐴 ∧ (2^nd ‘𝐵) ∈ V) ↔ ((1^st ‘𝐵) ∈ 𝐴 ∧ (2^nd ‘𝐵) ∈ 𝐴)))
18	17	adantr 486	. . . . . . . 8 ⊢ (((1^st ‘𝐵) = (2^nd ‘𝐵) ∧ 𝐵 = ⟨(1^st ‘𝐵), (2^nd ‘𝐵)⟩) → (((1^st ‘𝐵) ∈ 𝐴 ∧ (2^nd ‘𝐵) ∈ V) ↔ ((1^st ‘𝐵) ∈ 𝐴 ∧ (2^nd ‘𝐵) ∈ 𝐴)))
19		opelxp 5695	. . . . . . . 8 ⊢ (⟨(1^st ‘𝐵), (2^nd ‘𝐵)⟩ ∈ (𝐴 × V) ↔ ((1^st ‘𝐵) ∈ 𝐴 ∧ (2^nd ‘𝐵) ∈ V))
20		opelxp 5695	. . . . . . . 8 ⊢ (⟨(1^st ‘𝐵), (2^nd ‘𝐵)⟩ ∈ (𝐴 × 𝐴) ↔ ((1^st ‘𝐵) ∈ 𝐴 ∧ (2^nd ‘𝐵) ∈ 𝐴))
21	18, 19, 20	3bitr4g 317	. . . . . . 7 ⊢ (((1^st ‘𝐵) = (2^nd ‘𝐵) ∧ 𝐵 = ⟨(1^st ‘𝐵), (2^nd ‘𝐵)⟩) → (⟨(1^st ‘𝐵), (2^nd ‘𝐵)⟩ ∈ (𝐴 × V) ↔ ⟨(1^st ‘𝐵), (2^nd ‘𝐵)⟩ ∈ (𝐴 × 𝐴)))
22		eleq1 2850	. . . . . . . . 9 ⊢ (𝐵 = ⟨(1^st ‘𝐵), (2^nd ‘𝐵)⟩ → (𝐵 ∈ (𝐴 × 𝐴) ↔ ⟨(1^st ‘𝐵), (2^nd ‘𝐵)⟩ ∈ (𝐴 × 𝐴)))
23	22	bicomd 226	. . . . . . . 8 ⊢ (𝐵 = ⟨(1^st ‘𝐵), (2^nd ‘𝐵)⟩ → (⟨(1^st ‘𝐵), (2^nd ‘𝐵)⟩ ∈ (𝐴 × 𝐴) ↔ 𝐵 ∈ (𝐴 × 𝐴)))
24	23	adantl 487	. . . . . . 7 ⊢ (((1^st ‘𝐵) = (2^nd ‘𝐵) ∧ 𝐵 = ⟨(1^st ‘𝐵), (2^nd ‘𝐵)⟩) → (⟨(1^st ‘𝐵), (2^nd ‘𝐵)⟩ ∈ (𝐴 × 𝐴) ↔ 𝐵 ∈ (𝐴 × 𝐴)))
25	9, 21, 24	3bitrd 308	. . . . . 6 ⊢ (((1^st ‘𝐵) = (2^nd ‘𝐵) ∧ 𝐵 = ⟨(1^st ‘𝐵), (2^nd ‘𝐵)⟩) → (𝐵 ∈ (𝐴 × V) ↔ 𝐵 ∈ (𝐴 × 𝐴)))
26	25	pm5.32da 590	. . . . 5 ⊢ ((1^st ‘𝐵) = (2^nd ‘𝐵) → ((𝐵 = ⟨(1^st ‘𝐵), (2^nd ‘𝐵)⟩ ∧ 𝐵 ∈ (𝐴 × V)) ↔ (𝐵 = ⟨(1^st ‘𝐵), (2^nd ‘𝐵)⟩ ∧ 𝐵 ∈ (𝐴 × 𝐴))))
27		simpr 490	. . . . . 6 ⊢ ((𝐵 = ⟨(1^st ‘𝐵), (2^nd ‘𝐵)⟩ ∧ 𝐵 ∈ (𝐴 × 𝐴)) → 𝐵 ∈ (𝐴 × 𝐴))
28		1st2nd2 8028	. . . . . . 7 ⊢ (𝐵 ∈ (𝐴 × 𝐴) → 𝐵 = ⟨(1^st ‘𝐵), (2^nd ‘𝐵)⟩)
29	28	ancri 559	. . . . . 6 ⊢ (𝐵 ∈ (𝐴 × 𝐴) → (𝐵 = ⟨(1^st ‘𝐵), (2^nd ‘𝐵)⟩ ∧ 𝐵 ∈ (𝐴 × 𝐴)))
30	27, 29	impbii 212	. . . . 5 ⊢ ((𝐵 = ⟨(1^st ‘𝐵), (2^nd ‘𝐵)⟩ ∧ 𝐵 ∈ (𝐴 × 𝐴)) ↔ 𝐵 ∈ (𝐴 × 𝐴))
31	26, 30	bitrdi 290	. . . 4 ⊢ ((1^st ‘𝐵) = (2^nd ‘𝐵) → ((𝐵 = ⟨(1^st ‘𝐵), (2^nd ‘𝐵)⟩ ∧ 𝐵 ∈ (𝐴 × V)) ↔ 𝐵 ∈ (𝐴 × 𝐴)))
32	7, 31	bitrid 286	. . 3 ⊢ ((1^st ‘𝐵) = (2^nd ‘𝐵) → (𝐵 ∈ (𝐴 × V) ↔ 𝐵 ∈ (𝐴 × 𝐴)))
33	32	pm5.32ri 586	. 2 ⊢ ((𝐵 ∈ (𝐴 × V) ∧ (1^st ‘𝐵) = (2^nd ‘𝐵)) ↔ (𝐵 ∈ (𝐴 × 𝐴) ∧ (1^st ‘𝐵) = (2^nd ‘𝐵)))
34	3, 5, 33	3bitri 300	1 ⊢ (𝐵 ∈ ( I ↾ 𝐴) ↔ (𝐵 ∈ (𝐴 × 𝐴) ∧ (1^st ‘𝐵) = (2^nd ‘𝐵)))

Colors of variables: wff setvar class

This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 = wceq 1570 ∈ wcel 2145 Vcvv 3453 ⟨cop 4593 I cid 5553 × cxp 5657 ↾ cres 5661 ‘cfv 6537 1^st c1st 7987 2^nd c2nd 7988

This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2215 ax-ext 2734 ax-sep 5255 ax-nul 5267 ax-pr 5402 ax-un 7739

This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2566 df-eu 2596 df-clab 2741 df-cleq 2754 df-clel 2837 df-nfc 2911 df-ne 2958 df-ral 3079 df-rex 3089 df-rab 3415 df-v 3455 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-nul 4283 df-if 4486 df-sn 4588 df-pr 4590 df-op 4594 df-uni 4871 df-br 5108 df-opab 5172 df-mpt 5191 df-id 5554 df-xp 5665 df-rel 5666 df-cnv 5667 df-co 5668 df-dm 5669 df-rn 5670 df-res 5671 df-iota 6493 df-fun 6539 df-fv 6545 df-1st 7989 df-2nd 7990

This theorem is used by: (None)

W3C validator