Theorem exmidfodomrlemim 7547

Description: Excluded middle implies the existence of a mapping from any set onto any inhabited set that it dominates. Proposition 1.1 of [PradicBrown2022], p. 2. (Contributed by Jim Kingdon, 1-Jul-2022.)

Assertion

Ref	Expression
exmidfodomrlemim	⊢ (EXMID → ∀𝑥∀𝑦((∃𝑧 𝑧 ∈ 𝑦 ∧ 𝑦 ≼ 𝑥) → ∃𝑓 𝑓:𝑥–onto→𝑦))

Distinct variable groups:   𝑥,𝑓,𝑧   𝑦,𝑓,𝑧

Proof of Theorem exmidfodomrlemim

Dummy variables 𝑔 𝑢 𝑣 𝑤 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		brdomi 7027	. . . . 5 ⊢ (𝑦 ≼ 𝑥 → ∃𝑔 𝑔:𝑦–1-1→𝑥)
2	1	ad2antll 495	. . . 4 ⊢ ((EXMID ∧ (∃𝑧 𝑧 ∈ 𝑦 ∧ 𝑦 ≼ 𝑥)) → ∃𝑔 𝑔:𝑦–1-1→𝑥)
3		df-f1 5380	. . . . . . . . . . . . . . . . 17 ⊢ (𝑔:𝑦–1-1→𝑥 ↔ (𝑔:𝑦⟶𝑥 ∧ Fun ◡𝑔))
4	3	simprbi 275	. . . . . . . . . . . . . . . 16 ⊢ (𝑔:𝑦–1-1→𝑥 → Fun ◡𝑔)
5		vex 2824	. . . . . . . . . . . . . . . . . 18 ⊢ 𝑧 ∈ V
6	5	fconst 5586	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑥 ∖ ran 𝑔) × {𝑧}):(𝑥 ∖ ran 𝑔)⟶{𝑧}
7		ffun 5534	. . . . . . . . . . . . . . . . 17 ⊢ (((𝑥 ∖ ran 𝑔) × {𝑧}):(𝑥 ∖ ran 𝑔)⟶{𝑧} → Fun ((𝑥 ∖ ran 𝑔) × {𝑧}))
8	6, 7	ax-mp 5	. . . . . . . . . . . . . . . 16 ⊢ Fun ((𝑥 ∖ ran 𝑔) × {𝑧})
9	4, 8	jctir 313	. . . . . . . . . . . . . . 15 ⊢ (𝑔:𝑦–1-1→𝑥 → (Fun ◡𝑔 ∧ Fun ((𝑥 ∖ ran 𝑔) × {𝑧})))
10		df-rn 4783	. . . . . . . . . . . . . . . . . 18 ⊢ ran 𝑔 = dom ◡𝑔
11	10	eqcomi 2242	. . . . . . . . . . . . . . . . 17 ⊢ dom ◡𝑔 = ran 𝑔
12	5	snm 3831	. . . . . . . . . . . . . . . . . 18 ⊢ ∃𝑤 𝑤 ∈ {𝑧}
13		dmxpm 5000	. . . . . . . . . . . . . . . . . 18 ⊢ (∃𝑤 𝑤 ∈ {𝑧} → dom ((𝑥 ∖ ran 𝑔) × {𝑧}) = (𝑥 ∖ ran 𝑔))
14	12, 13	ax-mp 5	. . . . . . . . . . . . . . . . 17 ⊢ dom ((𝑥 ∖ ran 𝑔) × {𝑧}) = (𝑥 ∖ ran 𝑔)
15	11, 14	ineq12i 3430	. . . . . . . . . . . . . . . 16 ⊢ (dom ◡𝑔 ∩ dom ((𝑥 ∖ ran 𝑔) × {𝑧})) = (ran 𝑔 ∩ (𝑥 ∖ ran 𝑔))
16		disjdif 3599	. . . . . . . . . . . . . . . 16 ⊢ (ran 𝑔 ∩ (𝑥 ∖ ran 𝑔)) = ∅
17	15, 16	eqtri 2259	. . . . . . . . . . . . . . 15 ⊢ (dom ◡𝑔 ∩ dom ((𝑥 ∖ ran 𝑔) × {𝑧})) = ∅
18		funun 5420	. . . . . . . . . . . . . . 15 ⊢ (((Fun ◡𝑔 ∧ Fun ((𝑥 ∖ ran 𝑔) × {𝑧})) ∧ (dom ◡𝑔 ∩ dom ((𝑥 ∖ ran 𝑔) × {𝑧})) = ∅) → Fun (◡𝑔 ∪ ((𝑥 ∖ ran 𝑔) × {𝑧})))
19	9, 17, 18	sylancl 417	. . . . . . . . . . . . . 14 ⊢ (𝑔:𝑦–1-1→𝑥 → Fun (◡𝑔 ∪ ((𝑥 ∖ ran 𝑔) × {𝑧})))
20	19	adantl 277	. . . . . . . . . . . . 13 ⊢ (((EXMID ∧ 𝑧 ∈ 𝑦) ∧ 𝑔:𝑦–1-1→𝑥) → Fun (◡𝑔 ∪ ((𝑥 ∖ ran 𝑔) × {𝑧})))
21		dmun 4986	. . . . . . . . . . . . . . 15 ⊢ dom (◡𝑔 ∪ ((𝑥 ∖ ran 𝑔) × {𝑧})) = (dom ◡𝑔 ∪ dom ((𝑥 ∖ ran 𝑔) × {𝑧}))
22	10	uneq1i 3379	. . . . . . . . . . . . . . 15 ⊢ (ran 𝑔 ∪ dom ((𝑥 ∖ ran 𝑔) × {𝑧})) = (dom ◡𝑔 ∪ dom ((𝑥 ∖ ran 𝑔) × {𝑧}))
23	14	uneq2i 3380	. . . . . . . . . . . . . . 15 ⊢ (ran 𝑔 ∪ dom ((𝑥 ∖ ran 𝑔) × {𝑧})) = (ran 𝑔 ∪ (𝑥 ∖ ran 𝑔))
24	21, 22, 23	3eqtr2i 2265	. . . . . . . . . . . . . 14 ⊢ dom (◡𝑔 ∪ ((𝑥 ∖ ran 𝑔) × {𝑧})) = (ran 𝑔 ∪ (𝑥 ∖ ran 𝑔))
25		f1rn 5597	. . . . . . . . . . . . . . . 16 ⊢ (𝑔:𝑦–1-1→𝑥 → ran 𝑔 ⊆ 𝑥)
26	25	adantl 277	. . . . . . . . . . . . . . 15 ⊢ (((EXMID ∧ 𝑧 ∈ 𝑦) ∧ 𝑔:𝑦–1-1→𝑥) → ran 𝑔 ⊆ 𝑥)
27		exmidexmid 4331	. . . . . . . . . . . . . . . . 17 ⊢ (EXMID → DECID 𝑢 ∈ ran 𝑔)
28	27	ralrimivw 2624	. . . . . . . . . . . . . . . 16 ⊢ (EXMID → ∀𝑢 ∈ 𝑥 DECID 𝑢 ∈ ran 𝑔)
29	28	ad2antrr 492	. . . . . . . . . . . . . . 15 ⊢ (((EXMID ∧ 𝑧 ∈ 𝑦) ∧ 𝑔:𝑦–1-1→𝑥) → ∀𝑢 ∈ 𝑥 DECID 𝑢 ∈ ran 𝑔)
30		undifdcss 7224	. . . . . . . . . . . . . . 15 ⊢ (𝑥 = (ran 𝑔 ∪ (𝑥 ∖ ran 𝑔)) ↔ (ran 𝑔 ⊆ 𝑥 ∧ ∀𝑢 ∈ 𝑥 DECID 𝑢 ∈ ran 𝑔))
31	26, 29, 30	sylanbrc 421	. . . . . . . . . . . . . 14 ⊢ (((EXMID ∧ 𝑧 ∈ 𝑦) ∧ 𝑔:𝑦–1-1→𝑥) → 𝑥 = (ran 𝑔 ∪ (𝑥 ∖ ran 𝑔)))
32	24, 31	eqtr4id 2290	. . . . . . . . . . . . 13 ⊢ (((EXMID ∧ 𝑧 ∈ 𝑦) ∧ 𝑔:𝑦–1-1→𝑥) → dom (◡𝑔 ∪ ((𝑥 ∖ ran 𝑔) × {𝑧})) = 𝑥)
33		df-fn 5378	. . . . . . . . . . . . 13 ⊢ ((◡𝑔 ∪ ((𝑥 ∖ ran 𝑔) × {𝑧})) Fn 𝑥 ↔ (Fun (◡𝑔 ∪ ((𝑥 ∖ ran 𝑔) × {𝑧})) ∧ dom (◡𝑔 ∪ ((𝑥 ∖ ran 𝑔) × {𝑧})) = 𝑥))
34	20, 32, 33	sylanbrc 421	. . . . . . . . . . . 12 ⊢ (((EXMID ∧ 𝑧 ∈ 𝑦) ∧ 𝑔:𝑦–1-1→𝑥) → (◡𝑔 ∪ ((𝑥 ∖ ran 𝑔) × {𝑧})) Fn 𝑥)
35		rnun 5194	. . . . . . . . . . . . 13 ⊢ ran (◡𝑔 ∪ ((𝑥 ∖ ran 𝑔) × {𝑧})) = (ran ◡𝑔 ∪ ran ((𝑥 ∖ ran 𝑔) × {𝑧}))
36		dfdm4 4971	. . . . . . . . . . . . . . . 16 ⊢ dom 𝑔 = ran ◡𝑔
37		f1dm 5601	. . . . . . . . . . . . . . . 16 ⊢ (𝑔:𝑦–1-1→𝑥 → dom 𝑔 = 𝑦)
38	36, 37	eqtr3id 2285	. . . . . . . . . . . . . . 15 ⊢ (𝑔:𝑦–1-1→𝑥 → ran ◡𝑔 = 𝑦)
39	38	uneq1d 3382	. . . . . . . . . . . . . 14 ⊢ (𝑔:𝑦–1-1→𝑥 → (ran ◡𝑔 ∪ ran ((𝑥 ∖ ran 𝑔) × {𝑧})) = (𝑦 ∪ ran ((𝑥 ∖ ran 𝑔) × {𝑧})))
40		exmidexmid 4331	. . . . . . . . . . . . . . . . . 18 ⊢ (EXMID → DECID ∃𝑣 𝑣 ∈ (𝑥 ∖ ran 𝑔))
41		exmiddc 848	. . . . . . . . . . . . . . . . . 18 ⊢ (DECID ∃𝑣 𝑣 ∈ (𝑥 ∖ ran 𝑔) → (∃𝑣 𝑣 ∈ (𝑥 ∖ ran 𝑔) ∨ ¬ ∃𝑣 𝑣 ∈ (𝑥 ∖ ran 𝑔)))
42	40, 41	syl 14	. . . . . . . . . . . . . . . . 17 ⊢ (EXMID → (∃𝑣 𝑣 ∈ (𝑥 ∖ ran 𝑔) ∨ ¬ ∃𝑣 𝑣 ∈ (𝑥 ∖ ran 𝑔)))
43		rnxpm 5215	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (∃𝑣 𝑣 ∈ (𝑥 ∖ ran 𝑔) → ran ((𝑥 ∖ ran 𝑔) × {𝑧}) = {𝑧})
44	43	adantr 276	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((∃𝑣 𝑣 ∈ (𝑥 ∖ ran 𝑔) ∧ 𝑧 ∈ 𝑦) → ran ((𝑥 ∖ ran 𝑔) × {𝑧}) = {𝑧})
45		snssi 3857	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (𝑧 ∈ 𝑦 → {𝑧} ⊆ 𝑦)
46	45	adantl 277	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((∃𝑣 𝑣 ∈ (𝑥 ∖ ran 𝑔) ∧ 𝑧 ∈ 𝑦) → {𝑧} ⊆ 𝑦)
47	44, 46	eqsstrd 3284	. . . . . . . . . . . . . . . . . . 19 ⊢ ((∃𝑣 𝑣 ∈ (𝑥 ∖ ran 𝑔) ∧ 𝑧 ∈ 𝑦) → ran ((𝑥 ∖ ran 𝑔) × {𝑧}) ⊆ 𝑦)
48	47	ex 115	. . . . . . . . . . . . . . . . . 18 ⊢ (∃𝑣 𝑣 ∈ (𝑥 ∖ ran 𝑔) → (𝑧 ∈ 𝑦 → ran ((𝑥 ∖ ran 𝑔) × {𝑧}) ⊆ 𝑦))
49		notm0 3542	. . . . . . . . . . . . . . . . . . 19 ⊢ (¬ ∃𝑣 𝑣 ∈ (𝑥 ∖ ran 𝑔) ↔ (𝑥 ∖ ran 𝑔) = ∅)
50		xpeq1 4786	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ ((𝑥 ∖ ran 𝑔) = ∅ → ((𝑥 ∖ ran 𝑔) × {𝑧}) = (∅ × {𝑧}))
51		0xp 4853	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ (∅ × {𝑧}) = ∅
52	50, 51	eqtrdi 2287	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ ((𝑥 ∖ ran 𝑔) = ∅ → ((𝑥 ∖ ran 𝑔) × {𝑧}) = ∅)
53	52	rneqd 5009	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ ((𝑥 ∖ ran 𝑔) = ∅ → ran ((𝑥 ∖ ran 𝑔) × {𝑧}) = ran ∅)
54		rn0 5036	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ ran ∅ = ∅
55	53, 54	eqtrdi 2287	. . . . . . . . . . . . . . . . . . . . 21 ⊢ ((𝑥 ∖ ran 𝑔) = ∅ → ran ((𝑥 ∖ ran 𝑔) × {𝑧}) = ∅)
56		0ss 3561	. . . . . . . . . . . . . . . . . . . . 21 ⊢ ∅ ⊆ 𝑦
57	55, 56	eqsstrdi 3300	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝑥 ∖ ran 𝑔) = ∅ → ran ((𝑥 ∖ ran 𝑔) × {𝑧}) ⊆ 𝑦)
58	57	a1d 22	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝑥 ∖ ran 𝑔) = ∅ → (𝑧 ∈ 𝑦 → ran ((𝑥 ∖ ran 𝑔) × {𝑧}) ⊆ 𝑦))
59	49, 58	sylbi 121	. . . . . . . . . . . . . . . . . 18 ⊢ (¬ ∃𝑣 𝑣 ∈ (𝑥 ∖ ran 𝑔) → (𝑧 ∈ 𝑦 → ran ((𝑥 ∖ ran 𝑔) × {𝑧}) ⊆ 𝑦))
60	48, 59	jaoi 728	. . . . . . . . . . . . . . . . 17 ⊢ ((∃𝑣 𝑣 ∈ (𝑥 ∖ ran 𝑔) ∨ ¬ ∃𝑣 𝑣 ∈ (𝑥 ∖ ran 𝑔)) → (𝑧 ∈ 𝑦 → ran ((𝑥 ∖ ran 𝑔) × {𝑧}) ⊆ 𝑦))
61	42, 60	syl 14	. . . . . . . . . . . . . . . 16 ⊢ (EXMID → (𝑧 ∈ 𝑦 → ran ((𝑥 ∖ ran 𝑔) × {𝑧}) ⊆ 𝑦))
62	61	imp 124	. . . . . . . . . . . . . . 15 ⊢ ((EXMID ∧ 𝑧 ∈ 𝑦) → ran ((𝑥 ∖ ran 𝑔) × {𝑧}) ⊆ 𝑦)
63		ssequn2 3402	. . . . . . . . . . . . . . 15 ⊢ (ran ((𝑥 ∖ ran 𝑔) × {𝑧}) ⊆ 𝑦 ↔ (𝑦 ∪ ran ((𝑥 ∖ ran 𝑔) × {𝑧})) = 𝑦)
64	62, 63	sylib 122	. . . . . . . . . . . . . 14 ⊢ ((EXMID ∧ 𝑧 ∈ 𝑦) → (𝑦 ∪ ran ((𝑥 ∖ ran 𝑔) × {𝑧})) = 𝑦)
65	39, 64	sylan9eqr 2293	. . . . . . . . . . . . 13 ⊢ (((EXMID ∧ 𝑧 ∈ 𝑦) ∧ 𝑔:𝑦–1-1→𝑥) → (ran ◡𝑔 ∪ ran ((𝑥 ∖ ran 𝑔) × {𝑧})) = 𝑦)
66	35, 65	eqtrid 2283	. . . . . . . . . . . 12 ⊢ (((EXMID ∧ 𝑧 ∈ 𝑦) ∧ 𝑔:𝑦–1-1→𝑥) → ran (◡𝑔 ∪ ((𝑥 ∖ ran 𝑔) × {𝑧})) = 𝑦)
67		df-fo 5381	. . . . . . . . . . . 12 ⊢ ((◡𝑔 ∪ ((𝑥 ∖ ran 𝑔) × {𝑧})):𝑥–onto→𝑦 ↔ ((◡𝑔 ∪ ((𝑥 ∖ ran 𝑔) × {𝑧})) Fn 𝑥 ∧ ran (◡𝑔 ∪ ((𝑥 ∖ ran 𝑔) × {𝑧})) = 𝑦))
68	34, 66, 67	sylanbrc 421	. . . . . . . . . . 11 ⊢ (((EXMID ∧ 𝑧 ∈ 𝑦) ∧ 𝑔:𝑦–1-1→𝑥) → (◡𝑔 ∪ ((𝑥 ∖ ran 𝑔) × {𝑧})):𝑥–onto→𝑦)
69		vex 2824	. . . . . . . . . . . . . 14 ⊢ 𝑔 ∈ V
70	69	cnvex 5324	. . . . . . . . . . . . 13 ⊢ ◡𝑔 ∈ V
71		vex 2824	. . . . . . . . . . . . . . 15 ⊢ 𝑥 ∈ V
72		difexg 4273	. . . . . . . . . . . . . . 15 ⊢ (𝑥 ∈ V → (𝑥 ∖ ran 𝑔) ∈ V)
73	71, 72	ax-mp 5	. . . . . . . . . . . . . 14 ⊢ (𝑥 ∖ ran 𝑔) ∈ V
74	5	snex 4320	. . . . . . . . . . . . . 14 ⊢ {𝑧} ∈ V
75	73, 74	xpex 4889	. . . . . . . . . . . . 13 ⊢ ((𝑥 ∖ ran 𝑔) × {𝑧}) ∈ V
76	70, 75	unex 4585	. . . . . . . . . . . 12 ⊢ (◡𝑔 ∪ ((𝑥 ∖ ran 𝑔) × {𝑧})) ∈ V
77		foeq1 5609	. . . . . . . . . . . 12 ⊢ (𝑓 = (◡𝑔 ∪ ((𝑥 ∖ ran 𝑔) × {𝑧})) → (𝑓:𝑥–onto→𝑦 ↔ (◡𝑔 ∪ ((𝑥 ∖ ran 𝑔) × {𝑧})):𝑥–onto→𝑦))
78	76, 77	spcev 2920	. . . . . . . . . . 11 ⊢ ((◡𝑔 ∪ ((𝑥 ∖ ran 𝑔) × {𝑧})):𝑥–onto→𝑦 → ∃𝑓 𝑓:𝑥–onto→𝑦)
79	68, 78	syl 14	. . . . . . . . . 10 ⊢ (((EXMID ∧ 𝑧 ∈ 𝑦) ∧ 𝑔:𝑦–1-1→𝑥) → ∃𝑓 𝑓:𝑥–onto→𝑦)
80	79	an32s 574	. . . . . . . . 9 ⊢ (((EXMID ∧ 𝑔:𝑦–1-1→𝑥) ∧ 𝑧 ∈ 𝑦) → ∃𝑓 𝑓:𝑥–onto→𝑦)
81	80	ex 115	. . . . . . . 8 ⊢ ((EXMID ∧ 𝑔:𝑦–1-1→𝑥) → (𝑧 ∈ 𝑦 → ∃𝑓 𝑓:𝑥–onto→𝑦))
82	81	exlimdv 1872	. . . . . . 7 ⊢ ((EXMID ∧ 𝑔:𝑦–1-1→𝑥) → (∃𝑧 𝑧 ∈ 𝑦 → ∃𝑓 𝑓:𝑥–onto→𝑦))
83	82	imp 124	. . . . . 6 ⊢ (((EXMID ∧ 𝑔:𝑦–1-1→𝑥) ∧ ∃𝑧 𝑧 ∈ 𝑦) → ∃𝑓 𝑓:𝑥–onto→𝑦)
84	83	an32s 574	. . . . 5 ⊢ (((EXMID ∧ ∃𝑧 𝑧 ∈ 𝑦) ∧ 𝑔:𝑦–1-1→𝑥) → ∃𝑓 𝑓:𝑥–onto→𝑦)
85	84	adantlrr 487	. . . 4 ⊢ (((EXMID ∧ (∃𝑧 𝑧 ∈ 𝑦 ∧ 𝑦 ≼ 𝑥)) ∧ 𝑔:𝑦–1-1→𝑥) → ∃𝑓 𝑓:𝑥–onto→𝑦)
86	2, 85	exlimddv 1954	. . 3 ⊢ ((EXMID ∧ (∃𝑧 𝑧 ∈ 𝑦 ∧ 𝑦 ≼ 𝑥)) → ∃𝑓 𝑓:𝑥–onto→𝑦)
87	86	ex 115	. 2 ⊢ (EXMID → ((∃𝑧 𝑧 ∈ 𝑦 ∧ 𝑦 ≼ 𝑥) → ∃𝑓 𝑓:𝑥–onto→𝑦))
88	87	alrimivv 1928	1 ⊢ (EXMID → ∀𝑥∀𝑦((∃𝑧 𝑧 ∈ 𝑦 ∧ 𝑦 ≼ 𝑥) → ∃𝑓 𝑓:𝑥–onto→𝑦))

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 104   ∨ wo 720  DECID wdc 846  ∀wal 1400   = wceq 1402  ∃wex 1545   ∈ wcel 2209  ∀wral 2528  Vcvv 2821   ∖ cdif 3217   ∪ cun 3218   ∩ cin 3219   ⊆ wss 3220  ∅c0 3520  {csn 3708   class class class wbr 4128  EXMIDwem 4329   × cxp 4770  ^◡ccnv 4771  dom cdm 4772  ran crn 4773  Fun wfun 5369   Fn wfn 5370  ⟶wf 5371  –1-1→wf1 5372  –onto→wfo 5373   ≼ cdom 7015

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  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 4247  ax-nul 4257  ax-pow 4309  ax-pr 4344  ax-un 4576

This theorem depends on definitions:  df-bi 117  df-dc 847  df-3an 1011  df-tru 1405  df-fal 1408  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-rab 2537  df-v 2823  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-nul 3521  df-pw 3690  df-sn 3714  df-pr 3715  df-op 3717  df-uni 3934  df-br 4129  df-opab 4191  df-mpt 4192  df-exmid 4330  df-id 4436  df-xp 4778  df-rel 4779  df-cnv 4780  df-co 4781  df-dm 4782  df-rn 4783  df-fun 5377  df-fn 5378  df-f 5379  df-f1 5380  df-fo 5381  df-dom 7018

This theorem is referenced by:  exmidfodomr  7550