MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  tz7.48-1 Structured version   Visualization version   GIF version

Theorem tz7.48-1 8451
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.
StepHypRef Expression
1 vex 3461 . . . . 5 𝑦 ∈ V
21elrn2 5869 . . . 4 (𝑦 ∈ ran 𝐹 ↔ ∃𝑥𝑥, 𝑦⟩ ∈ 𝐹)
3 vex 3461 . . . . . . . . 9 𝑥 ∈ V
43, 1opeldm 5884 . . . . . . . 8 (⟨𝑥, 𝑦⟩ ∈ 𝐹𝑥 ∈ dom 𝐹)
5 tz7.48.1 . . . . . . . . 9 𝐹 Fn On
65fndmi 6638 . . . . . . . 8 dom 𝐹 = On
74, 6eleqtrdi 2843 . . . . . . 7 (⟨𝑥, 𝑦⟩ ∈ 𝐹𝑥 ∈ On)
87ancri 549 . . . . . 6 (⟨𝑥, 𝑦⟩ ∈ 𝐹 → (𝑥 ∈ On ∧ ⟨𝑥, 𝑦⟩ ∈ 𝐹))
9 fnopfvb 6926 . . . . . . . 8 ((𝐹 Fn On ∧ 𝑥 ∈ On) → ((𝐹𝑥) = 𝑦 ↔ ⟨𝑥, 𝑦⟩ ∈ 𝐹))
105, 9mpan 690 . . . . . . 7 (𝑥 ∈ On → ((𝐹𝑥) = 𝑦 ↔ ⟨𝑥, 𝑦⟩ ∈ 𝐹))
1110pm5.32i 574 . . . . . 6 ((𝑥 ∈ On ∧ (𝐹𝑥) = 𝑦) ↔ (𝑥 ∈ On ∧ ⟨𝑥, 𝑦⟩ ∈ 𝐹))
128, 11sylibr 234 . . . . 5 (⟨𝑥, 𝑦⟩ ∈ 𝐹 → (𝑥 ∈ On ∧ (𝐹𝑥) = 𝑦))
1312eximi 1834 . . . 4 (∃𝑥𝑥, 𝑦⟩ ∈ 𝐹 → ∃𝑥(𝑥 ∈ On ∧ (𝐹𝑥) = 𝑦))
142, 13sylbi 217 . . 3 (𝑦 ∈ ran 𝐹 → ∃𝑥(𝑥 ∈ On ∧ (𝐹𝑥) = 𝑦))
15 nfra1 3264 . . . 4 𝑥𝑥 ∈ On (𝐹𝑥) ∈ (𝐴 ∖ (𝐹𝑥))
16 nfv 1913 . . . 4 𝑥 𝑦𝐴
17 rsp 3228 . . . . 5 (∀𝑥 ∈ On (𝐹𝑥) ∈ (𝐴 ∖ (𝐹𝑥)) → (𝑥 ∈ On → (𝐹𝑥) ∈ (𝐴 ∖ (𝐹𝑥))))
18 eldifi 4104 . . . . . . . 8 ((𝐹𝑥) ∈ (𝐴 ∖ (𝐹𝑥)) → (𝐹𝑥) ∈ 𝐴)
19 eleq1 2821 . . . . . . . 8 ((𝐹𝑥) = 𝑦 → ((𝐹𝑥) ∈ 𝐴𝑦𝐴))
2018, 19syl5ibcom 245 . . . . . . 7 ((𝐹𝑥) ∈ (𝐴 ∖ (𝐹𝑥)) → ((𝐹𝑥) = 𝑦𝑦𝐴))
2120imim2i 16 . . . . . 6 ((𝑥 ∈ On → (𝐹𝑥) ∈ (𝐴 ∖ (𝐹𝑥))) → (𝑥 ∈ On → ((𝐹𝑥) = 𝑦𝑦𝐴)))
2221impd 410 . . . . 5 ((𝑥 ∈ On → (𝐹𝑥) ∈ (𝐴 ∖ (𝐹𝑥))) → ((𝑥 ∈ On ∧ (𝐹𝑥) = 𝑦) → 𝑦𝐴))
2317, 22syl 17 . . . 4 (∀𝑥 ∈ On (𝐹𝑥) ∈ (𝐴 ∖ (𝐹𝑥)) → ((𝑥 ∈ On ∧ (𝐹𝑥) = 𝑦) → 𝑦𝐴))
2415, 16, 23exlimd 2217 . . 3 (∀𝑥 ∈ On (𝐹𝑥) ∈ (𝐴 ∖ (𝐹𝑥)) → (∃𝑥(𝑥 ∈ On ∧ (𝐹𝑥) = 𝑦) → 𝑦𝐴))
2514, 24syl5 34 . 2 (∀𝑥 ∈ On (𝐹𝑥) ∈ (𝐴 ∖ (𝐹𝑥)) → (𝑦 ∈ ran 𝐹𝑦𝐴))
2625ssrdv 3962 1 (∀𝑥 ∈ On (𝐹𝑥) ∈ (𝐴 ∖ (𝐹𝑥)) → ran 𝐹𝐴)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wa 395   = wceq 1539  wex 1778  wcel 2107  wral 3050  cdif 3921  wss 3924  cop 4605  dom cdm 5651  ran crn 5652  cima 5654  Oncon0 6349   Fn wfn 6522  cfv 6527
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1794  ax-4 1808  ax-5 1909  ax-6 1966  ax-7 2006  ax-8 2109  ax-9 2117  ax-10 2140  ax-12 2176  ax-ext 2706  ax-sep 5263  ax-nul 5273  ax-pr 5399
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1542  df-fal 1552  df-ex 1779  df-nf 1783  df-sb 2064  df-mo 2538  df-eu 2567  df-clab 2713  df-cleq 2726  df-clel 2808  df-ne 2932  df-ral 3051  df-rex 3060  df-rab 3414  df-v 3459  df-dif 3927  df-un 3929  df-ss 3941  df-nul 4307  df-if 4499  df-sn 4600  df-pr 4602  df-op 4606  df-uni 4881  df-br 5117  df-opab 5179  df-id 5545  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-iota 6480  df-fun 6529  df-fn 6530  df-fv 6535
This theorem is referenced by:  tz7.48-3  8452
  Copyright terms: Public domain W3C validator