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

Theorem unocv 20369
Description: The orthocomplement of a union. (Contributed by Mario Carneiro, 23-Oct-2015.)
Hypothesis
Ref Expression
inocv.o = (ocv‘𝑊)
Assertion
Ref Expression
unocv ( ‘(𝐴𝐵)) = (( 𝐴) ∩ ( 𝐵))

Proof of Theorem unocv
Dummy variables 𝑦 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 unss 4111 . . . . . . 7 ((𝐴 ⊆ (Base‘𝑊) ∧ 𝐵 ⊆ (Base‘𝑊)) ↔ (𝐴𝐵) ⊆ (Base‘𝑊))
21bicomi 227 . . . . . 6 ((𝐴𝐵) ⊆ (Base‘𝑊) ↔ (𝐴 ⊆ (Base‘𝑊) ∧ 𝐵 ⊆ (Base‘𝑊)))
3 ralunb 4118 . . . . . 6 (∀𝑦 ∈ (𝐴𝐵)(𝑧(·𝑖𝑊)𝑦) = (0g‘(Scalar‘𝑊)) ↔ (∀𝑦𝐴 (𝑧(·𝑖𝑊)𝑦) = (0g‘(Scalar‘𝑊)) ∧ ∀𝑦𝐵 (𝑧(·𝑖𝑊)𝑦) = (0g‘(Scalar‘𝑊))))
42, 3anbi12i 629 . . . . 5 (((𝐴𝐵) ⊆ (Base‘𝑊) ∧ ∀𝑦 ∈ (𝐴𝐵)(𝑧(·𝑖𝑊)𝑦) = (0g‘(Scalar‘𝑊))) ↔ ((𝐴 ⊆ (Base‘𝑊) ∧ 𝐵 ⊆ (Base‘𝑊)) ∧ (∀𝑦𝐴 (𝑧(·𝑖𝑊)𝑦) = (0g‘(Scalar‘𝑊)) ∧ ∀𝑦𝐵 (𝑧(·𝑖𝑊)𝑦) = (0g‘(Scalar‘𝑊)))))
5 an4 655 . . . . 5 (((𝐴 ⊆ (Base‘𝑊) ∧ 𝐵 ⊆ (Base‘𝑊)) ∧ (∀𝑦𝐴 (𝑧(·𝑖𝑊)𝑦) = (0g‘(Scalar‘𝑊)) ∧ ∀𝑦𝐵 (𝑧(·𝑖𝑊)𝑦) = (0g‘(Scalar‘𝑊)))) ↔ ((𝐴 ⊆ (Base‘𝑊) ∧ ∀𝑦𝐴 (𝑧(·𝑖𝑊)𝑦) = (0g‘(Scalar‘𝑊))) ∧ (𝐵 ⊆ (Base‘𝑊) ∧ ∀𝑦𝐵 (𝑧(·𝑖𝑊)𝑦) = (0g‘(Scalar‘𝑊)))))
64, 5bitri 278 . . . 4 (((𝐴𝐵) ⊆ (Base‘𝑊) ∧ ∀𝑦 ∈ (𝐴𝐵)(𝑧(·𝑖𝑊)𝑦) = (0g‘(Scalar‘𝑊))) ↔ ((𝐴 ⊆ (Base‘𝑊) ∧ ∀𝑦𝐴 (𝑧(·𝑖𝑊)𝑦) = (0g‘(Scalar‘𝑊))) ∧ (𝐵 ⊆ (Base‘𝑊) ∧ ∀𝑦𝐵 (𝑧(·𝑖𝑊)𝑦) = (0g‘(Scalar‘𝑊)))))
76anbi2i 625 . . 3 ((𝑧 ∈ (Base‘𝑊) ∧ ((𝐴𝐵) ⊆ (Base‘𝑊) ∧ ∀𝑦 ∈ (𝐴𝐵)(𝑧(·𝑖𝑊)𝑦) = (0g‘(Scalar‘𝑊)))) ↔ (𝑧 ∈ (Base‘𝑊) ∧ ((𝐴 ⊆ (Base‘𝑊) ∧ ∀𝑦𝐴 (𝑧(·𝑖𝑊)𝑦) = (0g‘(Scalar‘𝑊))) ∧ (𝐵 ⊆ (Base‘𝑊) ∧ ∀𝑦𝐵 (𝑧(·𝑖𝑊)𝑦) = (0g‘(Scalar‘𝑊))))))
8 eqid 2798 . . . . 5 (Base‘𝑊) = (Base‘𝑊)
9 eqid 2798 . . . . 5 (·𝑖𝑊) = (·𝑖𝑊)
10 eqid 2798 . . . . 5 (Scalar‘𝑊) = (Scalar‘𝑊)
11 eqid 2798 . . . . 5 (0g‘(Scalar‘𝑊)) = (0g‘(Scalar‘𝑊))
12 inocv.o . . . . 5 = (ocv‘𝑊)
138, 9, 10, 11, 12elocv 20357 . . . 4 (𝑧 ∈ ( ‘(𝐴𝐵)) ↔ ((𝐴𝐵) ⊆ (Base‘𝑊) ∧ 𝑧 ∈ (Base‘𝑊) ∧ ∀𝑦 ∈ (𝐴𝐵)(𝑧(·𝑖𝑊)𝑦) = (0g‘(Scalar‘𝑊))))
14 3anan12 1093 . . . 4 (((𝐴𝐵) ⊆ (Base‘𝑊) ∧ 𝑧 ∈ (Base‘𝑊) ∧ ∀𝑦 ∈ (𝐴𝐵)(𝑧(·𝑖𝑊)𝑦) = (0g‘(Scalar‘𝑊))) ↔ (𝑧 ∈ (Base‘𝑊) ∧ ((𝐴𝐵) ⊆ (Base‘𝑊) ∧ ∀𝑦 ∈ (𝐴𝐵)(𝑧(·𝑖𝑊)𝑦) = (0g‘(Scalar‘𝑊)))))
1513, 14bitri 278 . . 3 (𝑧 ∈ ( ‘(𝐴𝐵)) ↔ (𝑧 ∈ (Base‘𝑊) ∧ ((𝐴𝐵) ⊆ (Base‘𝑊) ∧ ∀𝑦 ∈ (𝐴𝐵)(𝑧(·𝑖𝑊)𝑦) = (0g‘(Scalar‘𝑊)))))
168, 9, 10, 11, 12elocv 20357 . . . . . 6 (𝑧 ∈ ( 𝐴) ↔ (𝐴 ⊆ (Base‘𝑊) ∧ 𝑧 ∈ (Base‘𝑊) ∧ ∀𝑦𝐴 (𝑧(·𝑖𝑊)𝑦) = (0g‘(Scalar‘𝑊))))
17 3anan12 1093 . . . . . 6 ((𝐴 ⊆ (Base‘𝑊) ∧ 𝑧 ∈ (Base‘𝑊) ∧ ∀𝑦𝐴 (𝑧(·𝑖𝑊)𝑦) = (0g‘(Scalar‘𝑊))) ↔ (𝑧 ∈ (Base‘𝑊) ∧ (𝐴 ⊆ (Base‘𝑊) ∧ ∀𝑦𝐴 (𝑧(·𝑖𝑊)𝑦) = (0g‘(Scalar‘𝑊)))))
1816, 17bitri 278 . . . . 5 (𝑧 ∈ ( 𝐴) ↔ (𝑧 ∈ (Base‘𝑊) ∧ (𝐴 ⊆ (Base‘𝑊) ∧ ∀𝑦𝐴 (𝑧(·𝑖𝑊)𝑦) = (0g‘(Scalar‘𝑊)))))
198, 9, 10, 11, 12elocv 20357 . . . . . 6 (𝑧 ∈ ( 𝐵) ↔ (𝐵 ⊆ (Base‘𝑊) ∧ 𝑧 ∈ (Base‘𝑊) ∧ ∀𝑦𝐵 (𝑧(·𝑖𝑊)𝑦) = (0g‘(Scalar‘𝑊))))
20 3anan12 1093 . . . . . 6 ((𝐵 ⊆ (Base‘𝑊) ∧ 𝑧 ∈ (Base‘𝑊) ∧ ∀𝑦𝐵 (𝑧(·𝑖𝑊)𝑦) = (0g‘(Scalar‘𝑊))) ↔ (𝑧 ∈ (Base‘𝑊) ∧ (𝐵 ⊆ (Base‘𝑊) ∧ ∀𝑦𝐵 (𝑧(·𝑖𝑊)𝑦) = (0g‘(Scalar‘𝑊)))))
2119, 20bitri 278 . . . . 5 (𝑧 ∈ ( 𝐵) ↔ (𝑧 ∈ (Base‘𝑊) ∧ (𝐵 ⊆ (Base‘𝑊) ∧ ∀𝑦𝐵 (𝑧(·𝑖𝑊)𝑦) = (0g‘(Scalar‘𝑊)))))
2218, 21anbi12i 629 . . . 4 ((𝑧 ∈ ( 𝐴) ∧ 𝑧 ∈ ( 𝐵)) ↔ ((𝑧 ∈ (Base‘𝑊) ∧ (𝐴 ⊆ (Base‘𝑊) ∧ ∀𝑦𝐴 (𝑧(·𝑖𝑊)𝑦) = (0g‘(Scalar‘𝑊)))) ∧ (𝑧 ∈ (Base‘𝑊) ∧ (𝐵 ⊆ (Base‘𝑊) ∧ ∀𝑦𝐵 (𝑧(·𝑖𝑊)𝑦) = (0g‘(Scalar‘𝑊))))))
23 elin 3897 . . . 4 (𝑧 ∈ (( 𝐴) ∩ ( 𝐵)) ↔ (𝑧 ∈ ( 𝐴) ∧ 𝑧 ∈ ( 𝐵)))
24 anandi 675 . . . 4 ((𝑧 ∈ (Base‘𝑊) ∧ ((𝐴 ⊆ (Base‘𝑊) ∧ ∀𝑦𝐴 (𝑧(·𝑖𝑊)𝑦) = (0g‘(Scalar‘𝑊))) ∧ (𝐵 ⊆ (Base‘𝑊) ∧ ∀𝑦𝐵 (𝑧(·𝑖𝑊)𝑦) = (0g‘(Scalar‘𝑊))))) ↔ ((𝑧 ∈ (Base‘𝑊) ∧ (𝐴 ⊆ (Base‘𝑊) ∧ ∀𝑦𝐴 (𝑧(·𝑖𝑊)𝑦) = (0g‘(Scalar‘𝑊)))) ∧ (𝑧 ∈ (Base‘𝑊) ∧ (𝐵 ⊆ (Base‘𝑊) ∧ ∀𝑦𝐵 (𝑧(·𝑖𝑊)𝑦) = (0g‘(Scalar‘𝑊))))))
2522, 23, 243bitr4i 306 . . 3 (𝑧 ∈ (( 𝐴) ∩ ( 𝐵)) ↔ (𝑧 ∈ (Base‘𝑊) ∧ ((𝐴 ⊆ (Base‘𝑊) ∧ ∀𝑦𝐴 (𝑧(·𝑖𝑊)𝑦) = (0g‘(Scalar‘𝑊))) ∧ (𝐵 ⊆ (Base‘𝑊) ∧ ∀𝑦𝐵 (𝑧(·𝑖𝑊)𝑦) = (0g‘(Scalar‘𝑊))))))
267, 15, 253bitr4i 306 . 2 (𝑧 ∈ ( ‘(𝐴𝐵)) ↔ 𝑧 ∈ (( 𝐴) ∩ ( 𝐵)))
2726eqriv 2795 1 ( ‘(𝐴𝐵)) = (( 𝐴) ∩ ( 𝐵))
Colors of variables: wff setvar class
Syntax hints:  wa 399  w3a 1084   = wceq 1538  wcel 2111  wral 3106  cun 3879  cin 3880  wss 3881  cfv 6324  (class class class)co 7135  Basecbs 16475  Scalarcsca 16560  ·𝑖cip 16562  0gc0g 16705  ocvcocv 20349
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 1911  ax-6 1970  ax-7 2015  ax-8 2113  ax-9 2121  ax-10 2142  ax-11 2158  ax-12 2175  ax-ext 2770  ax-sep 5167  ax-nul 5174  ax-pow 5231  ax-pr 5295  ax-un 7441
This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-3an 1086  df-tru 1541  df-ex 1782  df-nf 1786  df-sb 2070  df-mo 2598  df-eu 2629  df-clab 2777  df-cleq 2791  df-clel 2870  df-nfc 2938  df-ne 2988  df-ral 3111  df-rex 3112  df-rab 3115  df-v 3443  df-sbc 3721  df-dif 3884  df-un 3886  df-in 3888  df-ss 3898  df-nul 4244  df-if 4426  df-pw 4499  df-sn 4526  df-pr 4528  df-op 4532  df-uni 4801  df-br 5031  df-opab 5093  df-mpt 5111  df-id 5425  df-xp 5525  df-rel 5526  df-cnv 5527  df-co 5528  df-dm 5529  df-rn 5530  df-res 5531  df-ima 5532  df-iota 6283  df-fun 6326  df-fn 6327  df-f 6328  df-fv 6332  df-ov 7138  df-ocv 20352
This theorem is referenced by:  cssincl  20377
  Copyright terms: Public domain W3C validator