Theorem tz7.48-1 8428

Description: Proposition 7.48(1) of [TakeutiZaring] p. 51. (Contributed by NM, 9-Feb-1997.)

Hypothesis

Ref	Expression
tz7.48.1	⊢ 𝐹 Fn On

Assertion

Ref	Expression
tz7.48-1	⊢ (∀𝑥 ∈ On (𝐹‘𝑥) ∈ (𝐴 ∖ (𝐹 “ 𝑥)) → ran 𝐹 ⊆ 𝐴)

Distinct variable groups:   𝑥,𝐹   𝑥,𝐴

Proof of Theorem tz7.48-1

Dummy variable 𝑦 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		vex 3458	. . . . 5 ⊢ 𝑦 ∈ V
2	1	elrn2 5881	. . . 4 ⊢ (𝑦 ∈ ran 𝐹 ↔ ∃𝑥⟨𝑥, 𝑦⟩ ∈ 𝐹)
3		vex 3458	. . . . . . . . 9 ⊢ 𝑥 ∈ V
4	3, 1	opeldm 5896	. . . . . . . 8 ⊢ (⟨𝑥, 𝑦⟩ ∈ 𝐹 → 𝑥 ∈ dom 𝐹)
5		tz7.48.1	. . . . . . . . 9 ⊢ 𝐹 Fn On
6	5	fndmi 6639	. . . . . . . 8 ⊢ dom 𝐹 = On
7	4, 6	eleqtrdi 2872	. . . . . . 7 ⊢ (⟨𝑥, 𝑦⟩ ∈ 𝐹 → 𝑥 ∈ On)
8	7	ancri 558	. . . . . 6 ⊢ (⟨𝑥, 𝑦⟩ ∈ 𝐹 → (𝑥 ∈ On ∧ ⟨𝑥, 𝑦⟩ ∈ 𝐹))
9		fnopfvb 6932	. . . . . . . 8 ⊢ ((𝐹 Fn On ∧ 𝑥 ∈ On) → ((𝐹‘𝑥) = 𝑦 ↔ ⟨𝑥, 𝑦⟩ ∈ 𝐹))
10	5, 9	mpan 702	. . . . . . 7 ⊢ (𝑥 ∈ On → ((𝐹‘𝑥) = 𝑦 ↔ ⟨𝑥, 𝑦⟩ ∈ 𝐹))
11	10	pm5.32i 584	. . . . . 6 ⊢ ((𝑥 ∈ On ∧ (𝐹‘𝑥) = 𝑦) ↔ (𝑥 ∈ On ∧ ⟨𝑥, 𝑦⟩ ∈ 𝐹))
12	8, 11	sylibr 237	. . . . 5 ⊢ (⟨𝑥, 𝑦⟩ ∈ 𝐹 → (𝑥 ∈ On ∧ (𝐹‘𝑥) = 𝑦))
13	12	eximi 1864	. . . 4 ⊢ (∃𝑥⟨𝑥, 𝑦⟩ ∈ 𝐹 → ∃𝑥(𝑥 ∈ On ∧ (𝐹‘𝑥) = 𝑦))
14	2, 13	sylbi 220	. . 3 ⊢ (𝑦 ∈ ran 𝐹 → ∃𝑥(𝑥 ∈ On ∧ (𝐹‘𝑥) = 𝑦))
15		nfra1 3288	. . . 4 ⊢ Ⅎ𝑥∀𝑥 ∈ On (𝐹‘𝑥) ∈ (𝐴 ∖ (𝐹 “ 𝑥))
16		nfv 1943	. . . 4 ⊢ Ⅎ𝑥 𝑦 ∈ 𝐴
17		rsp 3252	. . . . 5 ⊢ (∀𝑥 ∈ On (𝐹‘𝑥) ∈ (𝐴 ∖ (𝐹 “ 𝑥)) → (𝑥 ∈ On → (𝐹‘𝑥) ∈ (𝐴 ∖ (𝐹 “ 𝑥))))
18		eldifi 4084	. . . . . . . 8 ⊢ ((𝐹‘𝑥) ∈ (𝐴 ∖ (𝐹 “ 𝑥)) → (𝐹‘𝑥) ∈ 𝐴)
19		eleq1 2850	. . . . . . . 8 ⊢ ((𝐹‘𝑥) = 𝑦 → ((𝐹‘𝑥) ∈ 𝐴 ↔ 𝑦 ∈ 𝐴))
20	18, 19	syl5ibcom 248	. . . . . . 7 ⊢ ((𝐹‘𝑥) ∈ (𝐴 ∖ (𝐹 “ 𝑥)) → ((𝐹‘𝑥) = 𝑦 → 𝑦 ∈ 𝐴))
21	20	imim2i 17	. . . . . 6 ⊢ ((𝑥 ∈ On → (𝐹‘𝑥) ∈ (𝐴 ∖ (𝐹 “ 𝑥))) → (𝑥 ∈ On → ((𝐹‘𝑥) = 𝑦 → 𝑦 ∈ 𝐴)))
22	21	impd 415	. . . . 5 ⊢ ((𝑥 ∈ On → (𝐹‘𝑥) ∈ (𝐴 ∖ (𝐹 “ 𝑥))) → ((𝑥 ∈ On ∧ (𝐹‘𝑥) = 𝑦) → 𝑦 ∈ 𝐴))
23	17, 22	syl 18	. . . 4 ⊢ (∀𝑥 ∈ On (𝐹‘𝑥) ∈ (𝐴 ∖ (𝐹 “ 𝑥)) → ((𝑥 ∈ On ∧ (𝐹‘𝑥) = 𝑦) → 𝑦 ∈ 𝐴))
24	15, 16, 23	exlimd 2253	. . 3 ⊢ (∀𝑥 ∈ On (𝐹‘𝑥) ∈ (𝐴 ∖ (𝐹 “ 𝑥)) → (∃𝑥(𝑥 ∈ On ∧ (𝐹‘𝑥) = 𝑦) → 𝑦 ∈ 𝐴))
25	14, 24	syl5 35	. 2 ⊢ (∀𝑥 ∈ On (𝐹‘𝑥) ∈ (𝐴 ∖ (𝐹 “ 𝑥)) → (𝑦 ∈ ran 𝐹 → 𝑦 ∈ 𝐴))
26	25	ssrdv 3942	1 ⊢ (∀𝑥 ∈ On (𝐹‘𝑥) ∈ (𝐴 ∖ (𝐹 “ 𝑥)) → ran 𝐹 ⊆ 𝐴)

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 400   = wceq 1569  ∃wex 1808   ∈ wcel 2142  ∀wral 3078   ∖ cdif 3901   ⊆ wss 3904  ⟨cop 4594  dom cdm 5660  ran crn 5661   “ cima 5663  Oncon0 6360   Fn wfn 6531  ‘cfv 6536

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1824  ax-4 1838  ax-5 1939  ax-6 1996  ax-7 2037  ax-8 2144  ax-9 2152  ax-10 2175  ax-12 2212  ax-ext 2734  ax-sep 5256  ax-nul 5268  ax-pr 5403

This proof depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1104  df-tru 1572  df-fal 1582  df-ex 1809  df-nf 1813  df-sb 2096  df-mo 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-ne 2958  df-ral 3079  df-rex 3089  df-rab 3416  df-v 3456  df-dif 3907  df-un 3909  df-in 3911  df-ss 3921  df-nul 4286  df-if 4487  df-sn 4589  df-pr 4591  df-op 4595  df-uni 4872  df-br 5109  df-opab 5173  df-id 5555  df-xp 5666  df-rel 5667  df-cnv 5668  df-co 5669  df-dm 5670  df-rn 5671  df-iota 6492  df-fun 6538  df-fn 6539  df-fv 6544

This theorem is used by:  tz7.48-3  8429