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 37667

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 5661	. . . 4 ⊢ ( I ↾ 𝐴) = ( I ∩ (𝐴 × V))
2	1	elin2 4157	. . 3 ⊢ (𝐵 ∈ ( I ↾ 𝐴) ↔ (𝐵 ∈ I ∧ 𝐵 ∈ (𝐴 × V)))
3	2	biancomi 466	. 2 ⊢ (𝐵 ∈ ( I ↾ 𝐴) ↔ (𝐵 ∈ (𝐴 × V) ∧ 𝐵 ∈ I ))
4		bj-elid4 37665	. . 3 ⊢ (𝐵 ∈ (𝐴 × V) → (𝐵 ∈ I ↔ (1^st ‘𝐵) = (2^nd ‘𝐵)))
5	4	pm5.32i 582	. 2 ⊢ ((𝐵 ∈ (𝐴 × V) ∧ 𝐵 ∈ I ) ↔ (𝐵 ∈ (𝐴 × V) ∧ (1^st ‘𝐵) = (2^nd ‘𝐵)))
6		1st2nd2 8011	. . . . 5 ⊢ (𝐵 ∈ (𝐴 × V) → 𝐵 = ⟨(1^st ‘𝐵), (2^nd ‘𝐵)⟩)
7	6	pm4.71ri 568	. . . 4 ⊢ (𝐵 ∈ (𝐴 × V) ↔ (𝐵 = ⟨(1^st ‘𝐵), (2^nd ‘𝐵)⟩ ∧ 𝐵 ∈ (𝐴 × V)))
8		eleq1 2852	. . . . . . . 8 ⊢ (𝐵 = ⟨(1^st ‘𝐵), (2^nd ‘𝐵)⟩ → (𝐵 ∈ (𝐴 × V) ↔ ⟨(1^st ‘𝐵), (2^nd ‘𝐵)⟩ ∈ (𝐴 × V)))
9	8	adantl 485	. . . . . . 7 ⊢ (((1^st ‘𝐵) = (2^nd ‘𝐵) ∧ 𝐵 = ⟨(1^st ‘𝐵), (2^nd ‘𝐵)⟩) → (𝐵 ∈ (𝐴 × V) ↔ ⟨(1^st ‘𝐵), (2^nd ‘𝐵)⟩ ∈ (𝐴 × V)))
10		simpl 486	. . . . . . . . . . . 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 2852	. . . . . . . . . . . 12 ⊢ ((1^st ‘𝐵) = (2^nd ‘𝐵) → ((1^st ‘𝐵) ∈ 𝐴 ↔ (2^nd ‘𝐵) ∈ 𝐴))
13	10, 12	imbitrid 246	. . . . . . . . . . 11 ⊢ ((1^st ‘𝐵) = (2^nd ‘𝐵) → (((1^st ‘𝐵) ∈ 𝐴 ∧ (2^nd ‘𝐵) ∈ V) → (2^nd ‘𝐵) ∈ 𝐴))
14	11, 13	jcad 520	. . . . . . . . . 10 ⊢ ((1^st ‘𝐵) = (2^nd ‘𝐵) → (((1^st ‘𝐵) ∈ 𝐴 ∧ (2^nd ‘𝐵) ∈ V) → ((1^st ‘𝐵) ∈ 𝐴 ∧ (2^nd ‘𝐵) ∈ 𝐴)))
15		elex 3477	. . . . . . . . . . 11 ⊢ ((2^nd ‘𝐵) ∈ 𝐴 → (2^nd ‘𝐵) ∈ V)
16	15	anim2i 626	. . . . . . . . . 10 ⊢ (((1^st ‘𝐵) ∈ 𝐴 ∧ (2^nd ‘𝐵) ∈ 𝐴) → ((1^st ‘𝐵) ∈ 𝐴 ∧ (2^nd ‘𝐵) ∈ V))
17	14, 16	impbid1 227	. . . . . . . . 9 ⊢ ((1^st ‘𝐵) = (2^nd ‘𝐵) → (((1^st ‘𝐵) ∈ 𝐴 ∧ (2^nd ‘𝐵) ∈ V) ↔ ((1^st ‘𝐵) ∈ 𝐴 ∧ (2^nd ‘𝐵) ∈ 𝐴)))
18	17	adantr 484	. . . . . . . 8 ⊢ (((1^st ‘𝐵) = (2^nd ‘𝐵) ∧ 𝐵 = ⟨(1^st ‘𝐵), (2^nd ‘𝐵)⟩) → (((1^st ‘𝐵) ∈ 𝐴 ∧ (2^nd ‘𝐵) ∈ V) ↔ ((1^st ‘𝐵) ∈ 𝐴 ∧ (2^nd ‘𝐵) ∈ 𝐴)))
19		opelxp 5685	. . . . . . . 8 ⊢ (⟨(1^st ‘𝐵), (2^nd ‘𝐵)⟩ ∈ (𝐴 × V) ↔ ((1^st ‘𝐵) ∈ 𝐴 ∧ (2^nd ‘𝐵) ∈ V))
20		opelxp 5685	. . . . . . . 8 ⊢ (⟨(1^st ‘𝐵), (2^nd ‘𝐵)⟩ ∈ (𝐴 × 𝐴) ↔ ((1^st ‘𝐵) ∈ 𝐴 ∧ (2^nd ‘𝐵) ∈ 𝐴))
21	18, 19, 20	3bitr4g 316	. . . . . . 7 ⊢ (((1^st ‘𝐵) = (2^nd ‘𝐵) ∧ 𝐵 = ⟨(1^st ‘𝐵), (2^nd ‘𝐵)⟩) → (⟨(1^st ‘𝐵), (2^nd ‘𝐵)⟩ ∈ (𝐴 × V) ↔ ⟨(1^st ‘𝐵), (2^nd ‘𝐵)⟩ ∈ (𝐴 × 𝐴)))
22		eleq1 2852	. . . . . . . . 9 ⊢ (𝐵 = ⟨(1^st ‘𝐵), (2^nd ‘𝐵)⟩ → (𝐵 ∈ (𝐴 × 𝐴) ↔ ⟨(1^st ‘𝐵), (2^nd ‘𝐵)⟩ ∈ (𝐴 × 𝐴)))
23	22	bicomd 225	. . . . . . . 8 ⊢ (𝐵 = ⟨(1^st ‘𝐵), (2^nd ‘𝐵)⟩ → (⟨(1^st ‘𝐵), (2^nd ‘𝐵)⟩ ∈ (𝐴 × 𝐴) ↔ 𝐵 ∈ (𝐴 × 𝐴)))
24	23	adantl 485	. . . . . . 7 ⊢ (((1^st ‘𝐵) = (2^nd ‘𝐵) ∧ 𝐵 = ⟨(1^st ‘𝐵), (2^nd ‘𝐵)⟩) → (⟨(1^st ‘𝐵), (2^nd ‘𝐵)⟩ ∈ (𝐴 × 𝐴) ↔ 𝐵 ∈ (𝐴 × 𝐴)))
25	9, 21, 24	3bitrd 307	. . . . . 6 ⊢ (((1^st ‘𝐵) = (2^nd ‘𝐵) ∧ 𝐵 = ⟨(1^st ‘𝐵), (2^nd ‘𝐵)⟩) → (𝐵 ∈ (𝐴 × V) ↔ 𝐵 ∈ (𝐴 × 𝐴)))
26	25	pm5.32da 587	. . . . 5 ⊢ ((1^st ‘𝐵) = (2^nd ‘𝐵) → ((𝐵 = ⟨(1^st ‘𝐵), (2^nd ‘𝐵)⟩ ∧ 𝐵 ∈ (𝐴 × V)) ↔ (𝐵 = ⟨(1^st ‘𝐵), (2^nd ‘𝐵)⟩ ∧ 𝐵 ∈ (𝐴 × 𝐴))))
27		simpr 488	. . . . . 6 ⊢ ((𝐵 = ⟨(1^st ‘𝐵), (2^nd ‘𝐵)⟩ ∧ 𝐵 ∈ (𝐴 × 𝐴)) → 𝐵 ∈ (𝐴 × 𝐴))
28		1st2nd2 8011	. . . . . . 7 ⊢ (𝐵 ∈ (𝐴 × 𝐴) → 𝐵 = ⟨(1^st ‘𝐵), (2^nd ‘𝐵)⟩)
29	28	ancri 557	. . . . . 6 ⊢ (𝐵 ∈ (𝐴 × 𝐴) → (𝐵 = ⟨(1^st ‘𝐵), (2^nd ‘𝐵)⟩ ∧ 𝐵 ∈ (𝐴 × 𝐴)))
30	27, 29	impbii 211	. . . . 5 ⊢ ((𝐵 = ⟨(1^st ‘𝐵), (2^nd ‘𝐵)⟩ ∧ 𝐵 ∈ (𝐴 × 𝐴)) ↔ 𝐵 ∈ (𝐴 × 𝐴))
31	26, 30	bitrdi 289	. . . 4 ⊢ ((1^st ‘𝐵) = (2^nd ‘𝐵) → ((𝐵 = ⟨(1^st ‘𝐵), (2^nd ‘𝐵)⟩ ∧ 𝐵 ∈ (𝐴 × V)) ↔ 𝐵 ∈ (𝐴 × 𝐴)))
32	7, 31	bitrid 285	. . 3 ⊢ ((1^st ‘𝐵) = (2^nd ‘𝐵) → (𝐵 ∈ (𝐴 × V) ↔ 𝐵 ∈ (𝐴 × 𝐴)))
33	32	pm5.32ri 583	. 2 ⊢ ((𝐵 ∈ (𝐴 × V) ∧ (1^st ‘𝐵) = (2^nd ‘𝐵)) ↔ (𝐵 ∈ (𝐴 × 𝐴) ∧ (1^st ‘𝐵) = (2^nd ‘𝐵)))
34	3, 5, 33	3bitri 299	1 ⊢ (𝐵 ∈ ( I ↾ 𝐴) ↔ (𝐵 ∈ (𝐴 × 𝐴) ∧ (1^st ‘𝐵) = (2^nd ‘𝐵)))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 208 ∧ wa 399 = wceq 1562 ∈ wcel 2144 Vcvv 3456 ⟨cop 4590 I cid 5543 × cxp 5647 ↾ cres 5651 ‘cfv 6523 1^st c1st 7970 2^nd c2nd 7971

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1817 ax-4 1831 ax-5 1932 ax-6 1989 ax-7 2030 ax-8 2146 ax-9 2154 ax-10 2177 ax-11 2193 ax-12 2214 ax-ext 2736 ax-sep 5248 ax-nul 5258 ax-pr 5392 ax-un 7720

This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3an 1101 df-tru 1565 df-fal 1575 df-ex 1802 df-nf 1806 df-sb 2093 df-mo 2568 df-eu 2598 df-clab 2743 df-cleq 2756 df-clel 2839 df-nfc 2913 df-ne 2960 df-ral 3079 df-rex 3089 df-rab 3417 df-v 3458 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-nul 4288 df-if 4483 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-br 5103 df-opab 5165 df-mpt 5184 df-id 5544 df-xp 5655 df-rel 5656 df-cnv 5657 df-co 5658 df-dm 5659 df-rn 5660 df-res 5661 df-iota 6479 df-fun 6525 df-fv 6531 df-1st 7972 df-2nd 7973

This theorem is referenced by: (None)

W3C validator