MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  ssimaexg Structured version   Visualization version   GIF version

Theorem ssimaexg 6963
Description: The existence of a subimage. (Contributed by FL, 15-Apr-2007.)
Assertion
Ref Expression
ssimaexg ((𝐴 ∈ 𝐶 ∧ Fun 𝐹 ∧ 𝐵 ⊆ (𝐹 “ 𝐴)) → ∃𝑥(𝑥 ⊆ 𝐴 ∧ 𝐵 = (𝐹 “ 𝑥)))
Distinct variable groups:   𝑥,𝐴   𝑥,𝐵   𝑥,𝐹
Allowed substitution hint:   𝐶(𝑥)

Proof of Theorem ssimaexg
Dummy variable 𝑦 is distinct from all other variables.
StepHypRef Expression
1 imaeq2 6050 . . . . . 6 (𝑦 = 𝐴 → (𝐹 “ 𝑦) = (𝐹 “ 𝐴))
21sseq2d 3963 . . . . 5 (𝑦 = 𝐴 → (𝐵 ⊆ (𝐹 “ 𝑦) ↔ 𝐵 ⊆ (𝐹 “ 𝐴)))
32anbi2d 642 . . . 4 (𝑦 = 𝐴 → ((Fun 𝐹 ∧ 𝐵 ⊆ (𝐹 “ 𝑦)) ↔ (Fun 𝐹 ∧ 𝐵 ⊆ (𝐹 “ 𝐴))))
4 sseq2 3957 . . . . . 6 (𝑦 = 𝐴 → (𝑥 ⊆ 𝑦 ↔ 𝑥 ⊆ 𝐴))
54anbi1d 643 . . . . 5 (𝑦 = 𝐴 → ((𝑥 ⊆ 𝑦 ∧ 𝐵 = (𝐹 “ 𝑥)) ↔ (𝑥 ⊆ 𝐴 ∧ 𝐵 = (𝐹 “ 𝑥))))
65exbidv 1954 . . . 4 (𝑦 = 𝐴 → (∃𝑥(𝑥 ⊆ 𝑦 ∧ 𝐵 = (𝐹 “ 𝑥)) ↔ ∃𝑥(𝑥 ⊆ 𝐴 ∧ 𝐵 = (𝐹 “ 𝑥))))
73, 6imbi12d 347 . . 3 (𝑦 = 𝐴 → (((Fun 𝐹 ∧ 𝐵 ⊆ (𝐹 “ 𝑦)) → ∃𝑥(𝑥 ⊆ 𝑦 ∧ 𝐵 = (𝐹 “ 𝑥))) ↔ ((Fun 𝐹 ∧ 𝐵 ⊆ (𝐹 “ 𝐴)) → ∃𝑥(𝑥 ⊆ 𝐴 ∧ 𝐵 = (𝐹 “ 𝑥)))))
8 vex 3455 . . . 4 𝑦 ∈ V
98ssimaex 6962 . . 3 ((Fun 𝐹 ∧ 𝐵 ⊆ (𝐹 “ 𝑦)) → ∃𝑥(𝑥 ⊆ 𝑦 ∧ 𝐵 = (𝐹 “ 𝑥)))
107, 9vtoclg 3518 . 2 (𝐴 ∈ 𝐶 → ((Fun 𝐹 ∧ 𝐵 ⊆ (𝐹 “ 𝐴)) → ∃𝑥(𝑥 ⊆ 𝐴 ∧ 𝐵 = (𝐹 “ 𝑥))))
11103impib 1134 1 ((𝐴 ∈ 𝐶 ∧ Fun 𝐹 ∧ 𝐵 ⊆ (𝐹 “ 𝐴)) → ∃𝑥(𝑥 ⊆ 𝐴 ∧ 𝐵 = (𝐹 “ 𝑥)))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∧ w3a 1103   = wceq 1570  ∃wex 1812   ∈ wcel 2145   ⊆ wss 3899   “ cima 5654  Fun wfun 6525
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 2213  ax-ext 2733  ax-sep 5249  ax-nul 5260  ax-pr 5391
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 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-ne 2957  df-ral 3078  df-rex 3088  df-rab 3414  df-v 3453  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-br 5104  df-opab 5168  df-id 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-iota 6487  df-fun 6533  df-fn 6534  df-fv 6539
This theorem is used by:  tgrest  23457  cmpfi  23706  zarclsint  34486
  Copyright terms: Public domain W3C validator