Theorem djuf1olem 7393

Description: Lemma for djulf1o 7398 and djurf1o 7399. (Contributed by BJ and Jim Kingdon, 4-Jul-2022.)

Hypotheses

Ref	Expression
djuf1olem.1	⊢ 𝑋 ∈ V
djuf1olem.2	⊢ 𝐹 = (𝑥 ∈ 𝐴 ↦ ⟨𝑋, 𝑥⟩)

Assertion

Ref	Expression
djuf1olem	⊢ 𝐹:𝐴–1-1-onto→({𝑋} × 𝐴)

Distinct variable groups:   𝑥,𝑋   𝑥,𝐴

Allowed substitution hint:   𝐹(𝑥)

Proof of Theorem djuf1olem

Dummy variable 𝑦 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		djuf1olem.2	. . 3 ⊢ 𝐹 = (𝑥 ∈ 𝐴 ↦ ⟨𝑋, 𝑥⟩)
2		djuf1olem.1	. . . . . 6 ⊢ 𝑋 ∈ V
3	2	snid 3740	. . . . 5 ⊢ 𝑋 ∈ {𝑋}
4		opelxpi 4806	. . . . 5 ⊢ ((𝑋 ∈ {𝑋} ∧ 𝑥 ∈ 𝐴) → ⟨𝑋, 𝑥⟩ ∈ ({𝑋} × 𝐴))
5	3, 4	mpan 428	. . . 4 ⊢ (𝑥 ∈ 𝐴 → ⟨𝑋, 𝑥⟩ ∈ ({𝑋} × 𝐴))
6	5	adantl 277	. . 3 ⊢ ((⊤ ∧ 𝑥 ∈ 𝐴) → ⟨𝑋, 𝑥⟩ ∈ ({𝑋} × 𝐴))
7		xp2nd 6400	. . . 4 ⊢ (𝑦 ∈ ({𝑋} × 𝐴) → (2nd ‘𝑦) ∈ 𝐴)
8	7	adantl 277	. . 3 ⊢ ((⊤ ∧ 𝑦 ∈ ({𝑋} × 𝐴)) → (2nd ‘𝑦) ∈ 𝐴)
9		1st2nd2 6409	. . . . . . . 8 ⊢ (𝑦 ∈ ({𝑋} × 𝐴) → 𝑦 = ⟨(1st ‘𝑦), (2nd ‘𝑦)⟩)
10		xp1st 6399	. . . . . . . . . 10 ⊢ (𝑦 ∈ ({𝑋} × 𝐴) → (1st ‘𝑦) ∈ {𝑋})
11		elsni 3727	. . . . . . . . . 10 ⊢ ((1st ‘𝑦) ∈ {𝑋} → (1st ‘𝑦) = 𝑋)
12	10, 11	syl 14	. . . . . . . . 9 ⊢ (𝑦 ∈ ({𝑋} × 𝐴) → (1st ‘𝑦) = 𝑋)
13	12	opeq1d 3910	. . . . . . . 8 ⊢ (𝑦 ∈ ({𝑋} × 𝐴) → ⟨(1st ‘𝑦), (2nd ‘𝑦)⟩ = ⟨𝑋, (2nd ‘𝑦)⟩)
14	9, 13	eqtrd 2271	. . . . . . 7 ⊢ (𝑦 ∈ ({𝑋} × 𝐴) → 𝑦 = ⟨𝑋, (2nd ‘𝑦)⟩)
15	14	eqeq2d 2250	. . . . . 6 ⊢ (𝑦 ∈ ({𝑋} × 𝐴) → (⟨𝑋, 𝑥⟩ = 𝑦 ↔ ⟨𝑋, 𝑥⟩ = ⟨𝑋, (2nd ‘𝑦)⟩))
16		eqcom 2240	. . . . . 6 ⊢ (⟨𝑋, 𝑥⟩ = 𝑦 ↔ 𝑦 = ⟨𝑋, 𝑥⟩)
17		eqid 2238	. . . . . . 7 ⊢ 𝑋 = 𝑋
18		vex 2824	. . . . . . . 8 ⊢ 𝑥 ∈ V
19	2, 18	opth 4377	. . . . . . 7 ⊢ (⟨𝑋, 𝑥⟩ = ⟨𝑋, (2nd ‘𝑦)⟩ ↔ (𝑋 = 𝑋 ∧ 𝑥 = (2nd ‘𝑦)))
20	17, 19	mpbiran 953	. . . . . 6 ⊢ (⟨𝑋, 𝑥⟩ = ⟨𝑋, (2nd ‘𝑦)⟩ ↔ 𝑥 = (2nd ‘𝑦))
21	15, 16, 20	3bitr3g 222	. . . . 5 ⊢ (𝑦 ∈ ({𝑋} × 𝐴) → (𝑦 = ⟨𝑋, 𝑥⟩ ↔ 𝑥 = (2nd ‘𝑦)))
22	21	bicomd 141	. . . 4 ⊢ (𝑦 ∈ ({𝑋} × 𝐴) → (𝑥 = (2nd ‘𝑦) ↔ 𝑦 = ⟨𝑋, 𝑥⟩))
23	22	ad2antll 495	. . 3 ⊢ ((⊤ ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ ({𝑋} × 𝐴))) → (𝑥 = (2nd ‘𝑦) ↔ 𝑦 = ⟨𝑋, 𝑥⟩))
24	1, 6, 8, 23	f1o2d 6295	. 2 ⊢ (⊤ → 𝐹:𝐴–1-1-onto→({𝑋} × 𝐴))
25	24	mptru 1411	1 ⊢ 𝐹:𝐴–1-1-onto→({𝑋} × 𝐴)

This proof depends on syntax axioms:   ↔ wb 105   = wceq 1402  ⊤wtru 1403   ∈ wcel 2209  Vcvv 2821  {csn 3709  ⟨cop 3712   ↦ cmpt 4192   × cxp 4772  –1-1-onto→wf1o 5376  ‘cfv 5377  1^st c1st 6372  2^nd c2nd 6373

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4249  ax-pow 4311  ax-pr 4346  ax-un 4578

This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ral 2533  df-rex 2534  df-v 2823  df-sbc 3052  df-un 3224  df-in 3226  df-ss 3233  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-br 4131  df-opab 4193  df-mpt 4194  df-id 4438  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-iota 5337  df-fun 5379  df-fn 5380  df-f 5381  df-f1 5382  df-fo 5383  df-f1o 5384  df-fv 5385  df-1st 6374  df-2nd 6375

This theorem is used by:  djuf1olemr  7394  djulf1o  7398  djurf1o  7399