Theorem funopsnOLD 7176

Description: Obsolete version of funopsn 7175 as of 9-May-2026. (Contributed by AV, 20-Sep-2020.) (Proof shortened by AV, 15-Jul-2021.) (New usage is discouraged.) (Proof modification is discouraged.)

Hypotheses

Ref	Expression
funopsn.x	⊢ 𝑋 ∈ V
funopsn.y	⊢ 𝑌 ∈ V

Assertion

Ref	Expression
funopsnOLD	⊢ ((Fun 𝐹 ∧ 𝐹 = ⟨𝑋, 𝑌⟩) → ∃𝑎(𝑋 = {𝑎} ∧ 𝐹 = {⟨𝑎, 𝑎⟩}))

Distinct variable groups:   𝐹,𝑎   𝑋,𝑎   𝑌,𝑎

Proof of Theorem funopsnOLD

Dummy variable 𝑥 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		funiun 7174	. 2 ⊢ (Fun 𝐹 → 𝐹 = ∪ 𝑥 ∈ dom 𝐹{⟨𝑥, (𝐹‘𝑥)⟩})
2		eqeq1 2767	. . . . . . 7 ⊢ (𝐹 = ⟨𝑋, 𝑌⟩ → (𝐹 = ∪ 𝑥 ∈ dom 𝐹{⟨𝑥, (𝐹‘𝑥)⟩} ↔ ⟨𝑋, 𝑌⟩ = ∪ 𝑥 ∈ dom 𝐹{⟨𝑥, (𝐹‘𝑥)⟩}))
3		eqcom 2770	. . . . . . 7 ⊢ (⟨𝑋, 𝑌⟩ = ∪ 𝑥 ∈ dom 𝐹{⟨𝑥, (𝐹‘𝑥)⟩} ↔ ∪ 𝑥 ∈ dom 𝐹{⟨𝑥, (𝐹‘𝑥)⟩} = ⟨𝑋, 𝑌⟩)
4	2, 3	bitrdi 290	. . . . . 6 ⊢ (𝐹 = ⟨𝑋, 𝑌⟩ → (𝐹 = ∪ 𝑥 ∈ dom 𝐹{⟨𝑥, (𝐹‘𝑥)⟩} ↔ ∪ 𝑥 ∈ dom 𝐹{⟨𝑥, (𝐹‘𝑥)⟩} = ⟨𝑋, 𝑌⟩))
5	4	adantl 487	. . . . 5 ⊢ ((Fun 𝐹 ∧ 𝐹 = ⟨𝑋, 𝑌⟩) → (𝐹 = ∪ 𝑥 ∈ dom 𝐹{⟨𝑥, (𝐹‘𝑥)⟩} ↔ ∪ 𝑥 ∈ dom 𝐹{⟨𝑥, (𝐹‘𝑥)⟩} = ⟨𝑋, 𝑌⟩))
6		funopsn.x	. . . . . . . 8 ⊢ 𝑋 ∈ V
7		funopsn.y	. . . . . . . 8 ⊢ 𝑌 ∈ V
8	6, 7	opnzi 5447	. . . . . . 7 ⊢ ⟨𝑋, 𝑌⟩ ≠ ∅
9		neeq1 3021	. . . . . . . . . . 11 ⊢ (⟨𝑋, 𝑌⟩ = 𝐹 → (⟨𝑋, 𝑌⟩ ≠ ∅ ↔ 𝐹 ≠ ∅))
10	9	eqcoms 2771	. . . . . . . . . 10 ⊢ (𝐹 = ⟨𝑋, 𝑌⟩ → (⟨𝑋, 𝑌⟩ ≠ ∅ ↔ 𝐹 ≠ ∅))
11		funrel 6576	. . . . . . . . . . . . . 14 ⊢ (Fun 𝐹 → Rel 𝐹)
12		reldm0 5917	. . . . . . . . . . . . . 14 ⊢ (Rel 𝐹 → (𝐹 = ∅ ↔ dom 𝐹 = ∅))
13	11, 12	syl 18	. . . . . . . . . . . . 13 ⊢ (Fun 𝐹 → (𝐹 = ∅ ↔ dom 𝐹 = ∅))
14	13	biimprd 251	. . . . . . . . . . . 12 ⊢ (Fun 𝐹 → (dom 𝐹 = ∅ → 𝐹 = ∅))
15	14	necon3d 2980	. . . . . . . . . . 11 ⊢ (Fun 𝐹 → (𝐹 ≠ ∅ → dom 𝐹 ≠ ∅))
16	15	com12 33	. . . . . . . . . 10 ⊢ (𝐹 ≠ ∅ → (Fun 𝐹 → dom 𝐹 ≠ ∅))
17	10, 16	biimtrdi 256	. . . . . . . . 9 ⊢ (𝐹 = ⟨𝑋, 𝑌⟩ → (⟨𝑋, 𝑌⟩ ≠ ∅ → (Fun 𝐹 → dom 𝐹 ≠ ∅)))
18	17	com3l 90	. . . . . . . 8 ⊢ (⟨𝑋, 𝑌⟩ ≠ ∅ → (Fun 𝐹 → (𝐹 = ⟨𝑋, 𝑌⟩ → dom 𝐹 ≠ ∅)))
19	18	impd 416	. . . . . . 7 ⊢ (⟨𝑋, 𝑌⟩ ≠ ∅ → ((Fun 𝐹 ∧ 𝐹 = ⟨𝑋, 𝑌⟩) → dom 𝐹 ≠ ∅))
20	8, 19	ax-mp 5	. . . . . 6 ⊢ ((Fun 𝐹 ∧ 𝐹 = ⟨𝑋, 𝑌⟩) → dom 𝐹 ≠ ∅)
21		fvex 6921	. . . . . . 7 ⊢ (𝐹‘𝑥) ∈ V
22	21, 6, 7	iunopeqopOLD 5499	. . . . . 6 ⊢ (dom 𝐹 ≠ ∅ → (∪ 𝑥 ∈ dom 𝐹{⟨𝑥, (𝐹‘𝑥)⟩} = ⟨𝑋, 𝑌⟩ → ∃𝑎dom 𝐹 = {𝑎}))
23	20, 22	syl 18	. . . . 5 ⊢ ((Fun 𝐹 ∧ 𝐹 = ⟨𝑋, 𝑌⟩) → (∪ 𝑥 ∈ dom 𝐹{⟨𝑥, (𝐹‘𝑥)⟩} = ⟨𝑋, 𝑌⟩ → ∃𝑎dom 𝐹 = {𝑎}))
24	5, 23	sylbid 243	. . . 4 ⊢ ((Fun 𝐹 ∧ 𝐹 = ⟨𝑋, 𝑌⟩) → (𝐹 = ∪ 𝑥 ∈ dom 𝐹{⟨𝑥, (𝐹‘𝑥)⟩} → ∃𝑎dom 𝐹 = {𝑎}))
25	24	imp 412	. . 3 ⊢ (((Fun 𝐹 ∧ 𝐹 = ⟨𝑋, 𝑌⟩) ∧ 𝐹 = ∪ 𝑥 ∈ dom 𝐹{⟨𝑥, (𝐹‘𝑥)⟩}) → ∃𝑎dom 𝐹 = {𝑎})
26		iuneq1 4971	. . . . . . . . 9 ⊢ (dom 𝐹 = {𝑎} → ∪ 𝑥 ∈ dom 𝐹{⟨𝑥, (𝐹‘𝑥)⟩} = ∪ 𝑥 ∈ {𝑎} {⟨𝑥, (𝐹‘𝑥)⟩})
27		vex 3458	. . . . . . . . . 10 ⊢ 𝑎 ∈ V
28		id 23	. . . . . . . . . . . 12 ⊢ (𝑥 = 𝑎 → 𝑥 = 𝑎)
29		fveq2 6908	. . . . . . . . . . . 12 ⊢ (𝑥 = 𝑎 → (𝐹‘𝑥) = (𝐹‘𝑎))
30	28, 29	opeq12d 4851	. . . . . . . . . . 11 ⊢ (𝑥 = 𝑎 → ⟨𝑥, (𝐹‘𝑥)⟩ = ⟨𝑎, (𝐹‘𝑎)⟩)
31	30	sneqd 4596	. . . . . . . . . 10 ⊢ (𝑥 = 𝑎 → {⟨𝑥, (𝐹‘𝑥)⟩} = {⟨𝑎, (𝐹‘𝑎)⟩})
32	27, 31	iunxsn 5054	. . . . . . . . 9 ⊢ ∪ 𝑥 ∈ {𝑎} {⟨𝑥, (𝐹‘𝑥)⟩} = {⟨𝑎, (𝐹‘𝑎)⟩}
33	26, 32	eqtrdi 2814	. . . . . . . 8 ⊢ (dom 𝐹 = {𝑎} → ∪ 𝑥 ∈ dom 𝐹{⟨𝑥, (𝐹‘𝑥)⟩} = {⟨𝑎, (𝐹‘𝑎)⟩})
34	33	adantl 487	. . . . . . 7 ⊢ (((Fun 𝐹 ∧ 𝐹 = ⟨𝑋, 𝑌⟩) ∧ dom 𝐹 = {𝑎}) → ∪ 𝑥 ∈ dom 𝐹{⟨𝑥, (𝐹‘𝑥)⟩} = {⟨𝑎, (𝐹‘𝑎)⟩})
35	34	eqeq2d 2774	. . . . . 6 ⊢ (((Fun 𝐹 ∧ 𝐹 = ⟨𝑋, 𝑌⟩) ∧ dom 𝐹 = {𝑎}) → (𝐹 = ∪ 𝑥 ∈ dom 𝐹{⟨𝑥, (𝐹‘𝑥)⟩} ↔ 𝐹 = {⟨𝑎, (𝐹‘𝑎)⟩}))
36		eqeq1 2767	. . . . . . . . . . 11 ⊢ (𝐹 = ⟨𝑋, 𝑌⟩ → (𝐹 = {⟨𝑎, (𝐹‘𝑎)⟩} ↔ ⟨𝑋, 𝑌⟩ = {⟨𝑎, (𝐹‘𝑎)⟩}))
37	36	adantl 487	. . . . . . . . . 10 ⊢ ((Fun 𝐹 ∧ 𝐹 = ⟨𝑋, 𝑌⟩) → (𝐹 = {⟨𝑎, (𝐹‘𝑎)⟩} ↔ ⟨𝑋, 𝑌⟩ = {⟨𝑎, (𝐹‘𝑎)⟩}))
38		eqcom 2770	. . . . . . . . . . 11 ⊢ (⟨𝑋, 𝑌⟩ = {⟨𝑎, (𝐹‘𝑎)⟩} ↔ {⟨𝑎, (𝐹‘𝑎)⟩} = ⟨𝑋, 𝑌⟩)
39		fvex 6921	. . . . . . . . . . . 12 ⊢ (𝐹‘𝑎) ∈ V
40	27, 39	snopeqop 5482	. . . . . . . . . . 11 ⊢ ({⟨𝑎, (𝐹‘𝑎)⟩} = ⟨𝑋, 𝑌⟩ ↔ (𝑎 = (𝐹‘𝑎) ∧ 𝑋 = 𝑌 ∧ 𝑋 = {𝑎}))
41	38, 40	sylbb 222	. . . . . . . . . 10 ⊢ (⟨𝑋, 𝑌⟩ = {⟨𝑎, (𝐹‘𝑎)⟩} → (𝑎 = (𝐹‘𝑎) ∧ 𝑋 = 𝑌 ∧ 𝑋 = {𝑎}))
42	37, 41	biimtrdi 256	. . . . . . . . 9 ⊢ ((Fun 𝐹 ∧ 𝐹 = ⟨𝑋, 𝑌⟩) → (𝐹 = {⟨𝑎, (𝐹‘𝑎)⟩} → (𝑎 = (𝐹‘𝑎) ∧ 𝑋 = 𝑌 ∧ 𝑋 = {𝑎})))
43	42	imp 412	. . . . . . . 8 ⊢ (((Fun 𝐹 ∧ 𝐹 = ⟨𝑋, 𝑌⟩) ∧ 𝐹 = {⟨𝑎, (𝐹‘𝑎)⟩}) → (𝑎 = (𝐹‘𝑎) ∧ 𝑋 = 𝑌 ∧ 𝑋 = {𝑎}))
44		simpr3 1215	. . . . . . . . . . . 12 ⊢ ((𝐹 = {⟨𝑎, (𝐹‘𝑎)⟩} ∧ (𝑎 = (𝐹‘𝑎) ∧ 𝑋 = 𝑌 ∧ 𝑋 = {𝑎})) → 𝑋 = {𝑎})
45		simp1 1154	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑎 = (𝐹‘𝑎) ∧ 𝑋 = 𝑌 ∧ 𝑋 = {𝑎}) → 𝑎 = (𝐹‘𝑎))
46	45	eqcomd 2769	. . . . . . . . . . . . . . . 16 ⊢ ((𝑎 = (𝐹‘𝑎) ∧ 𝑋 = 𝑌 ∧ 𝑋 = {𝑎}) → (𝐹‘𝑎) = 𝑎)
47	46	opeq2d 4850	. . . . . . . . . . . . . . 15 ⊢ ((𝑎 = (𝐹‘𝑎) ∧ 𝑋 = 𝑌 ∧ 𝑋 = {𝑎}) → ⟨𝑎, (𝐹‘𝑎)⟩ = ⟨𝑎, 𝑎⟩)
48	47	sneqd 4596	. . . . . . . . . . . . . 14 ⊢ ((𝑎 = (𝐹‘𝑎) ∧ 𝑋 = 𝑌 ∧ 𝑋 = {𝑎}) → {⟨𝑎, (𝐹‘𝑎)⟩} = {⟨𝑎, 𝑎⟩})
49	48	eqeq2d 2774	. . . . . . . . . . . . 13 ⊢ ((𝑎 = (𝐹‘𝑎) ∧ 𝑋 = 𝑌 ∧ 𝑋 = {𝑎}) → (𝐹 = {⟨𝑎, (𝐹‘𝑎)⟩} ↔ 𝐹 = {⟨𝑎, 𝑎⟩}))
50	49	biimpac 484	. . . . . . . . . . . 12 ⊢ ((𝐹 = {⟨𝑎, (𝐹‘𝑎)⟩} ∧ (𝑎 = (𝐹‘𝑎) ∧ 𝑋 = 𝑌 ∧ 𝑋 = {𝑎})) → 𝐹 = {⟨𝑎, 𝑎⟩})
51	44, 50	jca 521	. . . . . . . . . . 11 ⊢ ((𝐹 = {⟨𝑎, (𝐹‘𝑎)⟩} ∧ (𝑎 = (𝐹‘𝑎) ∧ 𝑋 = 𝑌 ∧ 𝑋 = {𝑎})) → (𝑋 = {𝑎} ∧ 𝐹 = {⟨𝑎, 𝑎⟩}))
52	51	ex 418	. . . . . . . . . 10 ⊢ (𝐹 = {⟨𝑎, (𝐹‘𝑎)⟩} → ((𝑎 = (𝐹‘𝑎) ∧ 𝑋 = 𝑌 ∧ 𝑋 = {𝑎}) → (𝑋 = {𝑎} ∧ 𝐹 = {⟨𝑎, 𝑎⟩})))
53	52	adantl 487	. . . . . . . . 9 ⊢ (((Fun 𝐹 ∧ 𝐹 = ⟨𝑋, 𝑌⟩) ∧ 𝐹 = {⟨𝑎, (𝐹‘𝑎)⟩}) → ((𝑎 = (𝐹‘𝑎) ∧ 𝑋 = 𝑌 ∧ 𝑋 = {𝑎}) → (𝑋 = {𝑎} ∧ 𝐹 = {⟨𝑎, 𝑎⟩})))
54	53	a1dd 51	. . . . . . . 8 ⊢ (((Fun 𝐹 ∧ 𝐹 = ⟨𝑋, 𝑌⟩) ∧ 𝐹 = {⟨𝑎, (𝐹‘𝑎)⟩}) → ((𝑎 = (𝐹‘𝑎) ∧ 𝑋 = 𝑌 ∧ 𝑋 = {𝑎}) → (dom 𝐹 = {𝑎} → (𝑋 = {𝑎} ∧ 𝐹 = {⟨𝑎, 𝑎⟩}))))
55	43, 54	mpd 16	. . . . . . 7 ⊢ (((Fun 𝐹 ∧ 𝐹 = ⟨𝑋, 𝑌⟩) ∧ 𝐹 = {⟨𝑎, (𝐹‘𝑎)⟩}) → (dom 𝐹 = {𝑎} → (𝑋 = {𝑎} ∧ 𝐹 = {⟨𝑎, 𝑎⟩})))
56	55	impancom 457	. . . . . 6 ⊢ (((Fun 𝐹 ∧ 𝐹 = ⟨𝑋, 𝑌⟩) ∧ dom 𝐹 = {𝑎}) → (𝐹 = {⟨𝑎, (𝐹‘𝑎)⟩} → (𝑋 = {𝑎} ∧ 𝐹 = {⟨𝑎, 𝑎⟩})))
57	35, 56	sylbid 243	. . . . 5 ⊢ (((Fun 𝐹 ∧ 𝐹 = ⟨𝑋, 𝑌⟩) ∧ dom 𝐹 = {𝑎}) → (𝐹 = ∪ 𝑥 ∈ dom 𝐹{⟨𝑥, (𝐹‘𝑥)⟩} → (𝑋 = {𝑎} ∧ 𝐹 = {⟨𝑎, 𝑎⟩})))
58	57	impancom 457	. . . 4 ⊢ (((Fun 𝐹 ∧ 𝐹 = ⟨𝑋, 𝑌⟩) ∧ 𝐹 = ∪ 𝑥 ∈ dom 𝐹{⟨𝑥, (𝐹‘𝑥)⟩}) → (dom 𝐹 = {𝑎} → (𝑋 = {𝑎} ∧ 𝐹 = {⟨𝑎, 𝑎⟩})))
59	58	eximdv 1952	. . 3 ⊢ (((Fun 𝐹 ∧ 𝐹 = ⟨𝑋, 𝑌⟩) ∧ 𝐹 = ∪ 𝑥 ∈ dom 𝐹{⟨𝑥, (𝐹‘𝑥)⟩}) → (∃𝑎dom 𝐹 = {𝑎} → ∃𝑎(𝑋 = {𝑎} ∧ 𝐹 = {⟨𝑎, 𝑎⟩})))
60	25, 59	mpd 16	. 2 ⊢ (((Fun 𝐹 ∧ 𝐹 = ⟨𝑋, 𝑌⟩) ∧ 𝐹 = ∪ 𝑥 ∈ dom 𝐹{⟨𝑥, (𝐹‘𝑥)⟩}) → ∃𝑎(𝑋 = {𝑎} ∧ 𝐹 = {⟨𝑎, 𝑎⟩}))
61	1, 60	mpidan 702	1 ⊢ ((Fun 𝐹 ∧ 𝐹 = ⟨𝑋, 𝑌⟩) → ∃𝑎(𝑋 = {𝑎} ∧ 𝐹 = {⟨𝑎, 𝑎⟩}))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   = wceq 1570  ∃wex 1812   ∈ wcel 2147   ≠ wne 2959  Vcvv 3454  ∅c0 4281  {csn 4588  ⟨cop 4838  ∪ ciun 4954  dom cdm 5655  Rel wrel 5660  Fun wfun 6552  ‘cfv 6558

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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5252  ax-nul 5263  ax-pr 5395

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 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-iun 4956  df-br 5107  df-opab 5171  df-mpt 5190  df-id 5550  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-iota 6512  df-fun 6560  df-fn 6561  df-f 6562  df-f1 6563  df-fo 6564  df-f1o 6565  df-fv 6566

This theorem is used by: (None)