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

Theorem fparlem3 8123
Description: Lemma for fpar 8125. (Contributed by NM, 22-Dec-2008.) (Revised by Mario Carneiro, 28-Apr-2015.)
Assertion
Ref Expression
fparlem3 (𝐹 Fn 𝐴 → (◡(1st ↾ (V × V)) ∘ (𝐹 ∘ (1st ↾ (V × V)))) = ∪ 𝑥 ∈ 𝐴 (({𝑥} × V) × ({(𝐹‘𝑥)} × V)))
Distinct variable groups:   𝑥,𝐴   𝑥,𝐹

Proof of Theorem fparlem3
Dummy variable 𝑦 is distinct from all other variables.
StepHypRef Expression
1 coiun 6257 . 2 (◡(1st ↾ (V × V)) ∘ ∪ 𝑥 ∈ 𝐴 ((◡(1st ↾ (V × V)) “ {𝑥}) × (𝐹 “ {𝑥}))) = ∪ 𝑥 ∈ 𝐴 (◡(1st ↾ (V × V)) ∘ ((◡(1st ↾ (V × V)) “ {𝑥}) × (𝐹 “ {𝑥})))
2 inss1 4182 . . . . 5 (dom 𝐹 ∩ ran (1st ↾ (V × V))) ⊆ dom 𝐹
3 fndm 6640 . . . . 5 (𝐹 Fn 𝐴 → dom 𝐹 = 𝐴)
42, 3sseqtrid 3973 . . . 4 (𝐹 Fn 𝐴 → (dom 𝐹 ∩ ran (1st ↾ (V × V))) ⊆ 𝐴)
5 dfco2a 6246 . . . 4 ((dom 𝐹 ∩ ran (1st ↾ (V × V))) ⊆ 𝐴 → (𝐹 ∘ (1st ↾ (V × V))) = ∪ 𝑥 ∈ 𝐴 ((◡(1st ↾ (V × V)) “ {𝑥}) × (𝐹 “ {𝑥})))
64, 5syl 18 . . 3 (𝐹 Fn 𝐴 → (𝐹 ∘ (1st ↾ (V × V))) = ∪ 𝑥 ∈ 𝐴 ((◡(1st ↾ (V × V)) “ {𝑥}) × (𝐹 “ {𝑥})))
76coeq2d 5840 . 2 (𝐹 Fn 𝐴 → (◡(1st ↾ (V × V)) ∘ (𝐹 ∘ (1st ↾ (V × V)))) = (◡(1st ↾ (V × V)) ∘ ∪ 𝑥 ∈ 𝐴 ((◡(1st ↾ (V × V)) “ {𝑥}) × (𝐹 “ {𝑥}))))
8 inss1 4182 . . . . . . . . 9 (dom ({(𝐹‘𝑥)} × ({𝑥} × V)) ∩ ran (1st ↾ (V × V))) ⊆ dom ({(𝐹‘𝑥)} × ({𝑥} × V))
9 dmxpss 6163 . . . . . . . . 9 dom ({(𝐹‘𝑥)} × ({𝑥} × V)) ⊆ {(𝐹‘𝑥)}
108, 9sstri 3940 . . . . . . . 8 (dom ({(𝐹‘𝑥)} × ({𝑥} × V)) ∩ ran (1st ↾ (V × V))) ⊆ {(𝐹‘𝑥)}
11 dfco2a 6246 . . . . . . . 8 ((dom ({(𝐹‘𝑥)} × ({𝑥} × V)) ∩ ran (1st ↾ (V × V))) ⊆ {(𝐹‘𝑥)} → (({(𝐹‘𝑥)} × ({𝑥} × V)) ∘ (1st ↾ (V × V))) = ∪ 𝑦 ∈ {(𝐹‘𝑥)} ((◡(1st ↾ (V × V)) “ {𝑦}) × (({(𝐹‘𝑥)} × ({𝑥} × V)) “ {𝑦})))
1210, 11ax-mp 5 . . . . . . 7 (({(𝐹‘𝑥)} × ({𝑥} × V)) ∘ (1st ↾ (V × V))) = ∪ 𝑦 ∈ {(𝐹‘𝑥)} ((◡(1st ↾ (V × V)) “ {𝑦}) × (({(𝐹‘𝑥)} × ({𝑥} × V)) “ {𝑦}))
13 fvex 6896 . . . . . . . 8 (𝐹‘𝑥) ∈ V
14 fparlem1 8121 . . . . . . . . . 10 (◡(1st ↾ (V × V)) “ {𝑦}) = ({𝑦} × V)
15 sneq 4594 . . . . . . . . . . 11 (𝑦 = (𝐹‘𝑥) → {𝑦} = {(𝐹‘𝑥)})
1615xpeq1d 5680 . . . . . . . . . 10 (𝑦 = (𝐹‘𝑥) → ({𝑦} × V) = ({(𝐹‘𝑥)} × V))
1714, 16eqtrid 2808 . . . . . . . . 9 (𝑦 = (𝐹‘𝑥) → (◡(1st ↾ (V × V)) “ {𝑦}) = ({(𝐹‘𝑥)} × V))
1815imaeq2d 6052 . . . . . . . . . 10 (𝑦 = (𝐹‘𝑥) → (({(𝐹‘𝑥)} × ({𝑥} × V)) “ {𝑦}) = (({(𝐹‘𝑥)} × ({𝑥} × V)) “ {(𝐹‘𝑥)}))
19 df-ima 5664 . . . . . . . . . . 11 (({(𝐹‘𝑥)} × ({𝑥} × V)) “ {(𝐹‘𝑥)}) = ran (({(𝐹‘𝑥)} × ({𝑥} × V)) ↾ {(𝐹‘𝑥)})
20 ssid 3953 . . . . . . . . . . . . . 14 {(𝐹‘𝑥)} ⊆ {(𝐹‘𝑥)}
21 xpssres 6007 . . . . . . . . . . . . . 14 ({(𝐹‘𝑥)} ⊆ {(𝐹‘𝑥)} → (({(𝐹‘𝑥)} × ({𝑥} × V)) ↾ {(𝐹‘𝑥)}) = ({(𝐹‘𝑥)} × ({𝑥} × V)))
2220, 21ax-mp 5 . . . . . . . . . . . . 13 (({(𝐹‘𝑥)} × ({𝑥} × V)) ↾ {(𝐹‘𝑥)}) = ({(𝐹‘𝑥)} × ({𝑥} × V))
2322rneqi 5919 . . . . . . . . . . . 12 ran (({(𝐹‘𝑥)} × ({𝑥} × V)) ↾ {(𝐹‘𝑥)}) = ran ({(𝐹‘𝑥)} × ({𝑥} × V))
2413snnz 4737 . . . . . . . . . . . . 13 {(𝐹‘𝑥)} ≠ ∅
25 rnxp 6162 . . . . . . . . . . . . 13 ({(𝐹‘𝑥)} ≠ ∅ → ran ({(𝐹‘𝑥)} × ({𝑥} × V)) = ({𝑥} × V))
2624, 25ax-mp 5 . . . . . . . . . . . 12 ran ({(𝐹‘𝑥)} × ({𝑥} × V)) = ({𝑥} × V)
2723, 26eqtri 2784 . . . . . . . . . . 11 ran (({(𝐹‘𝑥)} × ({𝑥} × V)) ↾ {(𝐹‘𝑥)}) = ({𝑥} × V)
2819, 27eqtri 2784 . . . . . . . . . 10 (({(𝐹‘𝑥)} × ({𝑥} × V)) “ {(𝐹‘𝑥)}) = ({𝑥} × V)
2918, 28eqtrdi 2812 . . . . . . . . 9 (𝑦 = (𝐹‘𝑥) → (({(𝐹‘𝑥)} × ({𝑥} × V)) “ {𝑦}) = ({𝑥} × V))
3017, 29xpeq12d 5682 . . . . . . . 8 (𝑦 = (𝐹‘𝑥) → ((◡(1st ↾ (V × V)) “ {𝑦}) × (({(𝐹‘𝑥)} × ({𝑥} × V)) “ {𝑦})) = (({(𝐹‘𝑥)} × V) × ({𝑥} × V)))
3113, 30iunxsn 5051 . . . . . . 7 ∪ 𝑦 ∈ {(𝐹‘𝑥)} ((◡(1st ↾ (V × V)) “ {𝑦}) × (({(𝐹‘𝑥)} × ({𝑥} × V)) “ {𝑦})) = (({(𝐹‘𝑥)} × V) × ({𝑥} × V))
3212, 31eqtri 2784 . . . . . 6 (({(𝐹‘𝑥)} × ({𝑥} × V)) ∘ (1st ↾ (V × V))) = (({(𝐹‘𝑥)} × V) × ({𝑥} × V))
3332cnveqi 5852 . . . . 5 ◡(({(𝐹‘𝑥)} × ({𝑥} × V)) ∘ (1st ↾ (V × V))) = ◡(({(𝐹‘𝑥)} × V) × ({𝑥} × V))
34 cnvco 5867 . . . . 5 ◡(({(𝐹‘𝑥)} × ({𝑥} × V)) ∘ (1st ↾ (V × V))) = (◡(1st ↾ (V × V)) ∘ ◡({(𝐹‘𝑥)} × ({𝑥} × V)))
35 cnvxp 6147 . . . . 5 ◡(({(𝐹‘𝑥)} × V) × ({𝑥} × V)) = (({𝑥} × V) × ({(𝐹‘𝑥)} × V))
3633, 34, 353eqtr3i 2792 . . . 4 (◡(1st ↾ (V × V)) ∘ ◡({(𝐹‘𝑥)} × ({𝑥} × V))) = (({𝑥} × V) × ({(𝐹‘𝑥)} × V))
37 fparlem1 8121 . . . . . . . . 9 (◡(1st ↾ (V × V)) “ {𝑥}) = ({𝑥} × V)
3837xpeq2i 5678 . . . . . . . 8 ({(𝐹‘𝑥)} × (◡(1st ↾ (V × V)) “ {𝑥})) = ({(𝐹‘𝑥)} × ({𝑥} × V))
39 fnsnfv 6962 . . . . . . . . 9 ((𝐹 Fn 𝐴 ∧ 𝑥 ∈ 𝐴) → {(𝐹‘𝑥)} = (𝐹 “ {𝑥}))
4039xpeq1d 5680 . . . . . . . 8 ((𝐹 Fn 𝐴 ∧ 𝑥 ∈ 𝐴) → ({(𝐹‘𝑥)} × (◡(1st ↾ (V × V)) “ {𝑥})) = ((𝐹 “ {𝑥}) × (◡(1st ↾ (V × V)) “ {𝑥})))
4138, 40eqtr3id 2810 . . . . . . 7 ((𝐹 Fn 𝐴 ∧ 𝑥 ∈ 𝐴) → ({(𝐹‘𝑥)} × ({𝑥} × V)) = ((𝐹 “ {𝑥}) × (◡(1st ↾ (V × V)) “ {𝑥})))
4241cnveqd 5853 . . . . . 6 ((𝐹 Fn 𝐴 ∧ 𝑥 ∈ 𝐴) → ◡({(𝐹‘𝑥)} × ({𝑥} × V)) = ◡((𝐹 “ {𝑥}) × (◡(1st ↾ (V × V)) “ {𝑥})))
43 cnvxp 6147 . . . . . 6 ◡((𝐹 “ {𝑥}) × (◡(1st ↾ (V × V)) “ {𝑥})) = ((◡(1st ↾ (V × V)) “ {𝑥}) × (𝐹 “ {𝑥}))
4442, 43eqtrdi 2812 . . . . 5 ((𝐹 Fn 𝐴 ∧ 𝑥 ∈ 𝐴) → ◡({(𝐹‘𝑥)} × ({𝑥} × V)) = ((◡(1st ↾ (V × V)) “ {𝑥}) × (𝐹 “ {𝑥})))
4544coeq2d 5840 . . . 4 ((𝐹 Fn 𝐴 ∧ 𝑥 ∈ 𝐴) → (◡(1st ↾ (V × V)) ∘ ◡({(𝐹‘𝑥)} × ({𝑥} × V))) = (◡(1st ↾ (V × V)) ∘ ((◡(1st ↾ (V × V)) “ {𝑥}) × (𝐹 “ {𝑥}))))
4636, 45eqtr3id 2810 . . 3 ((𝐹 Fn 𝐴 ∧ 𝑥 ∈ 𝐴) → (({𝑥} × V) × ({(𝐹‘𝑥)} × V)) = (◡(1st ↾ (V × V)) ∘ ((◡(1st ↾ (V × V)) “ {𝑥}) × (𝐹 “ {𝑥}))))
4746iuneq2dv 4976 . 2 (𝐹 Fn 𝐴 → ∪ 𝑥 ∈ 𝐴 (({𝑥} × V) × ({(𝐹‘𝑥)} × V)) = ∪ 𝑥 ∈ 𝐴 (◡(1st ↾ (V × V)) ∘ ((◡(1st ↾ (V × V)) “ {𝑥}) × (𝐹 “ {𝑥}))))
481, 7, 473eqtr4a 2822 1 (𝐹 Fn 𝐴 → (◡(1st ↾ (V × V)) ∘ (𝐹 ∘ (1st ↾ (V × V)))) = ∪ 𝑥 ∈ 𝐴 (({𝑥} × V) × ({(𝐹‘𝑥)} × V)))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2145   ≠ wne 2956  Vcvv 3451   ∩ cin 3898   ⊆ wss 3899  ∅c0 4279  {csn 4584  ∪ ciun 4951   × cxp 5649  ◡ccnv 5650  dom cdm 5651  ran crn 5652   ↾ cres 5653   “ cima 5654   ∘ ccom 5655   Fn wfn 6532  ‘cfv 6537  1st c1st 7997
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-11 2194  ax-12 2213  ax-ext 2733  ax-sep 5249  ax-nul 5260  ax-pr 5391  ax-un 7749
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-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-rab 3414  df-v 3453  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  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 6493  df-fun 6539  df-fn 6540  df-f 6541  df-fv 6545  df-1st 7999  df-2nd 8000
This theorem is used by:  fpar  8125
  Copyright terms: Public domain W3C validator