Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > ralun | GIF version |
Description: Restricted quantification over union. (Contributed by Jeff Madsen, 2-Sep-2009.) |
Ref | Expression |
---|---|
ralun | ⊢ ((∀𝑥 ∈ 𝐴 𝜑 ∧ ∀𝑥 ∈ 𝐵 𝜑) → ∀𝑥 ∈ (𝐴 ∪ 𝐵)𝜑) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | ralunb 3252 | . 2 ⊢ (∀𝑥 ∈ (𝐴 ∪ 𝐵)𝜑 ↔ (∀𝑥 ∈ 𝐴 𝜑 ∧ ∀𝑥 ∈ 𝐵 𝜑)) | |
2 | 1 | biimpri 132 | 1 ⊢ ((∀𝑥 ∈ 𝐴 𝜑 ∧ ∀𝑥 ∈ 𝐵 𝜑) → ∀𝑥 ∈ (𝐴 ∪ 𝐵)𝜑) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 103 ∀wral 2414 ∪ cun 3064 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 105 ax-ia2 106 ax-ia3 107 ax-io 698 ax-5 1423 ax-7 1424 ax-gen 1425 ax-ie1 1469 ax-ie2 1470 ax-8 1482 ax-10 1483 ax-11 1484 ax-i12 1485 ax-bndl 1486 ax-4 1487 ax-17 1506 ax-i9 1510 ax-ial 1514 ax-i5r 1515 ax-ext 2119 |
This theorem depends on definitions: df-bi 116 df-tru 1334 df-nf 1437 df-sb 1736 df-clab 2124 df-cleq 2130 df-clel 2133 df-nfc 2268 df-ral 2419 df-v 2683 df-un 3070 |
This theorem is referenced by: omsinds 4530 ac6sfi 6785 fimax2gtrilemstep 6787 finomni 7005 uzsinds 10208 iseqf1olemqk 10260 seq3f1olemstep 10267 fimaxre2 10991 modfsummod 11220 |
Copyright terms: Public domain | W3C validator |