Theorem tz7.48-1 8435

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 3457	. . . . 5 ⊢ 𝑦 ∈ V
2	1	elrn2 5880	. . . 4 ⊢ (𝑦 ∈ ran 𝐹 ↔ ∃𝑥⟨𝑥, 𝑦⟩ ∈ 𝐹)
3		vex 3457	. . . . . . . . 9 ⊢ 𝑥 ∈ V
4	3, 1	opeldm 5895	. . . . . . . 8 ⊢ (⟨𝑥, 𝑦⟩ ∈ 𝐹 → 𝑥 ∈ dom 𝐹)
5		tz7.48.1	. . . . . . . . 9 ⊢ 𝐹 Fn On
6	5	fndmi 6640	. . . . . . . 8 ⊢ dom 𝐹 = On
7	4, 6	eleqtrdi 2872	. . . . . . 7 ⊢ (⟨𝑥, 𝑦⟩ ∈ 𝐹 → 𝑥 ∈ On)
8	7	ancri 559	. . . . . 6 ⊢ (⟨𝑥, 𝑦⟩ ∈ 𝐹 → (𝑥 ∈ On ∧ ⟨𝑥, 𝑦⟩ ∈ 𝐹))
9		fnopfvb 6933	. . . . . . . 8 ⊢ ((𝐹 Fn On ∧ 𝑥 ∈ On) → ((𝐹‘𝑥) = 𝑦 ↔ ⟨𝑥, 𝑦⟩ ∈ 𝐹))
10	5, 9	mpan 703	. . . . . . 7 ⊢ (𝑥 ∈ On → ((𝐹‘𝑥) = 𝑦 ↔ ⟨𝑥, 𝑦⟩ ∈ 𝐹))
11	10	pm5.32i 585	. . . . . 6 ⊢ ((𝑥 ∈ On ∧ (𝐹‘𝑥) = 𝑦) ↔ (𝑥 ∈ On ∧ ⟨𝑥, 𝑦⟩ ∈ 𝐹))
12	8, 11	sylibr 237	. . . . 5 ⊢ (⟨𝑥, 𝑦⟩ ∈ 𝐹 → (𝑥 ∈ On ∧ (𝐹‘𝑥) = 𝑦))
13	12	eximi 1868	. . . 4 ⊢ (∃𝑥⟨𝑥, 𝑦⟩ ∈ 𝐹 → ∃𝑥(𝑥 ∈ On ∧ (𝐹‘𝑥) = 𝑦))
14	2, 13	sylbi 220	. . 3 ⊢ (𝑦 ∈ ran 𝐹 → ∃𝑥(𝑥 ∈ On ∧ (𝐹‘𝑥) = 𝑦))
15		nfra1 3288	. . . 4 ⊢ Ⅎ𝑥∀𝑥 ∈ On (𝐹‘𝑥) ∈ (𝐴 ∖ (𝐹 “ 𝑥))
16		nfv 1947	. . . 4 ⊢ Ⅎ𝑥 𝑦 ∈ 𝐴
17		rsp 3252	. . . . 5 ⊢ (∀𝑥 ∈ On (𝐹‘𝑥) ∈ (𝐴 ∖ (𝐹 “ 𝑥)) → (𝑥 ∈ On → (𝐹‘𝑥) ∈ (𝐴 ∖ (𝐹 “ 𝑥))))
18		eldifi 4081	. . . . . . . 8 ⊢ ((𝐹‘𝑥) ∈ (𝐴 ∖ (𝐹 “ 𝑥)) → (𝐹‘𝑥) ∈ 𝐴)
19		eleq1 2850	. . . . . . . 8 ⊢ ((𝐹‘𝑥) = 𝑦 → ((𝐹‘𝑥) ∈ 𝐴 ↔ 𝑦 ∈ 𝐴))
20	18, 19	syl5ibcom 248	. . . . . . 7 ⊢ ((𝐹‘𝑥) ∈ (𝐴 ∖ (𝐹 “ 𝑥)) → ((𝐹‘𝑥) = 𝑦 → 𝑦 ∈ 𝐴))
21	20	imim2i 17	. . . . . 6 ⊢ ((𝑥 ∈ On → (𝐹‘𝑥) ∈ (𝐴 ∖ (𝐹 “ 𝑥))) → (𝑥 ∈ On → ((𝐹‘𝑥) = 𝑦 → 𝑦 ∈ 𝐴)))
22	21	impd 416	. . . . 5 ⊢ ((𝑥 ∈ On → (𝐹‘𝑥) ∈ (𝐴 ∖ (𝐹 “ 𝑥))) → ((𝑥 ∈ On ∧ (𝐹‘𝑥) = 𝑦) → 𝑦 ∈ 𝐴))
23	17, 22	syl 18	. . . 4 ⊢ (∀𝑥 ∈ On (𝐹‘𝑥) ∈ (𝐴 ∖ (𝐹 “ 𝑥)) → ((𝑥 ∈ On ∧ (𝐹‘𝑥) = 𝑦) → 𝑦 ∈ 𝐴))
24	15, 16, 23	exlimd 2256	. . 3 ⊢ (∀𝑥 ∈ On (𝐹‘𝑥) ∈ (𝐴 ∖ (𝐹 “ 𝑥)) → (∃𝑥(𝑥 ∈ On ∧ (𝐹‘𝑥) = 𝑦) → 𝑦 ∈ 𝐴))
25	14, 24	syl5 35	. 2 ⊢ (∀𝑥 ∈ On (𝐹‘𝑥) ∈ (𝐴 ∖ (𝐹 “ 𝑥)) → (𝑦 ∈ ran 𝐹 → 𝑦 ∈ 𝐴))
26	25	ssrdv 3940	1 ⊢ (∀𝑥 ∈ On (𝐹‘𝑥) ∈ (𝐴 ∖ (𝐹 “ 𝑥)) → ran 𝐹 ⊆ 𝐴)

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570  ∃wex 1812   ∈ wcel 2145  ∀wral 3078   ∖ cdif 3899   ⊆ wss 3902  ⟨cop 4593  dom cdm 5659  ran crn 5660   “ cima 5662  Oncon0 6361   Fn wfn 6532  ‘cfv 6537

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 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-12 2215  ax-ext 2734  ax-sep 5255  ax-nul 5267  ax-pr 5402

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 2100  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 3415  df-v 3455  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4283  df-if 4486  df-sn 4588  df-pr 4590  df-op 4594  df-uni 4871  df-br 5108  df-opab 5172  df-id 5554  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-rn 5670  df-iota 6493  df-fun 6539  df-fn 6540  df-fv 6545

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