Users' Mathboxes Mathbox for Thierry Arnoux < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  disjpreima Structured version   Visualization version   GIF version

Theorem disjpreima 31502
Description: A preimage of a disjoint set is disjoint. (Contributed by Thierry Arnoux, 7-Feb-2017.)
Assertion
Ref Expression
disjpreima ((Fun 𝐹Disj 𝑥𝐴 𝐵) → Disj 𝑥𝐴 (𝐹𝐵))
Distinct variable groups:   𝑥,𝐴   𝑥,𝐹
Allowed substitution hint:   𝐵(𝑥)

Proof of Theorem disjpreima
Dummy variables 𝑦 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 inpreima 7014 . . . . . . . . 9 (Fun 𝐹 → (𝐹 “ (𝑦 / 𝑥𝐵𝑧 / 𝑥𝐵)) = ((𝐹𝑦 / 𝑥𝐵) ∩ (𝐹𝑧 / 𝑥𝐵)))
2 imaeq2 6009 . . . . . . . . . 10 ((𝑦 / 𝑥𝐵𝑧 / 𝑥𝐵) = ∅ → (𝐹 “ (𝑦 / 𝑥𝐵𝑧 / 𝑥𝐵)) = (𝐹 “ ∅))
3 ima0 6029 . . . . . . . . . 10 (𝐹 “ ∅) = ∅
42, 3eqtrdi 2792 . . . . . . . . 9 ((𝑦 / 𝑥𝐵𝑧 / 𝑥𝐵) = ∅ → (𝐹 “ (𝑦 / 𝑥𝐵𝑧 / 𝑥𝐵)) = ∅)
51, 4sylan9req 2797 . . . . . . . 8 ((Fun 𝐹 ∧ (𝑦 / 𝑥𝐵𝑧 / 𝑥𝐵) = ∅) → ((𝐹𝑦 / 𝑥𝐵) ∩ (𝐹𝑧 / 𝑥𝐵)) = ∅)
65ex 413 . . . . . . 7 (Fun 𝐹 → ((𝑦 / 𝑥𝐵𝑧 / 𝑥𝐵) = ∅ → ((𝐹𝑦 / 𝑥𝐵) ∩ (𝐹𝑧 / 𝑥𝐵)) = ∅))
7 csbima12 6031 . . . . . . . . . 10 𝑦 / 𝑥(𝐹𝐵) = (𝑦 / 𝑥𝐹𝑦 / 𝑥𝐵)
8 csbconstg 3874 . . . . . . . . . . . 12 (𝑦 ∈ V → 𝑦 / 𝑥𝐹 = 𝐹)
98elv 3451 . . . . . . . . . . 11 𝑦 / 𝑥𝐹 = 𝐹
109imaeq1i 6010 . . . . . . . . . 10 (𝑦 / 𝑥𝐹𝑦 / 𝑥𝐵) = (𝐹𝑦 / 𝑥𝐵)
117, 10eqtri 2764 . . . . . . . . 9 𝑦 / 𝑥(𝐹𝐵) = (𝐹𝑦 / 𝑥𝐵)
12 csbima12 6031 . . . . . . . . . 10 𝑧 / 𝑥(𝐹𝐵) = (𝑧 / 𝑥𝐹𝑧 / 𝑥𝐵)
13 csbconstg 3874 . . . . . . . . . . . 12 (𝑧 ∈ V → 𝑧 / 𝑥𝐹 = 𝐹)
1413elv 3451 . . . . . . . . . . 11 𝑧 / 𝑥𝐹 = 𝐹
1514imaeq1i 6010 . . . . . . . . . 10 (𝑧 / 𝑥𝐹𝑧 / 𝑥𝐵) = (𝐹𝑧 / 𝑥𝐵)
1612, 15eqtri 2764 . . . . . . . . 9 𝑧 / 𝑥(𝐹𝐵) = (𝐹𝑧 / 𝑥𝐵)
1711, 16ineq12i 4170 . . . . . . . 8 (𝑦 / 𝑥(𝐹𝐵) ∩ 𝑧 / 𝑥(𝐹𝐵)) = ((𝐹𝑦 / 𝑥𝐵) ∩ (𝐹𝑧 / 𝑥𝐵))
1817eqeq1i 2741 . . . . . . 7 ((𝑦 / 𝑥(𝐹𝐵) ∩ 𝑧 / 𝑥(𝐹𝐵)) = ∅ ↔ ((𝐹𝑦 / 𝑥𝐵) ∩ (𝐹𝑧 / 𝑥𝐵)) = ∅)
196, 18syl6ibr 251 . . . . . 6 (Fun 𝐹 → ((𝑦 / 𝑥𝐵𝑧 / 𝑥𝐵) = ∅ → (𝑦 / 𝑥(𝐹𝐵) ∩ 𝑧 / 𝑥(𝐹𝐵)) = ∅))
2019orim2d 965 . . . . 5 (Fun 𝐹 → ((𝑦 = 𝑧 ∨ (𝑦 / 𝑥𝐵𝑧 / 𝑥𝐵) = ∅) → (𝑦 = 𝑧 ∨ (𝑦 / 𝑥(𝐹𝐵) ∩ 𝑧 / 𝑥(𝐹𝐵)) = ∅)))
2120ralimdv 3166 . . . 4 (Fun 𝐹 → (∀𝑧𝐴 (𝑦 = 𝑧 ∨ (𝑦 / 𝑥𝐵𝑧 / 𝑥𝐵) = ∅) → ∀𝑧𝐴 (𝑦 = 𝑧 ∨ (𝑦 / 𝑥(𝐹𝐵) ∩ 𝑧 / 𝑥(𝐹𝐵)) = ∅)))
2221ralimdv 3166 . . 3 (Fun 𝐹 → (∀𝑦𝐴𝑧𝐴 (𝑦 = 𝑧 ∨ (𝑦 / 𝑥𝐵𝑧 / 𝑥𝐵) = ∅) → ∀𝑦𝐴𝑧𝐴 (𝑦 = 𝑧 ∨ (𝑦 / 𝑥(𝐹𝐵) ∩ 𝑧 / 𝑥(𝐹𝐵)) = ∅)))
23 disjors 5086 . . 3 (Disj 𝑥𝐴 𝐵 ↔ ∀𝑦𝐴𝑧𝐴 (𝑦 = 𝑧 ∨ (𝑦 / 𝑥𝐵𝑧 / 𝑥𝐵) = ∅))
24 disjors 5086 . . 3 (Disj 𝑥𝐴 (𝐹𝐵) ↔ ∀𝑦𝐴𝑧𝐴 (𝑦 = 𝑧 ∨ (𝑦 / 𝑥(𝐹𝐵) ∩ 𝑧 / 𝑥(𝐹𝐵)) = ∅))
2522, 23, 243imtr4g 295 . 2 (Fun 𝐹 → (Disj 𝑥𝐴 𝐵Disj 𝑥𝐴 (𝐹𝐵)))
2625imp 407 1 ((Fun 𝐹Disj 𝑥𝐴 𝐵) → Disj 𝑥𝐴 (𝐹𝐵))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 396  wo 845   = wceq 1541  wral 3064  Vcvv 3445  csb 3855  cin 3909  c0 4282  Disj wdisj 5070  ccnv 5632  cima 5636  Fun wfun 6490
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2707  ax-sep 5256  ax-nul 5263  ax-pr 5384
This theorem depends on definitions:  df-bi 206  df-an 397  df-or 846  df-3an 1089  df-tru 1544  df-fal 1554  df-ex 1782  df-nf 1786  df-sb 2068  df-mo 2538  df-clab 2714  df-cleq 2728  df-clel 2814  df-nfc 2889  df-ral 3065  df-rex 3074  df-rmo 3353  df-rab 3408  df-v 3447  df-sbc 3740  df-csb 3856  df-dif 3913  df-un 3915  df-in 3917  df-ss 3927  df-nul 4283  df-if 4487  df-sn 4587  df-pr 4589  df-op 4593  df-disj 5071  df-br 5106  df-opab 5168  df-id 5531  df-xp 5639  df-rel 5640  df-cnv 5641  df-co 5642  df-dm 5643  df-rn 5644  df-res 5645  df-ima 5646  df-fun 6498
This theorem is referenced by:  fnpreimac  31587  elrspunidl  32203  sibfof  32940  dstrvprob  33071
  Copyright terms: Public domain W3C validator