Users' Mathboxes Mathbox for Peter Mazsa < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  eldisjlem19 Structured version   Visualization version   GIF version

Theorem eldisjlem19 40036
Description: Special case of disjlem19 40027 (together with membpartlem19 40037, this is former prtlem19 40126). (Contributed by Peter Mazsa, 21-Oct-2021.)
Assertion
Ref Expression
eldisjlem19 (𝐵 ∈ 𝑉 → ( ElDisj 𝐴 → ((𝑢 ∈ dom (◡ E ↾ 𝐴) ∧ 𝐵 ∈ 𝑢) → 𝑢 = [𝐵] ∼ 𝐴)))
Distinct variable groups:   𝑢,𝐴   𝑢,𝐵   𝑢,𝑉

Proof of Theorem eldisjlem19
StepHypRef Expression
1 df-eldisj 39915 . . . . . . . 8 ( ElDisj 𝐴 ↔ Disj (◡ E ↾ 𝐴))
2 disjlem19 40027 . . . . . . . 8 (𝐵 ∈ 𝑉 → ( Disj (◡ E ↾ 𝐴) → ((𝑢 ∈ dom (◡ E ↾ 𝐴) ∧ 𝐵 ∈ [𝑢](◡ E ↾ 𝐴)) → [𝑢](◡ E ↾ 𝐴) = [𝐵] ≀ (◡ E ↾ 𝐴))))
31, 2biimtrid 245 . . . . . . 7 (𝐵 ∈ 𝑉 → ( ElDisj 𝐴 → ((𝑢 ∈ dom (◡ E ↾ 𝐴) ∧ 𝐵 ∈ [𝑢](◡ E ↾ 𝐴)) → [𝑢](◡ E ↾ 𝐴) = [𝐵] ≀ (◡ E ↾ 𝐴))))
43imp 412 . . . . . 6 ((𝐵 ∈ 𝑉 ∧ ElDisj 𝐴) → ((𝑢 ∈ dom (◡ E ↾ 𝐴) ∧ 𝐵 ∈ [𝑢](◡ E ↾ 𝐴)) → [𝑢](◡ E ↾ 𝐴) = [𝐵] ≀ (◡ E ↾ 𝐴)))
54expdimp 458 . . . . 5 (((𝐵 ∈ 𝑉 ∧ ElDisj 𝐴) ∧ 𝑢 ∈ dom (◡ E ↾ 𝐴)) → (𝐵 ∈ [𝑢](◡ E ↾ 𝐴) → [𝑢](◡ E ↾ 𝐴) = [𝐵] ≀ (◡ E ↾ 𝐴)))
6 eccnvepres3 39415 . . . . . . . 8 (𝑢 ∈ dom (◡ E ↾ 𝐴) → [𝑢](◡ E ↾ 𝐴) = 𝑢)
76eleq2d 2850 . . . . . . 7 (𝑢 ∈ dom (◡ E ↾ 𝐴) → (𝐵 ∈ [𝑢](◡ E ↾ 𝐴) ↔ 𝐵 ∈ 𝑢))
86eqeq1d 2765 . . . . . . 7 (𝑢 ∈ dom (◡ E ↾ 𝐴) → ([𝑢](◡ E ↾ 𝐴) = [𝐵] ≀ (◡ E ↾ 𝐴) ↔ 𝑢 = [𝐵] ≀ (◡ E ↾ 𝐴)))
97, 8imbi12d 347 . . . . . 6 (𝑢 ∈ dom (◡ E ↾ 𝐴) → ((𝐵 ∈ [𝑢](◡ E ↾ 𝐴) → [𝑢](◡ E ↾ 𝐴) = [𝐵] ≀ (◡ E ↾ 𝐴)) ↔ (𝐵 ∈ 𝑢 → 𝑢 = [𝐵] ≀ (◡ E ↾ 𝐴))))
109adantl 487 . . . . 5 (((𝐵 ∈ 𝑉 ∧ ElDisj 𝐴) ∧ 𝑢 ∈ dom (◡ E ↾ 𝐴)) → ((𝐵 ∈ [𝑢](◡ E ↾ 𝐴) → [𝑢](◡ E ↾ 𝐴) = [𝐵] ≀ (◡ E ↾ 𝐴)) ↔ (𝐵 ∈ 𝑢 → 𝑢 = [𝐵] ≀ (◡ E ↾ 𝐴))))
115, 10mpbid 235 . . . 4 (((𝐵 ∈ 𝑉 ∧ ElDisj 𝐴) ∧ 𝑢 ∈ dom (◡ E ↾ 𝐴)) → (𝐵 ∈ 𝑢 → 𝑢 = [𝐵] ≀ (◡ E ↾ 𝐴)))
12 df-coels 39625 . . . . . 6 ∼ 𝐴 = ≀ (◡ E ↾ 𝐴)
1312eceq2i 8785 . . . . 5 [𝐵] ∼ 𝐴 = [𝐵] ≀ (◡ E ↾ 𝐴)
1413eqeq2i 2776 . . . 4 (𝑢 = [𝐵] ∼ 𝐴 ↔ 𝑢 = [𝐵] ≀ (◡ E ↾ 𝐴))
1511, 14imbitrrdi 255 . . 3 (((𝐵 ∈ 𝑉 ∧ ElDisj 𝐴) ∧ 𝑢 ∈ dom (◡ E ↾ 𝐴)) → (𝐵 ∈ 𝑢 → 𝑢 = [𝐵] ∼ 𝐴))
1615expimpd 459 . 2 ((𝐵 ∈ 𝑉 ∧ ElDisj 𝐴) → ((𝑢 ∈ dom (◡ E ↾ 𝐴) ∧ 𝐵 ∈ 𝑢) → 𝑢 = [𝐵] ∼ 𝐴))
1716ex 418 1 (𝐵 ∈ 𝑉 → ( ElDisj 𝐴 → ((𝑢 ∈ dom (◡ E ↾ 𝐴) ∧ 𝐵 ∈ 𝑢) → 𝑢 = [𝐵] ∼ 𝐴)))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2147   E cep 5554  ◡ccnv 5654  dom cdm 5655   ↾ cres 5657  [cec 8740   ≀ ccoss 39306   ∼ ccoels 39307   Disj wdisjALTV 39342   ElDisj weldisj 39344
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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5252  ax-pr 5395
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 2102  df-mo 2567  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-rmo 3369  df-rab 3417  df-v 3456  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4839  df-br 5107  df-opab 5171  df-id 5550  df-eprel 5555  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-ec 8744  df-coss 39624  df-coels 39625  df-cnvrefrel 39730  df-disjALTV 39913  df-eldisj 39915
This theorem is used by:  membpartlem19  40037
  Copyright terms: Public domain W3C validator