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

Theorem bropfvvvvlem 7775
Description: Lemma for bropfvvvv 7776. (Contributed by AV, 31-Dec-2020.) (Revised by AV, 16-Jan-2021.)
Hypotheses
Ref Expression
bropfvvvv.o 𝑂 = (𝑎𝑈 ↦ (𝑏𝑉, 𝑐𝑊 ↦ {⟨𝑑, 𝑒⟩ ∣ 𝜑}))
bropfvvvv.oo ((𝐴𝑈𝐵𝑆𝐶𝑇) → (𝐵(𝑂𝐴)𝐶) = {⟨𝑑, 𝑒⟩ ∣ 𝜃})
Assertion
Ref Expression
bropfvvvvlem ((⟨𝐵, 𝐶⟩ ∈ (𝑆 × 𝑇) ∧ 𝐷(𝐵(𝑂𝐴)𝐶)𝐸) → (𝐴𝑈 ∧ (𝐵𝑆𝐶𝑇) ∧ (𝐷 ∈ V ∧ 𝐸 ∈ V)))
Distinct variable group:   𝑈,𝑎
Allowed substitution hints:   𝜑(𝑒,𝑎,𝑏,𝑐,𝑑)   𝜃(𝑒,𝑎,𝑏,𝑐,𝑑)   𝐴(𝑒,𝑎,𝑏,𝑐,𝑑)   𝐵(𝑒,𝑎,𝑏,𝑐,𝑑)   𝐶(𝑒,𝑎,𝑏,𝑐,𝑑)   𝐷(𝑒,𝑎,𝑏,𝑐,𝑑)   𝑆(𝑒,𝑎,𝑏,𝑐,𝑑)   𝑇(𝑒,𝑎,𝑏,𝑐,𝑑)   𝑈(𝑒,𝑏,𝑐,𝑑)   𝐸(𝑒,𝑎,𝑏,𝑐,𝑑)   𝑂(𝑒,𝑎,𝑏,𝑐,𝑑)   𝑉(𝑒,𝑎,𝑏,𝑐,𝑑)   𝑊(𝑒,𝑎,𝑏,𝑐,𝑑)

Proof of Theorem bropfvvvvlem
StepHypRef Expression
1 opelxp 5584 . . 3 (⟨𝐵, 𝐶⟩ ∈ (𝑆 × 𝑇) ↔ (𝐵𝑆𝐶𝑇))
2 brne0 5107 . . . . . . 7 (𝐷(𝐵(𝑂𝐴)𝐶)𝐸 → (𝐵(𝑂𝐴)𝐶) ≠ ∅)
3 bropfvvvv.oo . . . . . . . . . . . . . 14 ((𝐴𝑈𝐵𝑆𝐶𝑇) → (𝐵(𝑂𝐴)𝐶) = {⟨𝑑, 𝑒⟩ ∣ 𝜃})
433expb 1112 . . . . . . . . . . . . 13 ((𝐴𝑈 ∧ (𝐵𝑆𝐶𝑇)) → (𝐵(𝑂𝐴)𝐶) = {⟨𝑑, 𝑒⟩ ∣ 𝜃})
54breqd 5068 . . . . . . . . . . . 12 ((𝐴𝑈 ∧ (𝐵𝑆𝐶𝑇)) → (𝐷(𝐵(𝑂𝐴)𝐶)𝐸𝐷{⟨𝑑, 𝑒⟩ ∣ 𝜃}𝐸))
6 brabv 5444 . . . . . . . . . . . . . . 15 (𝐷{⟨𝑑, 𝑒⟩ ∣ 𝜃}𝐸 → (𝐷 ∈ V ∧ 𝐸 ∈ V))
76anim2i 616 . . . . . . . . . . . . . 14 ((𝐴𝑈𝐷{⟨𝑑, 𝑒⟩ ∣ 𝜃}𝐸) → (𝐴𝑈 ∧ (𝐷 ∈ V ∧ 𝐸 ∈ V)))
87ex 413 . . . . . . . . . . . . 13 (𝐴𝑈 → (𝐷{⟨𝑑, 𝑒⟩ ∣ 𝜃}𝐸 → (𝐴𝑈 ∧ (𝐷 ∈ V ∧ 𝐸 ∈ V))))
98adantr 481 . . . . . . . . . . . 12 ((𝐴𝑈 ∧ (𝐵𝑆𝐶𝑇)) → (𝐷{⟨𝑑, 𝑒⟩ ∣ 𝜃}𝐸 → (𝐴𝑈 ∧ (𝐷 ∈ V ∧ 𝐸 ∈ V))))
105, 9sylbid 241 . . . . . . . . . . 11 ((𝐴𝑈 ∧ (𝐵𝑆𝐶𝑇)) → (𝐷(𝐵(𝑂𝐴)𝐶)𝐸 → (𝐴𝑈 ∧ (𝐷 ∈ V ∧ 𝐸 ∈ V))))
1110ex 413 . . . . . . . . . 10 (𝐴𝑈 → ((𝐵𝑆𝐶𝑇) → (𝐷(𝐵(𝑂𝐴)𝐶)𝐸 → (𝐴𝑈 ∧ (𝐷 ∈ V ∧ 𝐸 ∈ V)))))
1211com23 86 . . . . . . . . 9 (𝐴𝑈 → (𝐷(𝐵(𝑂𝐴)𝐶)𝐸 → ((𝐵𝑆𝐶𝑇) → (𝐴𝑈 ∧ (𝐷 ∈ V ∧ 𝐸 ∈ V)))))
1312a1d 25 . . . . . . . 8 (𝐴𝑈 → ((𝐵(𝑂𝐴)𝐶) ≠ ∅ → (𝐷(𝐵(𝑂𝐴)𝐶)𝐸 → ((𝐵𝑆𝐶𝑇) → (𝐴𝑈 ∧ (𝐷 ∈ V ∧ 𝐸 ∈ V))))))
14 bropfvvvv.o . . . . . . . . . 10 𝑂 = (𝑎𝑈 ↦ (𝑏𝑉, 𝑐𝑊 ↦ {⟨𝑑, 𝑒⟩ ∣ 𝜑}))
1514fvmptndm 6790 . . . . . . . . 9 𝐴𝑈 → (𝑂𝐴) = ∅)
16 df-ov 7148 . . . . . . . . . . 11 (𝐵(𝑂𝐴)𝐶) = ((𝑂𝐴)‘⟨𝐵, 𝐶⟩)
17 fveq1 6662 . . . . . . . . . . 11 ((𝑂𝐴) = ∅ → ((𝑂𝐴)‘⟨𝐵, 𝐶⟩) = (∅‘⟨𝐵, 𝐶⟩))
1816, 17syl5eq 2865 . . . . . . . . . 10 ((𝑂𝐴) = ∅ → (𝐵(𝑂𝐴)𝐶) = (∅‘⟨𝐵, 𝐶⟩))
19 0fv 6702 . . . . . . . . . 10 (∅‘⟨𝐵, 𝐶⟩) = ∅
2018, 19syl6eq 2869 . . . . . . . . 9 ((𝑂𝐴) = ∅ → (𝐵(𝑂𝐴)𝐶) = ∅)
21 eqneqall 3024 . . . . . . . . 9 ((𝐵(𝑂𝐴)𝐶) = ∅ → ((𝐵(𝑂𝐴)𝐶) ≠ ∅ → (𝐷(𝐵(𝑂𝐴)𝐶)𝐸 → ((𝐵𝑆𝐶𝑇) → (𝐴𝑈 ∧ (𝐷 ∈ V ∧ 𝐸 ∈ V))))))
2215, 20, 213syl 18 . . . . . . . 8 𝐴𝑈 → ((𝐵(𝑂𝐴)𝐶) ≠ ∅ → (𝐷(𝐵(𝑂𝐴)𝐶)𝐸 → ((𝐵𝑆𝐶𝑇) → (𝐴𝑈 ∧ (𝐷 ∈ V ∧ 𝐸 ∈ V))))))
2313, 22pm2.61i 183 . . . . . . 7 ((𝐵(𝑂𝐴)𝐶) ≠ ∅ → (𝐷(𝐵(𝑂𝐴)𝐶)𝐸 → ((𝐵𝑆𝐶𝑇) → (𝐴𝑈 ∧ (𝐷 ∈ V ∧ 𝐸 ∈ V)))))
242, 23mpcom 38 . . . . . 6 (𝐷(𝐵(𝑂𝐴)𝐶)𝐸 → ((𝐵𝑆𝐶𝑇) → (𝐴𝑈 ∧ (𝐷 ∈ V ∧ 𝐸 ∈ V))))
2524com12 32 . . . . 5 ((𝐵𝑆𝐶𝑇) → (𝐷(𝐵(𝑂𝐴)𝐶)𝐸 → (𝐴𝑈 ∧ (𝐷 ∈ V ∧ 𝐸 ∈ V))))
2625anc2ri 557 . . . 4 ((𝐵𝑆𝐶𝑇) → (𝐷(𝐵(𝑂𝐴)𝐶)𝐸 → ((𝐴𝑈 ∧ (𝐷 ∈ V ∧ 𝐸 ∈ V)) ∧ (𝐵𝑆𝐶𝑇))))
27 3anan32 1089 . . . 4 ((𝐴𝑈 ∧ (𝐵𝑆𝐶𝑇) ∧ (𝐷 ∈ V ∧ 𝐸 ∈ V)) ↔ ((𝐴𝑈 ∧ (𝐷 ∈ V ∧ 𝐸 ∈ V)) ∧ (𝐵𝑆𝐶𝑇)))
2826, 27syl6ibr 253 . . 3 ((𝐵𝑆𝐶𝑇) → (𝐷(𝐵(𝑂𝐴)𝐶)𝐸 → (𝐴𝑈 ∧ (𝐵𝑆𝐶𝑇) ∧ (𝐷 ∈ V ∧ 𝐸 ∈ V))))
291, 28sylbi 218 . 2 (⟨𝐵, 𝐶⟩ ∈ (𝑆 × 𝑇) → (𝐷(𝐵(𝑂𝐴)𝐶)𝐸 → (𝐴𝑈 ∧ (𝐵𝑆𝐶𝑇) ∧ (𝐷 ∈ V ∧ 𝐸 ∈ V))))
3029imp 407 1 ((⟨𝐵, 𝐶⟩ ∈ (𝑆 × 𝑇) ∧ 𝐷(𝐵(𝑂𝐴)𝐶)𝐸) → (𝐴𝑈 ∧ (𝐵𝑆𝐶𝑇) ∧ (𝐷 ∈ V ∧ 𝐸 ∈ V)))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wa 396  w3a 1079   = wceq 1528  wcel 2105  wne 3013  Vcvv 3492  c0 4288  cop 4563   class class class wbr 5057  {copab 5119  cmpt 5137   × cxp 5546  cfv 6348  (class class class)co 7145  cmpo 7147
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1787  ax-4 1801  ax-5 1902  ax-6 1961  ax-7 2006  ax-8 2107  ax-9 2115  ax-10 2136  ax-11 2151  ax-12 2167  ax-ext 2790  ax-sep 5194  ax-nul 5201  ax-pow 5257  ax-pr 5320
This theorem depends on definitions:  df-bi 208  df-an 397  df-or 842  df-3an 1081  df-tru 1531  df-ex 1772  df-nf 1776  df-sb 2061  df-mo 2615  df-eu 2647  df-clab 2797  df-cleq 2811  df-clel 2890  df-nfc 2960  df-ne 3014  df-ral 3140  df-rex 3141  df-rab 3144  df-v 3494  df-dif 3936  df-un 3938  df-in 3940  df-ss 3949  df-nul 4289  df-if 4464  df-sn 4558  df-pr 4560  df-op 4564  df-uni 4831  df-br 5058  df-opab 5120  df-mpt 5138  df-xp 5554  df-dm 5558  df-iota 6307  df-fv 6356  df-ov 7148
This theorem is referenced by:  bropfvvvv  7776
  Copyright terms: Public domain W3C validator