Theorem tz7.48-1 8157

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 3402	. . . . 5 ⊢ 𝑦 ∈ V
2	1	elrn2 5746	. . . 4 ⊢ (𝑦 ∈ ran 𝐹 ↔ ∃𝑥⟨𝑥, 𝑦⟩ ∈ 𝐹)
3		vex 3402	. . . . . . . . 9 ⊢ 𝑥 ∈ V
4	3, 1	opeldm 5761	. . . . . . . 8 ⊢ (⟨𝑥, 𝑦⟩ ∈ 𝐹 → 𝑥 ∈ dom 𝐹)
5		tz7.48.1	. . . . . . . . 9 ⊢ 𝐹 Fn On
6	5	fndmi 6460	. . . . . . . 8 ⊢ dom 𝐹 = On
7	4, 6	eleqtrdi 2841	. . . . . . 7 ⊢ (⟨𝑥, 𝑦⟩ ∈ 𝐹 → 𝑥 ∈ On)
8	7	ancri 553	. . . . . 6 ⊢ (⟨𝑥, 𝑦⟩ ∈ 𝐹 → (𝑥 ∈ On ∧ ⟨𝑥, 𝑦⟩ ∈ 𝐹))
9		fnopfvb 6744	. . . . . . . 8 ⊢ ((𝐹 Fn On ∧ 𝑥 ∈ On) → ((𝐹‘𝑥) = 𝑦 ↔ ⟨𝑥, 𝑦⟩ ∈ 𝐹))
10	5, 9	mpan 690	. . . . . . 7 ⊢ (𝑥 ∈ On → ((𝐹‘𝑥) = 𝑦 ↔ ⟨𝑥, 𝑦⟩ ∈ 𝐹))
11	10	pm5.32i 578	. . . . . 6 ⊢ ((𝑥 ∈ On ∧ (𝐹‘𝑥) = 𝑦) ↔ (𝑥 ∈ On ∧ ⟨𝑥, 𝑦⟩ ∈ 𝐹))
12	8, 11	sylibr 237	. . . . 5 ⊢ (⟨𝑥, 𝑦⟩ ∈ 𝐹 → (𝑥 ∈ On ∧ (𝐹‘𝑥) = 𝑦))
13	12	eximi 1842	. . . 4 ⊢ (∃𝑥⟨𝑥, 𝑦⟩ ∈ 𝐹 → ∃𝑥(𝑥 ∈ On ∧ (𝐹‘𝑥) = 𝑦))
14	2, 13	sylbi 220	. . 3 ⊢ (𝑦 ∈ ran 𝐹 → ∃𝑥(𝑥 ∈ On ∧ (𝐹‘𝑥) = 𝑦))
15		nfra1 3130	. . . 4 ⊢ Ⅎ𝑥∀𝑥 ∈ On (𝐹‘𝑥) ∈ (𝐴 ∖ (𝐹 “ 𝑥))
16		nfv 1922	. . . 4 ⊢ Ⅎ𝑥 𝑦 ∈ 𝐴
17		rsp 3117	. . . . 5 ⊢ (∀𝑥 ∈ On (𝐹‘𝑥) ∈ (𝐴 ∖ (𝐹 “ 𝑥)) → (𝑥 ∈ On → (𝐹‘𝑥) ∈ (𝐴 ∖ (𝐹 “ 𝑥))))
18		eldifi 4027	. . . . . . . 8 ⊢ ((𝐹‘𝑥) ∈ (𝐴 ∖ (𝐹 “ 𝑥)) → (𝐹‘𝑥) ∈ 𝐴)
19		eleq1 2818	. . . . . . . 8 ⊢ ((𝐹‘𝑥) = 𝑦 → ((𝐹‘𝑥) ∈ 𝐴 ↔ 𝑦 ∈ 𝐴))
20	18, 19	syl5ibcom 248	. . . . . . 7 ⊢ ((𝐹‘𝑥) ∈ (𝐴 ∖ (𝐹 “ 𝑥)) → ((𝐹‘𝑥) = 𝑦 → 𝑦 ∈ 𝐴))
21	20	imim2i 16	. . . . . 6 ⊢ ((𝑥 ∈ On → (𝐹‘𝑥) ∈ (𝐴 ∖ (𝐹 “ 𝑥))) → (𝑥 ∈ On → ((𝐹‘𝑥) = 𝑦 → 𝑦 ∈ 𝐴)))
22	21	impd 414	. . . . 5 ⊢ ((𝑥 ∈ On → (𝐹‘𝑥) ∈ (𝐴 ∖ (𝐹 “ 𝑥))) → ((𝑥 ∈ On ∧ (𝐹‘𝑥) = 𝑦) → 𝑦 ∈ 𝐴))
23	17, 22	syl 17	. . . 4 ⊢ (∀𝑥 ∈ On (𝐹‘𝑥) ∈ (𝐴 ∖ (𝐹 “ 𝑥)) → ((𝑥 ∈ On ∧ (𝐹‘𝑥) = 𝑦) → 𝑦 ∈ 𝐴))
24	15, 16, 23	exlimd 2218	. . 3 ⊢ (∀𝑥 ∈ On (𝐹‘𝑥) ∈ (𝐴 ∖ (𝐹 “ 𝑥)) → (∃𝑥(𝑥 ∈ On ∧ (𝐹‘𝑥) = 𝑦) → 𝑦 ∈ 𝐴))
25	14, 24	syl5 34	. 2 ⊢ (∀𝑥 ∈ On (𝐹‘𝑥) ∈ (𝐴 ∖ (𝐹 “ 𝑥)) → (𝑦 ∈ ran 𝐹 → 𝑦 ∈ 𝐴))
26	25	ssrdv 3893	1 ⊢ (∀𝑥 ∈ On (𝐹‘𝑥) ∈ (𝐴 ∖ (𝐹 “ 𝑥)) → ran 𝐹 ⊆ 𝐴)

Syntax hints:   → wi 4   ↔ wb 209   ∧ wa 399   = wceq 1543  ∃wex 1787   ∈ wcel 2112  ∀wral 3051   ∖ cdif 3850   ⊆ wss 3853  ⟨cop 4533  dom cdm 5536  ran crn 5537   “ cima 5539  Oncon0 6191   Fn wfn 6353  ‘cfv 6358

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1803  ax-4 1817  ax-5 1918  ax-6 1976  ax-7 2018  ax-8 2114  ax-9 2122  ax-10 2143  ax-11 2160  ax-12 2177  ax-ext 2708  ax-sep 5177  ax-nul 5184  ax-pr 5307

This theorem depends on definitions:  df-bi 210  df-an 400  df-or 848  df-3an 1091  df-tru 1546  df-fal 1556  df-ex 1788  df-nf 1792  df-sb 2073  df-mo 2539  df-eu 2568  df-clab 2715  df-cleq 2728  df-clel 2809  df-nfc 2879  df-ral 3056  df-rex 3057  df-rab 3060  df-v 3400  df-sbc 3684  df-dif 3856  df-un 3858  df-in 3860  df-ss 3870  df-nul 4224  df-if 4426  df-sn 4528  df-pr 4530  df-op 4534  df-uni 4806  df-br 5040  df-opab 5102  df-id 5440  df-xp 5542  df-rel 5543  df-cnv 5544  df-co 5545  df-dm 5546  df-rn 5547  df-iota 6316  df-fun 6360  df-fn 6361  df-fv 6366

This theorem is referenced by:  tz7.48-3  8158